barannmeisterr / Two-Step-Graph-Traversal-Directed-Graph Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

takes a starting takes a point in a directed graph and shows the nodes that are reachable within two steps

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
CMPE224_HW2_Q1		CMPE224_HW2_Q1
.gitattributes		.gitattributes
.gitignore		.gitignore
LICENSE		LICENSE
README.md		README.md

Repository files navigation

Two Step Graph Traversal Directed Graph

Takes a starting point in a directed graph and shows the nodes that are reachable within two steps, you can follow these steps:

Author

Arda Baran

Technologies And Data Structures Used

Java
Directed Graph
Array
Two Dimensional Array For Adjacency Matrix
Queue Array Implementation
BFS Algorithm
Object Oriented Programming
Singly Linked List

File Structure

src/: Contains the Java source code

About

takes a starting takes a point in a directed graph and shows the nodes that are reachable within two steps

java queue oop directed-graph bfs forward-checking singly-linked-list graphtraversal

Report repository

Releases

No releases published

Packages

Languages

Java 100.0%