Generated: July 29, 2004, 07:56:37 A SchemeDoc Manual

Rooster Graph - Depth First Search Algorithms

Jonah Nathaniel Beckford © 2004

Source file: rgraph-alg-dfs.scm
LAML Version 23.00 (December 12, 2003, full)

Table of Contents:
1. Depth First Search Algorithm

Alphabetic index:
depth-first-search (GTYPE-depth-first-search graph dfs-visitor color-map starting-vertex) Depth first search.
depth-first-visit (GTYPE-depth-first-visit graph dfs-visitor color set-color! starting-vertex) Depth first visit

1 Depth First Search Algorithm

depth-first-search
Form (GTYPE-depth-first-search graph dfs-visitor color-map starting-vertex)
Description Depth first search.
Parameters graph The graph object.
dfs-visitor A DFS visitor object
color Property map for the 'color' property.
starting-vertex Either #f, or the vertex the DFS search will begin with
See also DFS Visitor dfs-visitor

depth-first-visit
Form (GTYPE-depth-first-visit graph dfs-visitor color set-color! starting-vertex)
Description Depth first visit
Parameters graph The graph object.
dfs-visitor A DFS visitor object
color Property map for the 'color' property.
starting-vertex The vertex that will be DFS visited.
See also DFS Visitor dfs-visitor


Generated: July 29, 2004, 07:56:37
Generated by LAML SchemeDoc .