Skip to content

Update README.md #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Satvik-Reddy wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Update README.md #1

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 8 additions & 4 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -31,12 +31,16 @@ Graph traversals are a way to travel and access/print the nodes in the graph. Th

When you pick up a node and travel all the way down, and then check for any other node.

- [DFS in Graph using Adjacency Matrix](GraphDFSAdjMat.java)
- [DFS in Graph using Adjacency List](GraphDFSAdjList.java)
- [DFS in Graph using Adjacency Matrix](GraphDFSAdjMat.md)
- [DFS in Graph using Adjacency List](GraphDFSAdjList.md)

**Breadth First Search (BFS)**

When you pick up a node and traverse it's neighbours at the present depth before moving in deep.

- [BFS in Graph using Adjacency Matrix](GraphBFSAdjMat.java)
- [DFS in Graph using Adjacency List](GraphBFSAdjList.java)
- [BFS in Graph using Adjacency Matrix](GraphBFSAdjMat.md)
- [BFS in Graph using Adjacency List](GraphBFSAdjList.md)

**Additonal Resources**
[Implementing DFS In Java](https://favtutor.com/blogs/depth-first-search-java)
[Implementing BFS In Java](https://favtutor.com/blogs/breadth-first-search-java)