|Join the Graphviz open source team!|
|With the explosion of graph-based data, the Graphviz project offers new contributors excellent opportunities to explore new concepts, or enhance tools that thousands of projects already use. We're looking for programmers and technical experts in core algorithms, interactive and command line programs, and rendering. This page provides a list of possible open work. And, of course, we are open to your suggestions. If you are interested, please contact us.|
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.
- Graphviz should be producing
4 hours 30 min ago
- You might see if the
4 hours 34 min ago
- Finally I can build and use the 64 bit libraries
7 hours 30 min ago
- Hi thanks much for the
16 hours 40 min ago
- Graphviz uses a pre-computed
22 hours 44 min ago
- I'll have to check up on
23 hours 9 min ago
- I will try to rationalize the
5 days 1 hour ago
Yes, an unfortunate
5 days 4 hours ago
- Probably an unfortunate
5 days 20 hours ago
- Just FYI. The tar.gz sources
6 days 9 min ago