https://github.com/sancakerkan/graphshortestpath
This repository implements algorithms for finding the shortest path in a graph
https://github.com/sancakerkan/graphshortestpath
graph-algorithms graphs java shortest-path-algorithm shortest-paths
Last synced: 2 months ago
JSON representation
This repository implements algorithms for finding the shortest path in a graph
- Host: GitHub
- URL: https://github.com/sancakerkan/graphshortestpath
- Owner: sancakerkan
- License: mit
- Created: 2024-04-14T12:43:36.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-06-30T17:26:36.000Z (over 1 year ago)
- Last Synced: 2025-02-27T03:49:55.125Z (8 months ago)
- Topics: graph-algorithms, graphs, java, shortest-path-algorithm, shortest-paths
- Language: Java
- Homepage:
- Size: 6.84 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Graph Shortest Path
This repository implements algorithms for finding the shortest path in a graph. It provides solutions to two main problems:
1. Finding the lexicographically smallest path with minimum travel time between islands in a coastal city.
2. Organizing a city tour that starts from a specific city, includes another city, and returns to the starting point.
## Features
- Implementation of a graph data structure.
- Algorithms to find the shortest path using BFS and DFS techniques.
- Solutions for both coastal city routes and city tour problems.
## Usage
The repository contains Java implementations for:
- Graph structure
- Shortest path algorithms
- Input parsing and output formatting
## Contribution
Contributions are welcome! Feel free to fork the repository, create a new branch, and submit pull requests for improvements or bug fixes.
## License
This project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.