Merge pull request #89 from inzva/muratbiberoglu-patch

fix image visibility at graph pages

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.)
 
-<figure>
+<figure markdown="span">
 ![Breadth First Search Traversal](img/bfs.jpg)
 <figcaption>An example breadth first search traversal</figcaption>
 </figure>

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]
 
-<figure>
+<figure markdown="span">
 ![Shortest Path](img/shortest.png)
 <figcaption>Example shortest path in graph. Source is A and target is F. Image taken from [5].</figcaption>
 </figure>

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:
 
-<figure>
+<figure markdown="span">
 ![Topological Order](img/toporder.png)
 <figcaption>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].</figcaption>
 </figure>