Graph Tree Assignment

A C++ analytical project demonstrating robust Graph implementations via Adjacency Lists and Matrices.

Table of Contents

1. About The Project
   • Built With
2. Getting Started
   • Prerequisites
   • Installation
3. Usage
4. License

About The Project

This project contains foundational C++ algorithms crafted to model explicit directional logic:

• GrafoListaAdyecente.cpp: Evaluates optimal pathing and node mapping utilizing sparse Adjacency Lists.
• GrafoMatriz.cpp: Establishes rapid dense state lookup utilizing contiguous Adjacency Matrix structures.

Built With

• 

(back to top)

Getting Started

To get a local copy up and running, format and compile the source code natively via GCC/G++.

Prerequisites

• GCC / G++ (MinGW on Windows)
• C++11 or higher

Installation

1. Clone the repo

   git clone https://github.com/jerichd4c/graph-tree-assignment.git

2. Navigate to the branch

   cd graph-tree-assignment

3. Target compilation output into the bin/ directory

   # Compile Adjacency List Graph
   g++ src/GrafoListaAdyecente.cpp -o bin/GrafoListaAdyecente.exe
   
   # Compile Matrix Graph
   g++ src/GrafoMatriz.cpp -o bin/GrafoMatriz.exe

(back to top)

Usage

Execute the preferred binary to run the interactive console environment:

# Run List Architecture
./bin/GrafoListaAdyecente.exe

# Run Matrix Architecture
./bin/GrafoMatriz.exe

(back to top)

License

Distributed under the MIT License.

(back to top)