Table of Contents
Final work on data structure where I created a structure to represent graphs using adjacency lists and implement a user interface that allows interaction with the system.
-
Clone the repo
git clone https://github.com/HeitorLouzeiro/trabalho-final-grafo.git
-
Access the project folder in terminal/cmd
cd trabalho-final-grafo
-
Run the application.
java -jar trabalho-final-grafo.jar
- Insert Vertex.
- Insert Edge.
- Remove Vertex.
- Remove Edge.
- View Graph.
- Report Degree of a Vertex.
- Check if the Graph is Connected.
- Convert to Adjacency Matrix.
- Breadth-First Breadth-First Search (BFS).
- Depth-first Search (DFS).
- Shortest Path (Dijkstra).
- Minimum Spanning Tree (Prim).
See the open issues for a full list of proposed features (and known issues).
Contributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated.
If you have a suggestion that would make this better, please fork the repo and create a pull request. You can also simply open an issue with the tag "enhancement". Don't forget to give the project a star! Thanks again!
- Fork the Project
- Create your Feature Branch (
git checkout -b feature/Improvements
) - Commit your Changes (
git commit -m 'Add my new Enhancements'
) - Push to the Branch (
git push origin feature/Improvements
) - Open a Pull Request
We thank the following people who contributed to this project:
Heitor Louzeiro |
Distributed under the MIT License. See LICENSE for more information.
Project Link: https://github.com/HeitorLouzeiro/trabalho-final-grafo