func TopologicalSort(g Graph) ([]ID, bool) {
	// L = Empty list that will contain the sorted nodes
	L := []ID{}
	isDAG := true
	color := make(map[ID]string)
	for v := range g.GetNodes() {
		color[v] = "white"
	}

	// for each vertex v in G:
	for v := range g.GetNodes() {
		// if v.color == "white":
		if color[v] == "white" {
			// topologicalSortVisit(v, L, isDAG)
			topologicalSortVisit(g, v, &L, &isDAG, &color)
		}
	}

	return L, isDAG
}
func TopologicalSort(g Graph) ([]ID, bool) {
	
	L := []ID{}
	isDAG := true
	color := make(map[ID]string)
	for v := range g.GetNodes() {
		color[v] = "white"
	}

	
	for v := range g.GetNodes() {
		
		if color[v] == "white" {
			
			topologicalSortVisit(g, v, &L, &isDAG, &color)
		}
	}

	return L, isDAG
}
func TopologicalSort ( g Graph ) ( [ ] ID , bool ) { // L = Empty list that will contain the sorted nodes L := [ ] ID { } isDAG := true color := make ( map [ ID ] string ) for v := range g . GetNodes ( ) { color [ v ] = " " } // for each vertex v in G: for v := range g . GetNodes ( ) { // if v.color == "white": if color [ v ] == " " { // topologicalSortVisit(v, L, isDAG) topologicalSortVisit ( g , v , & L , & isDAG , & color ) } } return L , isDAG }
// TopologicalSort does topological sort(ordering) with DFS.
// It returns true if the graph is a DAG (no cycle, with a topological sort).
// False if the graph is not a DAG (cycle, with no topological sort).
//
//	 0. TopologicalSort(G)
//	 1.
//	 2. 	L = Empty list that will contain the sorted nodes
//	 3. 	isDAG = true
//	 4.
//	 5. 	for each vertex v in G:
//	 6.
//	 7. 		if v.color == "white":
//	 8.
//	 9. 			topologicalSortVisit(v, L, isDAG)
//	10.
//	11.
//	12.
//	13.
//	14. topologicalSortVisit(v, L, isDAG)
//	15.
//	16. 	if v.color == "gray":
//	17. 		isDAG = false
//	18. 		return
//	19.
//	20. 	if v.color == "white":
//	21.
//	22. 		v.color = "gray":
//	23.
//	24.			for each child vertex w of v:
//	25. 			topologicalSortVisit(w, L, isDAG)
//	26.
//	27. 		v.color = "black"
//	28.			L.push_front(v)
//
TopologicalSort does topological sort ( ordering ) with DFS . It returns true if the graph is a DAG ( no cycle with a topological sort ) . False if the graph is not a DAG ( cycle with no topological sort ) . 0 . TopologicalSort ( G ) 1 . 2 . L = Empty list that will contain the sorted nodes 3 . isDAG = true 4 . 5 . for each vertex v in G : 6 . 7 . if v . color == white : 8 . 9 . topologicalSortVisit ( v L isDAG ) 10 . 11 . 12 . 13 . 14 . topologicalSortVisit ( v L isDAG ) 15 . 16 . if v . color == gray : 17 . isDAG = false 18 . return 19 . 20 . if v . color == white : 21 . 22 . v . color = gray : 23 . 24 . for each child vertex w of v : 25 . topologicalSortVisit ( w L isDAG ) 26 . 27 . v . color = black 28 . L . push_front ( v )