From ef6e27e520aae5884fbe0023091525559be26e7e Mon Sep 17 00:00:00 2001 From: muratbiberoglu Date: Thu, 17 Oct 2024 08:46:03 +0300 Subject: [PATCH] fix image visibility at graph pages --- docs/graph/breadth-first-search.md | 2 +- docs/graph/shortest-path.md | 2 +- docs/graph/topological-sort.md | 2 +- 3 files changed, 3 insertions(+), 3 deletions(-) diff --git a/docs/graph/breadth-first-search.md b/docs/graph/breadth-first-search.md index 360fb8b..5409f24 100644 --- a/docs/graph/breadth-first-search.md +++ b/docs/graph/breadth-first-search.md @@ -8,7 +8,7 @@ tags: 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.) -
+
![Breadth First Search Traversal](img/bfs.jpg)
An example breadth first search traversal
diff --git a/docs/graph/shortest-path.md b/docs/graph/shortest-path.md index 13d9ffe..a7b7911 100644 --- a/docs/graph/shortest-path.md +++ b/docs/graph/shortest-path.md @@ -10,7 +10,7 @@ tags: Let \(G(V,E)\) be a graph, \(v_i\) and \(v_j\) be two nodes of \(G\). We say a path between \(v_i\) and \(v_j\) is the shortest path if sum of the edge weights (cost) in the path is minimum. In other words, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. [5] -
+
![Shortest Path](img/shortest.png)
Example shortest path in graph. Source is A and target is F. Image taken from [5].
diff --git a/docs/graph/topological-sort.md b/docs/graph/topological-sort.md index 0fb97a1..6a1e753 100644 --- a/docs/graph/topological-sort.md +++ b/docs/graph/topological-sort.md @@ -14,7 +14,7 @@ There are many important usages of topological sorting in computer science; appl There are known algorithms (e.g Kahn’s algorithm) to find topological order in linear time. Below, you can find one of the implementations: -
+
![Topological Order](img/toporder.png)
For example, a topological sorting of this graph is “5 4 2 3 1 0”. There can be more than one topological sorting for a graph. For example, another topological sorting of the following graph is “4 5 2 3 1 0”. The first vertex in topological sorting is always a vertex with in-degree as 0 (a vertex with no incoming edges)[6].