GO Solution For UVa 10099 - The Tourist Guide. In this post we will see how we can solve this challenge in GoLang for UVa Online Judge.

Problem Description

Mr. G. works as a tourist guide. His current assignment is to take some tourists from one city to another. Some two-way roads connect the cities. For each pair of neighboring cities there is a bus service that runs only between those two cities and uses the road that directly connects them. Each bus

...

You can find the full details of the problem The Tourist Guide at UVa Online Judge

Sample Input

7 10
1 2 30
1 3 15
1 4 10
2 4 25
2 5 60
3 4 40
3 6 20
4 7 35
5 7 20
6 7 30
1 7 99
0 0

Sample Output

Scenario #1
Minimum Number of Trips = 5

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

Solution originally posted at: Github by @codingsince1985