GO Solution For UVa 10000 - Longest Paths. In this post we will see how we can solve this challenge in GoLang for UVa Online Judge.

Problem Description

It is a well known fact that some people do not have their social abilities completely enabled. One example is the lack of talent for calculating distances and intervals of time. This causes some people to always choose the longest way to go from one place to another, with the consequence that they

...

You can find the full details of the problem Longest Paths at UVa Online Judge

Sample Input

2
1
1 2
0 0
5
3
1 2
3 5
3 1
2 4
4 5
0 0
5
5
5 1
5 2
5 3
5 4
4 1
4 2
0 0
0

Sample Output

Case 1: The longest path from 1 has length 1, finishing at 2

Case 2: The longest path from 3 has length 4, finishing at 5

Case 3: The longest path from 5 has length 2, finishing at 1

Solution: Please check the main.go snippet for the solution.

Solution originally posted at: Github by @codingsince1985