Summary
Simple directed graph implementation for topological sorting

Metadata

Tags:	collections
Authors:	Alex Chapman

Words

Tuple classes

Class	Superclass	Slots
digraph	hashtable
vertex	tuple	value edges

Ordinary words

Word	Stack 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

Word	Stack effect
digraph?	( object -- ? )
vertex?	( object -- ? )

Files


Metadata files