package/gonum
1
0
Fork 0
mirror of https://github.com/gonum/gonum.git synced 2025-10-11 01:50:12 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

Removed vertex set from GonumGraph, it was superfluous

Browse Source
This commit is contained in:
Jsor
2013-07-25 05:19:18 -07:00
parent 2c6094861d
commit bf998eb8e5
2 changed files with 29 additions and 27 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
graphSearch.go
View File

@@ -198,7 +198,7 @@ func BellmanFord(source int, graph Graph, Cost func(int, int) float64) (paths ma
// It makes use of Bellman-Ford and a dummy graph. It creates a dummy node containing edges with a cost of zero to every other node. Then it runs Bellman-Ford with this
// dummy node as the source.
//
// Finally, it removes the dummy node and run Dijkstra's starting at every node.
// Finally, it removes the dummy node and runs Dijkstra's starting at every node.
//
// This algorithm is fairly slow. Its purpose is to remove negative edge weights to allow Dijkstra's to function properly. It's probably not worth it to run this algorithm if you have
// all non-negative edge weights. Also note that this implementation copies your whole graph into a GonumGraph (so it can add/remove the dummy node and edges and reweight the graph).