From fa1aad1414f0e178719840993e33b60c2a84bf90 Mon Sep 17 00:00:00 2001 From: Noob-Master-22 <124292057+Noob-Master-22@users.noreply.github.com> Date: Sat, 25 Feb 2023 19:27:50 +0530 Subject: [PATCH] Update README.md --- README.md | 12 ++++++++---- 1 file changed, 8 insertions(+), 4 deletions(-) diff --git a/README.md b/README.md index 9e9ebf2..0d17657 100644 --- a/README.md +++ b/README.md @@ -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) \ No newline at end of file +- [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)