Dijkstra

Dijkstra Tool with directed graphs

Hello:
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:
digraph
{
    N1->N2;
    N2->N3;
    N3->N1;
}
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.

Recent comments

Syndicate content