Why must a shortest path in the sense of having fewest edges

Why must a shortest path (in the sense of having fewest edges) from one vertex to another vertex be a simple path? What if it isn’t a simple path?

Solution

Shortest path:Finding a lane between the nodes graphically in such a way that the volume of weights of basic edges is called shortest path.

1.Many algorithms are used to solve this shortest path like dijkstra\'s algorithm ,floyd warshall algorithm and viterbi algorithm..............etc

2.Shortest path algorithms are invoved straightly to caluclate the direction between somatic places like Mapquest and google maps.they need quick field of algorithms.

3.Shortest path algorithms are utilized to realize the optimal pattern of alternatives to attain a particular goal position.

4.In case of telecommunications, the shortest path is known as min-delay path,generally a widest path is binded.

5.Periodically the edges in graph are in egostic enthusiasm.each and every edge in computer reticulum maybe affliated to disimilar person.every computer is with contrasting transmission speeds

6.Hence each edge in network is with number weight which is identical to number of milliseconds to convey a message.

7.The main aim of this shortest path is to dispatch a message between two points in a short duration feasiblely.

8.The dijkstara algorithm roughly as shown below:

M be single vertex P

while (M has less than n vertices)

{

identify edge (a,b)

with a in M and not in M

Reducing d(P,a)+length(a,b)

add(a,b) related to P

d(P,b)=d(P,a)+length(a,b)

}