Dan Kortschak
|
f0f9a9eaf8
|
graph/simple: use lazy edge-based node iterator for From, To and Nodes methods
|
2020-07-02 07:47:46 +09:30 |
|
Dan Kortschak
|
ee7dd3742a
|
graph/path: indicate negative cycle weights with -Inf instead of NaN
The paths are undefined, but the limit of the path weight is -Inf.
|
2019-02-10 06:50:51 +10:30 |
|
Dan Kortschak
|
936e3fec9e
|
graph/path: fix negative cycle handling by AllShortest and FloydWarshall
Also remove unjustifiable claim in Bellman-Ford negative cycles example and add
Floyd-Warshall negative cycles example.
|
2019-02-10 06:50:51 +10:30 |
|
Dan Kortschak
|
b73a2c92ff
|
graph: add node, edge and line iterators
|
2018-09-23 09:25:56 +09:30 |
|
Dan Kortschak
|
6b03bc22e1
|
graph: use int64 for node retrieval
|
2018-03-24 09:21:44 +10:30 |
|
kortschak
|
805531d142
|
all: change capitalization of gonum in license header
|
2017-11-02 06:54:08 +10:30 |
|
kortschak
|
f818f8f7a9
|
graph/path: allow Shortest to traverse negative cycles
Also add checks for cases where negative cycles exist but are not marked
to protect against future shortest path function additions.
|
2017-09-15 08:17:25 +09:30 |
|