Update README.md

Author: ashish-ratn

README.md

@@ -1,25 +1,10 @@
 # Awesome-Algorithms-Data-tructures
 <B>Breadth First Search :</B>
 
-Breadth-first search
-Order in which the nodes get expanded
-Order in which the nodes are expanded
-Class	Search algorithm
-Data structure	Graph
-Worst-case performance	{\displaystyle O(|V|+|E|)=O(b^{d})} O(|V|+|E|)=O(b^{d})
-Worst-case space complexity	{\displaystyle O(|V|)=O(b^{d})} O(|V|)=O(b^{d})
-Graph and tree
-search algorithms
-α–β A* B* Backtracking Beam Bellman–Ford Best-first Bidirectional Borůvka Branch & bound BFS British Museum D* DFS Dijkstra Edmonds Floyd–Warshall Fringe search Hill climbing IDA* Iterative deepening Johnson Jump point Kruskal Lexicographic BFS LPA* Prim SMA*
-Listings
-Graph algorithms Search algorithms List of graph algorithms
-Related topics
-Dynamic programming Graph traversal Tree traversal Search games
-vte
-
-Animated example of a breadth-first search
 Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a 'search key'[1]), and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.
 
-It uses the opposite strategy as depth-first search, which instead explores the highest-depth nodes first before being forced to backtrack and expand shallower nodes.
+<B>Depth-first search (DFS)</B> is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking.
+
 
 Reference : https://en.wikipedia.org/wiki/Breadth-first_search
+             https://en.wikipedia.org/wiki/Depth-first_search