[ADD] more drafts of graphs algos

fadli0029 · Jul 13, 2024 · fa1b46d · fa1b46d
1 parent 120826c
commit fa1b46d
Show file tree

Hide file tree

Showing 6 changed files with 7 additions and 3 deletions.
diff --git a/algorithms/graph/astar.cpp b/algorithms/graph/astar.cpp
diff --git a/algorithms/graph/bellman_ford.cpp b/algorithms/graph/bellman_ford.cpp
@@ -0,0 +1,4 @@
+// There's two variant:
+// 1. We want shortest path, so do N-1 iterations.
+// 2. A constraint says at most k edges are allowed to get the shortest distance between two nodes, so do k iterations.
+//    (see letcode graph explore card bellman ford chapter).
diff --git a/algorithms/graph/dfs.cpp b/algorithms/graph/dfs.cpp
@@ -1,5 +1,5 @@
-/* ==============================================================================
-   This is an implementation of the Depth First Search (DFS) algorithm using a
+/* ====================================================================================
+   This file contains implementations of the Depth First Search (DFS) algorithm using a
    stack explicitly and using recursion (recursion is using stack implicitly
    by nature of a function call). The implementation assumes the starting node
    to be `0` by default. It then prints the visited nodes in the order they
@@ -11,7 +11,7 @@
    @param adj_list: the adjacency list representation of the graph
 
    @author: Muhammad Fadli Alim Arsani
-===============================================================================*/
+=====================================================================================*/
 
 #define CATCH_CONFIG_MAIN
 #include <catch2/catch_test_macros.hpp>

diff --git a/algorithms/graph/dijkstra.cpp b/algorithms/graph/dijkstra.cpp
diff --git a/algorithms/graph/kruskal.cpp b/algorithms/graph/kruskal.cpp
diff --git a/algorithms/graph/prim.cpp b/algorithms/graph/prim.cpp