https://github.com/sancakerkan/directedgraphprojects
This repository contains my solutions for Programming Homework about Directed Graphs for CMPE 224/343 - Spring 2024.
https://github.com/sancakerkan/directedgraphprojects
datastructures-algorithms directedgraph graphs-algorithms
Last synced: 4 months ago
JSON representation
This repository contains my solutions for Programming Homework about Directed Graphs for CMPE 224/343 - Spring 2024.
- Host: GitHub
- URL: https://github.com/sancakerkan/directedgraphprojects
- Owner: sancakerkan
- License: mit
- Created: 2024-04-22T18:54:04.000Z (about 1 year ago)
- Default Branch: main
- Last Pushed: 2024-06-30T21:30:33.000Z (12 months ago)
- Last Synced: 2025-01-10T02:20:18.410Z (6 months ago)
- Topics: datastructures-algorithms, directedgraph, graphs-algorithms
- Language: Java
- Homepage:
- Size: 130 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Applications on Directed Graphs
This repository contains my solutions for Programming Homework for CMPE 224/343 - Spring 2024.
## Table of Contents
- [Overview](#overview)
- [Problem Statements](#problem-statements)
- [File Structure](#file-structure)
- [How to Use](#how-to-use)
- [Testing](#testing)
- [Contributing](#contributing)
- [License](#license)
## Overview
In this programming homework, I implemented solutions for two distinct problems using graph data structures. Problem 1 involves creating a directed graph and finding two-step paths from a given starting point. Problem 2 requires reading graph data from a text file, identifying non-connected neurons, and printing relevant graph information.
## Problem Statements
- **[Problem 1: Finding Two-Step Paths](https://github.com/sancakerkan/DirectedGraphProjects/tree/main/Q1.%20Finding%20Two-Step%20Paths)**
- Implemented a directed graph data structure and algorithms to find two-step paths from a given starting vertex.
- **[Problem 2: Identifying Non-Connected Neurons](https://github.com/sancakerkan/DirectedGraphProjects/tree/main/Q2.%20Identifying%20Non-Connected%20Neurons)**
- Developed a program to read graph data from a text file, identify non-connected neurons, and print graph information.
## File Structure
The repository is structured as follows:
- **DirectedGraphProjects/**: Root directory for the homework assignment.
- **Q1. Finding Two-Step Paths/**: Contains the Java source files for Problem 1.
- **Q2. Identifying Non-Connected Neurons/**: Contains the Java source files for Problem 2.
## How to Use
1. Clone the repository to your local machine.
2. Navigate to the appropriate directory for the problem you want to work on (`Q1. Finding Two-Step Paths` for Problem 1, `Q2. Identifying Non-Connected Neurons` for Problem 2).
3. Compile the Java source files.
4. **Ensure that the input text files (`HW2_Q1_text.txt` for Problem 1, `HW2_Q2_text.txt` for Problem 2) are in the appropriate directory before running the code.**
5. Run the main program to execute the solution.
## Testing
Specific test cases were used to validate the functionality of the programs. Details of the testing process and outcomes can be found in the [REPORT](https://github.com/sancakerkan/DirectedGraphProjects/blob/report/Report.pdf).
## Contributing
Contributions are welcome! If you find any issues or have suggestions for improvement, feel free to open an issue or submit a pull request.
## License
This project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.