Shortest Path

View as PDF

Submit solution

Points: 5
Time limit: 1.0s
Memory limit: 16M

Problem type

Given a graph as an adjacency matrix, find the shortest path from the first to the last vertex.

Input Specification

N \le 100, the number of vertices.
The adjacency matrix - N rows of N numbers.
The first row represents the first vertex, and similarly the last row = the last vertex.

Output Specification

The distance from the first vertex to the last one.

Sample Input

0 1 0
0 0 1
0 0 0

Sample Output



There are no comments at the moment.