issues
search
bitwalker
/
libgraph
A graph data structure library for Elixir projects
MIT License
524
stars
75
forks
source link
Optimise Bellman-Ford implementation
#62
Closed
hauleth
closed
1 year ago
hauleth
commented
1 year ago
Reduce amount of required traversals
Remove expensive recomputation of weights (do it once beforehand)
Optimise search for negative cycles
Optimise fetching data from the distances map