James Bardin 8cf0a8ca9c faster DAG transitive reduction ... In the case of highly-connected graphs, the TransitiveReduction process was far too computationally intensive. Since no operations are applied to the nodes, and the walk order is not even user visible, we don't need to sort them n^2 times.		2017-10-03 11:24:59 -04:00
..
dag_test.go	faster DAG transitive reduction	2017-10-03 11:24:59 -04:00
dag.go	faster DAG transitive reduction	2017-10-03 11:24:59 -04:00
dot_test.go	dag: string DotOpts through to vertex	2017-01-08 11:59:18 -08:00
dot.go	dag: string DotOpts through to vertex	2017-01-08 11:59:18 -08:00
edge_test.go	dag: Remove, RemoveEdge, DownEdges, UpEdges	2015-02-19 12:07:54 -08:00
edge.go	dag: export more things	2015-02-19 12:08:07 -08:00
graph_test.go	dag: test for EdgesFrom, EdgesTo	2016-10-19 13:38:53 -07:00
graph.go	Add DebugVisitInfo	2016-11-15 10:39:08 -05:00
marshal_test.go	dag: call into DotNode to get attributes	2016-12-03 15:17:14 -08:00
marshal.go	faster DAG transitive reduction	2017-10-03 11:24:59 -04:00
set_test.go	dag: method for filtering a set on arbitrary criteria	2017-05-11 11:57:46 -07:00
set.go	dag: method for filtering a set on arbitrary criteria	2017-05-11 11:57:46 -07:00
tarjan_test.go	dag: Remove, RemoveEdge, DownEdges, UpEdges	2015-02-19 12:07:54 -08:00
tarjan.go	dag: fix walk order issue, scc issues	2015-02-19 12:07:55 -08:00
walk_test.go	Fix removeEdge test failures	2017-02-20 19:54:34 -05:00
walk.go	terraform+dag: Set lower log levels	2017-08-14 11:43:45 +02:00