|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.
- So you want to append the
5 hours 21 min ago
- I'm using win7
6 hours 21 min ago
- What system are you running
9 hours 40 min ago
- What is graph_qt.h ?
12 hours 5 min ago
- You can look in config.log to
13 hours 7 min ago
- - I solved my icon's problem.
13 hours 21 min ago
- No warning message that is the problem
19 hours 29 min ago
- How is the result worse with
1 day 10 hours ago
- how to avoid edge overlap?
1 day 11 hours ago
- The overlap parameter only
1 day 14 hours ago