func()

in graph/graph.go [122:130]

• 9 lines of code
• 3 McCabe index (conditional complexity)

func (g *Graph[NT]) topologicalSortInternal(node NT, visited *map[string]bool, stack *[]NT) {
	(*visited)[node.GetName()] = true
	for _, edge := range g.nodeEdges[node.GetName()] {
		if !(*visited)[edge.To.GetName()] {
			g.topologicalSortInternal(edge.To, visited, stack)
		}
	}
	*stack = append([]NT{node}, *stack...)
}