search

bmritz / datajet

A Data Dependency Graph Framework and Executor
https://bmritz.github.io/datajet/
MIT License
2 stars 1 forks source link

Investigate use of networkx for graph traversal #5

Closed bmritz closed 2 years ago

bmritz commented 2 years ago

We would take on a dependency, but I'm not that confident in my "path finding code" right now.

LINKS networkx traversal

G = nx.from_edgelist([(from_node, to_node) for to_node in data_map for path in data_map[to_node] for from_node in path['in']])
list(nx.bfs_tree(G, 'd').nodes())
bmritz commented 2 years ago

Closing -- this is a heavy dependency, and I am much more confident in graph traversal and dependency resolution after https://github.com/bmritz/datajet/pull/14