digraphs vocabulary
Factor handbook > Vocabulary index


Summary
Simple directed graph implementation for topological sorting

Meta-data
Tags:collections
Authors:Alex Chapman


Words

Tuple classes
ClassSuperclassSlots
digraph hashtable
vertex tuplevalue edges


Ordinary words
WordStack effect
(topological-sort)( seq unvisited key -- seq unvisited )
<digraph>( -- digraph )
<vertex>( value -- vertex )
@edges( from to digraph -- to edges )
add-edge( from to digraph -- )
add-vertex( key value digraph -- )
children( key digraph -- seq )
delete-edge( from to digraph -- )
delete-to-edges( to digraph -- )
delete-vertex( key digraph -- )
topological-sort( digraph -- seq )
topological-sorted-values( digraph -- seq )
unvisited?( unvisited key -- ? )
visit-children( seq unvisited key -- seq unvisited )
visited( unvisited key -- )


Class predicate words
WordStack effect
digraph?( object -- ? )
vertex?( object -- ? )


Files