I want to find the shortest path from starting point to end point.
Example:
If Any starting point is having two route to reach to destination point.
Like: A->B->C->D->E
A->C->E
Here A is having to way to go to E. So i want to find shortest path algorithm code in ASP that can find shortest path from A to E.

Google is your friend: Be nice and visit him often. He can answer questions a lot more quickly than posting them here...

I think what you are looking for is called "The Travelling Salesman problem" and there are some very good explanations of it here: Google: salesman problem[^]