source: project/release/3/rgraph/trunk/rgraph-vis.scm @ 33923

Last change on this file since 33923 was 9977, checked in by Kon Lovett, 13 years ago

Using canonical directory structure.

File size: 2.4 KB
Line 
1; Copyright (c) 2004, Jonah Nathaniel Beckford
2; All rights reserved.
3;
4; Redistribution and use in source and binary forms, with or without
5; modification, are permitted provided that the following conditions
6; are met:
7;
8;   Redistributions of source code must retain the above copyright
9;   notice, this list of conditions and the following disclaimer.
10;
11;   Redistributions in binary form must reproduce the above copyright
12;   notice, this list of conditions and the following disclaimer in
13;   the documentation and/or other materials provided with the
14;   distribution.
15;
16;   Neither the name of the author nor the names of its contributors
17;   may be used to endorse or promote products derived from this
18;   software without specific prior written permission.
19;
20; THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21; "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22; LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
23; FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
24; COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
25; INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
26; (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
27; SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28; HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
29; STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
30; ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
31; OF THE POSSIBILITY OF SUCH DAMAGE.
32;
33; jonah@usermail.com
34
35;; From Boost Graph Library.  See COPYRIGHT.
36(define-record-type dfs-visitor-t
37  ;; create a new dfs-visitor
38  (dfs-visitor
39    init start discover examine
40    tree-edge back-edge forward-or-cross-edge finish)
41  ;; predicate
42  dfs-visitor?
43  ;; accessors
44  (init dfs-visitor-init set-dfs-visitor-init!)
45  (start dfs-visitor-start set-dfs-visitor-start!)
46  (discover dfs-visitor-discover set-dfs-visitor-discover!)
47  (examine dfs-visitor-examine set-dfs-visitor-examine!)
48  (tree-edge dfs-visitor-tree-edge set-dfs-visitor-tree-edge!)
49  (back-edge dfs-visitor-back-edge set-dfs-visitor-back-edge!)
50  (forward-or-cross-edge dfs-visitor-forward-or-cross-edge set-dfs-visitor-forward-or-cross-edge!)
51  (finish dfs-visitor-finish set-dfs-visitor-finish!))
52
53;; create a new, null dfs-visitor
54(define (null-dfs-visitor)
55  (dfs-visitor #f #f #f #f #f #f #f #f))
56
Note: See TracBrowser for help on using the repository browser.