This program, developed by Pablo Seijo García at the University of Santiago de Compostela (USC), demonstrates the use of the Abstract Data Type (ADT) for graphs in C. The Graph ADT is designed to provide an efficient and intuitive approach for managing and manipulating graph structures, crucial in various real-world scenarios such as network design, route optimization, and more.
- Node Management 📊: Facilitates the addition, removal, and querying of nodes.
- Edge Management 🌉: Allows establishing relationships between nodes with options for weighted.
- Pathfinding 🚀: Implements algorithms like Floyd-Warshall for finding the shortest, fastest, or most economical paths.
- Minimum Spanning Tree 🌳: Includes Prim's algorithm to find the minimum infrastructure of connections to keep cities connected.
- Interactive Console 🖥️: User-friendly console interface for real-time graph manipulation and analysis.
- Ensure you have
GCCor a compatible C compiler installed. - Basic understanding of graph theory and C programming.
- Clone the repository:
git clone https://github.com/pabloseijo/TADGraph.git
- Navigate to the cloned directory:
cd TADGraph
- Compile the program:
gcc -o graph main.c TADs/funciones.c TADs/grafo.c
- Run the compiled program:
./graph grafo.txt
- Follow the interactive prompts to manipulate the graph.
Contributions, issues, and feature requests are welcome! Feel free to check issues page.
Pablo Seijo García - @pabloseijo
Project Link: https://github.com/pabloseijo/TADGraph