поиск-пути
Dijkstra's algorithm for finding the shortest path
The graph in the problem is undirected. How do I turn off some edges so that the user can choose which edges they don't need ... << " ";
cout << "\nWeight : " << pos[n - 1] << "\n";
cout << endl;
return 0;
}