From 6bfd0906d74687fbf30c5c632a7b8cf4437eb474 Mon Sep 17 00:00:00 2001 From: Abhijith C Date: Mon, 5 Oct 2020 21:17:13 +0530 Subject: [PATCH] Update README.md --- README.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index 04604b0..32a2b47 100644 --- a/README.md +++ b/README.md @@ -2,7 +2,8 @@ Simple, small sized implementation of select algorithms in C++ ## 1. Breadth First Search (BFS) -_Used for traversing a graph_ +_This is used for traversing a graph._ + ### Algorithm G is the adjacency matrix representing the graph. 'visited' array marks nodes as visited.