commit bf1b8c1f2358df22990c4d52a84adbec1b17e69b
parent 692e449a77f42f94d1212bdcc2f1b631a632e797
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Thu, 2 Jan 2025 22:47:41 +0100
commit with codex
Diffstat:
11 files changed, 75 insertions(+), 2 deletions(-)
diff --git a/bellman_ford_algorithm b/bellman_ford_algorithm
@@ -0,0 +1,8 @@
+# Bellman Ford algorithm
+
+[shortest_path_algorithm] for [single_source_shortest_path] on [graphs] with [negative_weight] [edges]
+- Must in particular handle [negative_cycles]
+
+Up: [shortest_path_algorithm]
+
+Aliases: Bellman-Ford, Bellman Ford
diff --git a/breadth_first_search b/breadth_first_search
@@ -0,0 +1,7 @@
+# Breadth first search
+
+[Graph_traversal] using a [stack]
+
+See also: [depth_first_search]
+
+Up: [graph_traversal]
diff --git a/depth_first_search b/depth_first_search
@@ -0,0 +1,9 @@
+# Depth first search
+
+A [graph_traversal] using a [stack]
+
+Up: [graph_traversal]
+
+Aliases: DFS, depth first searches
+
+See also: [breadth_first_search]
diff --git a/dijkstras_algorithm b/dijkstras_algorithm
@@ -0,0 +1,7 @@
+# Dijkstra's algorithm
+
+[graph_traversal] using [priority_queue] as [data_structure]
+
+Up: [shortest_path_algorithm]
+
+Aliases: Dijkstra algorithm
diff --git a/floyd_warshall_algorithm b/floyd_warshall_algorithm
@@ -0,0 +1,7 @@
+# Floyd Warshall algorithm
+
+[Shortest_path_algorithm] for [all_pairs_shortest_path]
+
+Up: [shortest_path_algorithm]
+
+Aliases: Floyd-Warshall, Floyd Warshall
diff --git a/graph_traversal b/graph_traversal
@@ -0,0 +1,8 @@
+# Graph traversal
+
+- [breadth_first_search]
+- [depth_first_search]
+
+Up: [graph]
+
+See also: [shortest_path_algorithm]
diff --git a/shortest_path_algorithm b/shortest_path_algorithm
@@ -0,0 +1,8 @@
+# Shortest path algorithm
+
+For [all_pairs_shortest_path]:
+- [Floyd_Warshall_algorithm]
+
+For [single_source_shortest_path]: [single_source_shortest_path_algorithm]
+
+Up: [shortest_path]
diff --git a/single_source_shortest_path b/single_source_shortest_path
@@ -0,0 +1,5 @@
+# Shortest path single source
+
+[single_source_shortest_path_algorithm]
+
+Up: [shortest_path]
diff --git a/stack b/stack
@@ -0,0 +1,7 @@
+# Stack
+
+- [recursion]
+
+Up: [data_structure]
+
+See also: [stackexchange], [stack_overflow], [queue]
diff --git a/strongly_connected_component b/strongly_connected_component
@@ -1,7 +1,6 @@
# Strongly connected component
-- [Kosaraju's_algorithm]: [algorithm] with two [depth_first_search] with [post_order] numbering
-- [Tarjan's_algorithm]
+- [strongly_connected_component_algorithm]
- [dynamic_strongly_connected_component]
- [strong_connectivity_augmentation]
diff --git a/strongly_connected_component_algorithm b/strongly_connected_component_algorithm
@@ -0,0 +1,8 @@
+# Strongly connected component algorithms
+
+- [Kosaraju's_algorithm]: [algorithm] with two [depth_first_search] with [post_order] numbering
+- [Tarjan's_algorithm]
+
+Up: [graph_algorithm], [strongly_connected_component]
+
+See also: [topological_sorting]
