James Bardin ca272b2107 Add methods for topological sorts ... A topological walk was previously only done in Terraform via the concurrent method used for walking the primary dependency graph in core. Sometime however we want a dependency ordering without the overhead of instantiating the concurrent walk with the channel-based edges. Add TopologicalOrder and ReverseTopologicalOrder to obtain a list of nodes which can be used to visit each while ensuring that all dependencies are satisfied.		2022-07-22 13:57:16 -04:00
..
dag_test.go	Add methods for topological sorts	2022-07-22 13:57:16 -04:00
dag.go	Add methods for topological sorts	2022-07-22 13:57:16 -04:00
dot_test.go	Move dag/ to internal/dag/	2021-05-17 14:09:07 -07:00
dot.go	Move dag/ to internal/dag/	2021-05-17 14:09:07 -07:00
edge_test.go	Move dag/ to internal/dag/	2021-05-17 14:09:07 -07:00
edge.go	do not use pointer addr strings as map keys in set	2022-01-05 11:28:47 +00:00
graph_test.go	Move dag/ to internal/dag/	2021-05-17 14:09:07 -07:00
graph.go	Move dag/ to internal/dag/	2021-05-17 14:09:07 -07:00
marshal_test.go	Move dag/ to internal/dag/	2021-05-17 14:09:07 -07:00
marshal.go	de-linting	2021-09-01 11:36:21 -04:00
set_test.go	Move dag/ to internal/dag/	2021-05-17 14:09:07 -07:00
set.go	Move dag/ to internal/dag/	2021-05-17 14:09:07 -07:00
tarjan_test.go	Move dag/ to internal/dag/	2021-05-17 14:09:07 -07:00
tarjan.go	Move dag/ to internal/dag/	2021-05-17 14:09:07 -07:00
walk_test.go	Move tfdiags/ to internal/tfdiags/	2021-05-17 14:09:07 -07:00
walk.go	Move tfdiags/ to internal/tfdiags/	2021-05-17 14:09:07 -07:00