Fix relative path issues

Author: cormacpayne

binary-search/binary-search.md

@@ -77,7 +77,7 @@ Now that we have the three possible scenarios handled, we just need to define wh
 
 We want to keep searching while we have some range of numbers to check, so if `lo` ever becomes greater than `hi`, then our target value is not in the array due to the fact that we have run out of numbers to check.
 
-![binary-search](..\resources\binary-search.png)
+![binary-search](../resources/binary-search.png)
 
 ## Problems
 

graph-theory/introduction/introduction.md

@@ -53,11 +53,11 @@ There are many ways to use an adjacency matrix to represent a matrix, but we wil
 
 #### Connection matrix
 
-![graph-theory-introduction-1](..\..\resources\graph-theory-introduction-1.png)
+![graph-theory-introduction-1](../../resources/graph-theory-introduction-1.png)
 
 #### Cost matrix
 
-![graph-theory-introduction-2](..\..\resources\graph-theory-introduction-2.png)
+![graph-theory-introduction-2](../../resources/graph-theory-introduction-2.png)
 
 #### Pros and Cons
 
@@ -75,7 +75,7 @@ Rather than making space for all _N_ x _N_ possible edge connections, an _adjace
 
 We are able to do this by creating an array that contains `ArrayLists` holding the values of the vertices that a vertex is connected to.
 
-![graph-theory-introduction-3](..\..\resources\graph-theory-introduction-3.png)
+![graph-theory-introduction-3](../../resources/graph-theory-introduction-3.png)
 
 #### Pros and  Cons
 

graph-theory/shortest-path/dijkstras-algorithm/dijkstras-algorithm.md

@@ -53,15 +53,15 @@ There are several ways to implement this algorithm
 
 #### Using an array
 
-![graph-theory-dijkstras-algorithm-1](..\..\..\resources\graph-theory-dijkstras-algorithm-1.png)
+![graph-theory-dijkstras-algorithm-1](../../../resources/graph-theory-dijkstras-algorithm-1.png)
 
 #### Using a priority queue
 
 Remember that as you add items to a priority queue, they are automatically sorted within the queue, so that you are given the "smallest" item when you remove it from the queue.
 
 First, we need to define our `Vertex` class and what attributes it will contain.
 
-![graph-theory-dijkstras-algorithm-2](..\..\..\resources\graph-theory-dijkstras-algorithm-2.png)
+![graph-theory-dijkstras-algorithm-2](../../../resources/graph-theory-dijkstras-algorithm-2.png)
 
 Remember that when we used `dist[]` to keep track of distances, we had to look through _all_ tentative distances to see which vertex to visit; with this method, we just remove the next vertex from the priority queue and it will be guaranteed to have the smallest distance.
 
@@ -95,7 +95,7 @@ Just like BFS, we are repeating the steps of the algorithm until the queue is em
 
 Now that we have our stopping condition, we can implement the rest of the algorithm
 
-![graph-theory-dijkstras-algorithm-3](..\..\..\resources\graph-theory-dijkstras-algorithm-3.png)
+![graph-theory-dijkstras-algorithm-3](../../../resources/graph-theory-dijkstras-algorithm-3.png)
 
 ## Problems