We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 868fc7c commit a822cbeCopy full SHA for a822cbe
computer_science/data_structures/graph/README.md
@@ -0,0 +1,13 @@
1
+# Graph
2
+
3
+## Breadth First Search (BFS)
4
5
+- Use the queue data structure to hold each vertex that needs to be visited in the future.
6
+- It should keep a visited data structure to store all the visited vertices.
7
+- Runtime: O(V+E) / V = vertices | E = edges.
8
9
+## Depth First Search (DFS)
10
11
+- Use the stack data structure or do recursive.
12
13
0 commit comments