|
| 1 | +# Trans Problem |
| 2 | + |
| 3 | +The local commuter railroad services a number of towns in Kiwiland. Because of monetary concerns, all of the tracks are 'one-way.' That is, a route from Kaitaia to Invercargill does not imply the existence of a route from Invercargill to Kaitaia. In fact, even if both of these routes do happen to exist, they are distinct and are not necessarily the same distance! |
| 4 | + |
| 5 | +The purpose of this problem is to help the railroad provide its customers with information about the routes. In particular, you will compute the distance along a certain route, the number of different routes between two towns, and the shortest route between two towns. |
| 6 | + |
| 7 | +- *Input*: A directed graph where a node represents a town and an edge represents a route between two towns. The weighting of the edge represents the distance between the two towns. A given route will never appear more than once, and for a given route, the starting and ending town will not be the same town. |
| 8 | + |
| 9 | +- *Output*: For test input 1 through 5, if no such route exists, output 'NO SUCH ROUTE'. Otherwise, follow the route as given; do not make any extra stops! For example, the first problem means to start at city A, then travel directly to city B (a distance of 5), then directly to city C (a distance of 4). |
| 10 | +The distance of the route A-B-C. |
| 11 | +The distance of the route A-D. |
| 12 | +The distance of the route A-D-C. |
| 13 | +The distance of the route A-E-B-C-D. |
| 14 | +The distance of the route A-E-D. |
| 15 | +The number of trips starting at C and ending at C with a maximum of 3 stops. In the sample data below, there are two such trips: C-D-C (2 stops). and C-E-B-C (3 stops). |
| 16 | +The number of trips starting at A and ending at C with exactly 4 stops. In the sample data below, there are three such trips: A to C (via B,C,D); A to C (via D,C,D); and A to C (via D,E,B). |
| 17 | +The length of the shortest route (in terms of distance to travel) from A to C. |
| 18 | +The length of the shortest route (in terms of distance to travel) from B to B. |
| 19 | +The number of different routes from C to C with a distance of less than 30. In the sample data, the trips are: CDC, CEBC, CEBCDC, CDCEBC, CDEBC, CEBCEBC, CEBCEBCEBC. |
| 20 | + |
| 21 | +- *Test Input*: |
| 22 | +For the test input, the towns are named using the first few letters of the alphabet from A to D. A route between two towns (A to B) with a distance of 5 is represented as AB5. |
| 23 | +Graph: AB5, BC4, CD8, DC8, DE6, AD5, CE2, EB3, AE7 |
| 24 | +Expected Output: |
| 25 | +Output #1: 9 |
| 26 | +Output #2: 5 |
| 27 | +Output #3: 13 |
| 28 | +Output #4: 22 |
| 29 | +Output #5: NO SUCH ROUTE |
| 30 | +Output #6: 2 |
| 31 | +Output #7: 3 |
| 32 | +Output #8: 9 |
| 33 | +Output #9: 9 |
| 34 | +Output #10: 7 |
| 35 | + |
| 36 | +## Prerequisites |
| 37 | + - JDK 8 |
| 38 | + - Maven 3.0.4 or newer |
| 39 | + |
| 40 | + |
| 41 | +## Run the solution |
| 42 | + |
| 43 | + To run the solution you should execute maven command as follow |
| 44 | + |
| 45 | + > mvn clean install |
| 46 | + |
| 47 | + Enjoy it!!!!!!!!!!! |
0 commit comments