Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
In graph theory, what is the distinction between minimal distance (which Dijkstra’s algorithm finds), and minimal path (which I’m not sure what it is)?
Minimal path is the set of edges which when traversed cover the least amount of distance between two edges. Minimal distance is the sum of the distance between the edges of a minimal path.