i have 2 questions:
Question 1. suppose we have generated a random weighted graph with 100 vertices and 2300 edges and found shortest path frome node 1 to node 100 using function ShortestPath(G,1,100). this function returns a path like [1 3 8 2 9 100] but don't get us value of shortest path!
in other words if weights are costs of travelling on edges,we want to find minimum cost of travelling from node 1 to node 100.
how can i find value of shortest path (minimum weight/cost) ?
Question 2. i want to create a sub graph of G by removing the edge that has maximum weight on shortest path found in Question 1. how can i find such edge and how to create such sub graph?