This is a type of hashtable.The output of topSort has class SortedDigraph. In the current version of Graphs (version 0.3.3) the only use of SortedDigraph is in topSort.
i1 : G = digraph{{5,2},{5,0},{4,0},{4,1},{2,3},{3,1}}
o1 = Digraph{0 => {} }
1 => {}
2 => {3}
3 => {1}
4 => {0, 1}
5 => {2, 0}
o1 : Digraph
|
i2 : H = topSort G
o2 = SortedDigraph{digraph => Digraph{0 => {} } }
1 => {}
2 => {3}
3 => {1}
4 => {0, 1}
5 => {2, 0}
map => HashTable{0 => 4}
1 => 6
2 => 3
3 => 5
4 => 2
5 => 1
newDigraph => Digraph{1 => {3, 4}}
2 => {4, 6}
3 => {5}
4 => {}
5 => {6}
6 => {}
o2 : SortedDigraph
|
i3 : class H o3 = SortedDigraph o3 : Type |
The object SortedDigraph is a type, with ancestor classes HashTable < Thing.