Add `bellman_ford_path`

python-graphblas / graphblas-algorithms

Graph algorithms written in GraphBLAS

Apache License 2.0

73 stars 4 forks source link

Closed eriknw closed 1 year ago

eriknw commented 1 year ago

There are several algorithms that return one or more paths, so this PR can help blaze the way to determine how we do this.

I do something different for parent Bellman-Ford by not using UDTs/UDFs. I'm not sure if it's the best way. This also hasn't been benchmarked. YOLO.

eriknw commented 1 year ago

YOLO :)

Happy to receive feedback even after merging