Changeset 27211 in project
 Timestamp:
 08/06/12 08:40:15 (9 years ago)
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

wiki/eggref/4/graphdfs
r24535 r27211 20 20 <procedure>graphdfsforeach:: G FNODE FEDGE ROOTS > UNDEFINED</procedure> 21 21 22 depthfirst search iterator; given a list of initial nodes, {{ROOTS}},22 Depthfirst search iterator; given a list of initial nodes, {{ROOTS}}, 23 23 the successors of each initial node are visited in depthfirst search 24 24 order, and procedures {{FNODE}} and {{FEDGE}} are applied to each node … … 33 33 <procedure>graphdfsfold:: G FNODE FEDGE ROOTS NODEINIT EDGEINIT > NODESTATE EDGESTATE</procedure> 34 34 35 depthfirst search iterator with state; given a list of initial nodes,35 Depthfirst search iterator with state; given a list of initial nodes, 36 36 {{ROOTS}}, and initial node state and edge state, {{NODEINIT}} and 37 37 {{EDGEINIT}} the successors of each initial node are visited in … … 50 50 <procedure>graphdfsdepth:: G ROOTS > NODEDEPTH TRAVERSALTIME</procedure> 51 51 52 depthfirst search depth; given a list of initial nodes, this52 Depthfirst search depth; given a list of initial nodes, this 53 53 procedure computes shortest DFS depth for each nodes traversed, and 54 54 the number of nodes visited while traversing the successors of each … … 61 61 <procedure>graphpreorder:: G ROOT > ((NODE NUM) ... )</procedure> 62 62 63 computethe preorder traversal sequence number for each successor of the given initial node.63 Computes the preorder traversal sequence number for each successor of the given initial node. 64 64 65 65 … … 67 67 <procedure>graphpostorder:: G ROOT > ((NODE NUM) ... )</procedure> 68 68 69 computethe postorder traversal sequence number for each successor of the given initial node.69 Computes the postorder traversal sequence number for each successor of the given initial node. 70 70 71 71
Note: See TracChangeset
for help on using the changeset viewer.