fix: readme section element bold font

README.md

@@ -92,25 +92,24 @@ Algorithms implemented in the Graaf library include the following. For more info
 take a look at the [docs](https://bobluppes.github.io/graaf/docs/algorithms/intro).
 
 1. [**Traversal Algorithms**](https://bobluppes.github.io/graaf/docs/category/traversal-algorithms):
-    - Breadth-First Search (BFS)
-    - Depth-First Search (DFS)
+   - Breadth-First Search (BFS)
+   - Depth-First Search (DFS)
 2. [**Shortest Path Algorithms**](https://bobluppes.github.io/graaf/docs/category/shortest-path-algorithms):
-    - A\* search
-    - BFS-Based Shortest Path
-    - Dijkstra
-    - Bellman-Ford
+   - A\* search
+   - BFS-Based Shortest Path
+   - Dijkstra
+   - Bellman-Ford
 3. [**Cycle Detection Algorithms**](https://bobluppes.github.io/graaf/docs/category/cycle-detection-algorithms):
-    - DFS-Based Cycle Detection
+   - DFS-Based Cycle Detection
 4. [**Minimum Spanning Tree (MST) Algorithms**](https://bobluppes.github.io/graaf/docs/category/minimum-spanning-tree)
-    - Kruskal's Algorithm
-    - Prim's Algorithm
-5. [**Strongly Connected Components Algorithms
-   **](https://bobluppes.github.io/graaf/docs/category/strongly-connected-components):
-    - Tarjan's Strongly Connected Components
+   - Kruskal's Algorithm
+   - Prim's Algorithm
+5. [**Strongly Connected Components Algorithms**](https://bobluppes.github.io/graaf/docs/category/strongly-connected-components):
+   - Tarjan's Strongly Connected Components
 6. [**Topological Sorting Algorithms**](https://bobluppes.github.io/graaf/docs/category/topological-sorting):
-    - Topological sorting DFS-based
+   - Topological sorting DFS-based
 7. [**Graph Coloring Algorithms**](https://bobluppes.github.io/graaf/docs/category/coloring):
-    - Greedy Graph Coloring
+   - Greedy Graph Coloring
 
 # Contributing