Note that this is a major, API-breaking change.
Also bunched into this commit:
- rename namespace `shortestPaths` to `ksp`
- omit unneeded namespace qualifiers
- move tests from `GraphTest` to `KSPTest` and wrote more
- path representation explanation in .md file
Former-commit-id: f395c3df40 [formerly 7fa07d1c8f]
Former-commit-id: f50dd3ce7c
thanks to new Dijkstra, the (1-)shortest paths construction code is
simpler
Former-commit-id: ec2ef461b8 [formerly 5757d66bc5]
Former-commit-id: 00f3d35a38
Originally, I tried to adapt the existing (but in various ways broken)
Dijkstra implementation in `storm::utility::graph::performDijkstra`,
but that proved to be more cumbersome (mostly because of the behaviour on
initial states) than simply rolling my own -- so that's what I
eventually did.
Former-commit-id: 33b2be8067 [formerly 0d5c507568]
Former-commit-id: b35fc0bee3
TODO: check; improve
Things that aren't going well:
- On the example graph BRP-16-2, all nodes have distance 1. I that
possible??
- The initial states list themself as their own predecessor. That's
bad, because it's simply false (unless there is a self-loop).
Former-commit-id: 06f9a28306 [formerly e7e2385e0d]
Former-commit-id: 3505011831
tomjanson