GraphOfVirginiaCitiesByRoad is a demo Java-based graph application that creates a graph of major Virginia cities and computes the shortest path between any two cities by road. It utilizes the JGraphT library to manage and process graph data efficiently.
- Initializes a simple weighted, unidirectional graph of select cities in Virginia.
- Finds the shortest path between any two cities based on road distances.
- Uses JGraphT for graph operations and pathfinding algorithms.
Download JGraphT Library, manually (not using Maven), unarchive it, find the two jars listed below (core and Jheaps) in the lib folder, and add them to your Build Path:
- Java JDK 17 or later.
- JGraphT core library (version 1.5.2).
- JHeaps library (version 0.14).
- Open your Java IDE (e.g., Eclipse, IntelliJ IDEA).
- Import the files however you wish (git, etc)
- Ensure that the following files are included in your project:
edu/vwcc/citygraphAnyTextReader.javaGraphHelper.javaMain.javaDrivingDistances_CitiesVA.txt
- Add the JGraphT and JHeaps libraries to your project's build path.
- Run
Main.javain your IDE to start the application. - Follow the on-screen instructions to input two Virginia cities.
- The program will display the shortest path by road between the selected cities.
Contributions to the GraphOfVirginiaCitiesByRoad project are welcome! Please follow these steps:
- Fork the repository.
- Create a new branch for your feature (
git checkout -b feature/YourFeature). - Commit your changes (
git commit -am 'Add some feature'). - Push to the branch (
git push origin feature/YourFeature). - Create a new Pull Request.
This project is licensed under the MIT License - see the LICENSE file for details.
- Thanks to the JGraphT team for their excellent graph library!
- This project was inspired by VDOT :)
For more information or support, please contact the repository owner: Ben Lamb