Dijkstra's Algorithm Calculator

Dijkstra's algorithm takes a square matrix (representing a network with weighted arcs) and finds arcs which form a shortest route from the first node. The network must be connected. Negative weights cannot be used and will be converted to positive weights.

Enter the matrix size [one integer between 2 and 26]: