Replace animation with my own

The original was apparently taken from Wikipedia and I don't know if we had the rights to it. Besides, it was ugly.

Author: hollance

Breadth-First Search/BreadthFirstSearch.playground/Pages/Minimum spanning tree example.xcplaygroundpage/Contents.swift

@@ -10,8 +10,7 @@ func breadthFirstSearchMinimumSpanningTree(graph: Graph, source: Node) -> Graph
   queue.enqueue(sourceInMinimumSpanningTree)
   sourceInMinimumSpanningTree.visited = true
 
-  while !queue.isEmpty {
-    let current = queue.dequeue()!
+  while let current = queue.dequeue() {
     for edge in current.neighbors {
       let neighborNode = edge.neighbor
       if !neighborNode.visited {
@@ -26,10 +25,12 @@ func breadthFirstSearchMinimumSpanningTree(graph: Graph, source: Node) -> Graph
   return minimumSpanningTree
 }
 
+
 /*:
 ![Animated example of a breadth-first search](Minimum_Spanning_Tree.png)
 */
 
+
 let graph = Graph()
 
 let nodeA = graph.addNode("a")

Breadth-First Search/BreadthFirstSearch.playground/Pages/Shortest path example.xcplaygroundpage/Contents.swift

@@ -10,8 +10,7 @@ func breadthFirstSearchShortestPath(graph: Graph, source: Node) -> Graph {
   queue.enqueue(sourceInShortestPathsGraph)
   sourceInShortestPathsGraph.distance = 0
 
-  while !queue.isEmpty {
-    let current = queue.dequeue()!
+  while let current = queue.dequeue() {
     for edge in current.neighbors {
       let neighborNode = edge.neighbor
       if !neighborNode.hasDistance {
@@ -23,9 +22,8 @@ func breadthFirstSearchShortestPath(graph: Graph, source: Node) -> Graph {
 
   return shortestPathGraph
 }
-/*:
-![Animated example of a breadth-first search](Animated_BFS.gif)
-*/
+
+
 
 let graph = Graph()
 

Breadth-First Search/BreadthFirstSearch.playground/Pages/Simple example.xcplaygroundpage/Contents.swift

@@ -7,9 +7,8 @@ func breadthFirstSearch(graph: Graph, source: Node) -> [String] {
   var nodesExplored = [source.label]
   source.visited = true
 
-  while !queue.isEmpty {
-    let current = queue.dequeue()!
-    for edge in current.neighbors {
+  while let node = queue.dequeue() {
+    for edge in node.neighbors {
       let neighborNode = edge.neighbor
       if !neighborNode.visited {
         queue.enqueue(neighborNode)
@@ -22,9 +21,7 @@ func breadthFirstSearch(graph: Graph, source: Node) -> [String] {
   return nodesExplored
 }
 
-/*:
-![Animated example of a breadth-first search](Animated_BFS.gif)
-*/
+
 
 let graph = Graph()
 
@@ -44,10 +41,11 @@ graph.addEdge(nodeB, neighbor: nodeE)
 graph.addEdge(nodeC, neighbor: nodeF)
 graph.addEdge(nodeC, neighbor: nodeG)
 graph.addEdge(nodeE, neighbor: nodeH)
+graph.addEdge(nodeE, neighbor: nodeF)
+graph.addEdge(nodeF, neighbor: nodeG)
 
 
 let nodesExplored = breadthFirstSearch(graph, source: nodeA)
 print(nodesExplored)
 
 //: [Next: Shortest Path Example](@next)
-

Breadth-First Search/BreadthFirstSearch.playground/Resources/Animated_BFS.gif

@@ -5,8 +5,7 @@ func breadthFirstSearch(graph: Graph, source: Node) -> [String] {
   var nodesExplored = [source.label]
   source.visited = true
 
-  while !queue.isEmpty {
-    let current = queue.dequeue()!
+  while let current = queue.dequeue() {
     for edge in current.neighbors {
       let neighborNode = edge.neighbor
       if !neighborNode.visited {

Breadth-First Search/BreadthFirstSearch.swift

@@ -6,8 +6,7 @@ func breadthFirstSearchMinimumSpanningTree(graph: Graph, source: Node) -> Graph
   queue.enqueue(sourceInMinimumSpanningTree)
   sourceInMinimumSpanningTree.visited = true
 
-  while !queue.isEmpty {
-    let current = queue.dequeue()!
+  while let current = queue.dequeue() {
     for edge in current.neighbors {
       let neighborNode = edge.neighbor
       if !neighborNode.visited {

Breadth-First Search/BreadthFirstSearchMinimumSpanningTree.swift

@@ -6,8 +6,7 @@ func breadthFirstSearchShortestPath(graph: Graph, source: Node) -> Graph {
   queue.enqueue(sourceInShortestPathsGraph)
   sourceInShortestPathsGraph.distance = 0
 
-  while !queue.isEmpty {
-    let current = queue.dequeue()!
+  while let current = queue.dequeue() {
     for edge in current.neighbors {
       let neighborNode = edge.neighbor
       if !neighborNode.hasDistance {