Add tags and subsection links in graph notes

Author: yasarcereen

docs/graph/breadth-first-search.md

@@ -2,6 +2,8 @@
 title: Breadth First Search
 tags:
     - Graph
+    - Breadth First Search
+    - BFS
 ---
 
 Breadth First Search (BFS) is an algorithm for traversing or searching tree. (For example, you can find the shortest path from one node to another in an unweighted graph.)

docs/graph/depth-first-search.md

@@ -2,6 +2,8 @@
 title: Depth First Search
 tags:
     - Graph
+    - Depth First Search
+    - DFS
 ---
 
 Depth First Search (DFS) is an algorithm for traversing or searching tree. (For example, you can check if graph is connected or not via DFS) [2]

docs/graph/index.md

@@ -25,6 +25,11 @@ Graph are used to show a relation between objects. So, some graphs may have dire
 <figcaption>Figure 1: a simple unweigted graph</figcaption>
 </figure>
 
+### [Depth First Search](depth-first-search.md)
+### [Breadth First Search](breadth-first-search.md)
+### [Shortest Path](shortest-path.md)
+### [Topological Sort](topological-sort.md)
+
 ## References
 
 1. [https://www.hackerearth.com/practice/algorithms/graphs/breadth-first-search/tutorial/](https://www.hackerearth.com/practice/algorithms/graphs/breadth-first-search/tutorial/)

docs/graph/shortest-path.md

@@ -2,6 +2,8 @@
 title: Shortest Path Problem
 tags:
     - Graph
+    - Shortest Path Problem
+    - Dijkstra
 ---
 
 ## Definition

docs/graph/topological-sort.md

@@ -2,6 +2,7 @@
 title: Topological Sort
 tags:
     - Graph
+    - Topological Sort
 ---
 
 ## Definition

mkdocs.yml

@@ -5,6 +5,7 @@ nav:
   - Introduction: introduction/index.md
   - Data Structures: data-structures/index.md
   - Algorithms: algorithms/index.md
+  - Graph: graph/index.md
   - Dynamic Programming: dynamic-programming/index.md
 theme:
   name: material