TRAINS

Graph implementation to help the railroad provide its customers with information about the routes. Detailed problem statement is defined here.

Dependencies

• Java 8
• Maven ( Including Exec and Javadoc plugins )
• JUnit

Implementation

This solution implements WeightedDirectedGraph using Adjacency List. (Other popular way is to use Adjacency Matrix)

• Graph Defiines the interface of an abstract Graph data structure.
• WeightedDirectedGraph Weighted Directed Graph implementation of Graph interface
• Traversals Class implementing following methods solving the traversals defined in the problem statement
  • routeDistance - distance between any two nodes in the graph
  • paths - all the possible paths between two nodes either based on max hop count or max distance
  • shortestDistance - shortest distance based on dijkstra algorithm

Input File is available in the resources folder.

Further documentation can be generated using Maven.

Running Locally

mvn clean
mvn -q package exec:java

Testing

mvn test

Generate Java Doc

mvn javadoc:javadoc

Export git

git archive master | gzip > ~/Desktop/trains-thoughtworks.tgz