|Due to organizational changes, the Graphviz web site will see some modifications in the near future. In particular, it will probably no longer provide binary packages for Windows and Macs. The latter can be obtained via Macports or Home Brew. If someone wants to set up Appveyor for Windows, we would be grateful.|
Dijkstra Tool with directed graphs
I'm using the dijkstra tool in order to find the shortest path in a directed graph, however this tool seem to consider every edge to be bidirectional.
For instance, lets consider this simple example:
After applying the algorithm I get that N3 is reachable with distance 1, having N1 as the previous node.
Is this supposed to happen? Any solution for this problem?
Thanks in advance. Best regards.
- ok thanks
23 hours 39 min ago
- yeah but
1 day 17 hours ago
- renders OK in
1 day 22 hours ago
- For most font features, we
2 days 2 hours ago
- Broken: gviz.js missing
3 days 7 min ago
- Where did you get your Linux
3 days 5 hours ago
- I know various people have
3 days 19 hours ago
- Creating the graph depends on
1 week 1 hour ago
- Thank you for the "invis' tip
1 week 18 hours ago
- Re: compilation issue on slackware 14.1
1 week 3 days ago