Introduction - If you have any usage issues, please Google them yourself
Reading from a file into a right to a positive figure (n nodes, m edges) of the weight matrix, said output this figure a junction to the length of the shortest path to the rest of the nodes. Must use Dijkstra algorithm, using other algorithms (such as exhaustive) does not meet the requirements.