Dan Kortschak
|
da72779e7a
|
floats/scalar: new package containing non-vector functions from floats
|
2020-08-07 07:59:02 +09:30 |
|
Dan Kortschak
|
27220e4f5c
|
graph/path: add missing doc comment
|
2020-07-12 18:07:51 +09:30 |
|
Dan Kortschak
|
6a06a241d1
|
graph/path: use a struct to make intentions in negative edges clearer
|
2020-07-12 18:07:51 +09:30 |
|
Dan Kortschak
|
0631cb635a
|
graph/path: improve negative costs accounting field documentation
|
2020-07-12 07:26:07 +09:30 |
|
Dan Kortschak
|
04e487c6bc
|
graph/path: add doc comments for unexported path construction methods
|
2020-07-12 07:26:07 +09:30 |
|
Dan Kortschak
|
9ae0689dae
|
graph/path: add option to retain all paths from single-source path finding routines
|
2020-07-10 07:22:35 +09:30 |
|
Dan Kortschak
|
3bedd58622
|
graph/path: properly report negative cycles in Shortest.To
We still use the maxEdges condition to allow a better exploration of the graph
before terminating.
|
2020-07-07 06:20:59 +09:30 |
|
Dan Kortschak
|
8331aaab06
|
graph/path: fix documentation on Shortest
|
2020-06-14 17:45:15 +09:30 |
|
Dan Kortschak
|
72a397e184
|
graph/path: reduce indexing into next in Shortest.To
|
2020-06-14 17:45:15 +09:30 |
|
Dan Kortschak
|
c5919b2e44
|
graph/path: make sure absent nodes are returned with the correct ID
|
2019-12-05 23:30:55 +10:30 |
|
Dan Kortschak
|
97dc6c81b4
|
graph/path: use NaN internally for negative cycle weights
|
2019-02-10 06:50:51 +10: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
|
5b0db962f3
|
graph/path: make AllShortest safe for length zero
|
2018-11-21 07:57:39 +10:30 |
|
Dan Kortschak
|
f5d91d72f8
|
graph/path: allow incremental path building for Dijkstra
|
2018-05-24 07:13:55 +09:30 |
|
Dan Kortschak
|
6b03bc22e1
|
graph: use int64 for node retrieval
|
2018-03-24 09:21:44 +10:30 |
|
kortschak
|
fa0c5aa7bc
|
all: use golang.org/x/exp/rand instead of math/rand
|
2017-11-17 11:52:34 +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 |
|
kortschak
|
a18d79f600
|
graph/{internal,path,topo}: factor reverse function out into internal
|
2017-09-15 07:05:29 +09:30 |
|
kortschak
|
15ecc07d40
|
graph/path/...: update for int64 IDs
|
2017-07-02 08:38:42 +09:30 |
|
Brendan Tracey
|
0d639745f1
|
all: update packages from mat64 to mat.
This mostly changes package name and code, but also fixes a couple of name clashes with the new package names
|
2017-06-13 10:28:21 -06:00 |
|
Brendan Tracey
|
d33397aa65
|
all: change import paths
|
2017-05-23 00:03:03 -06:00 |
|
Brendan Tracey
|
059a6c43f9
|
graph: imported graph as a subtree
|
2017-05-23 00:02:59 -06:00 |
|