Shortest paths by Dijkstra algorithm online on Intellect

Used 527 times

Shortest paths for a given graph by Dijkstra algorithm

Enter the weight matrix of a directed graph. An empty cell means there is no edge, and the diagonal is treated as 0. Dijkstra algorithm works only with non-negative weights. Select the start and end vertices: the shortest path will be highlighted on the right with red lines.

From: To:

Graph and shortest path

Enter the matrix and run the calculation.

In step-by-step mode, each step selects the current vertex with the minimum distance and updates distances to adjacent vertices. Processed vertices are marked in the results table.

Was this answer useful?

Choose a quick rating so we can improve the next answer for you.

How satisfied are you?

Your answer option for this service or noticed an error:

Dijkstra algorithm finds shortest paths from a selected start vertex to all other vertices in a graph with non-negative edge weights. At each step it selects the unvisited vertex with the smallest known distance and relaxes distances to its neighbours.

Algorithms Programming

Shortest paths by Dijkstra algorithm online on Intellect

Shortest paths for a given graph by Dijkstra algorithm

Graph and shortest path

Related tools

Comments

To leave a comment