Release 1.4.1

Author: davecom

CHANGELOG.md

@@ -1,3 +1,6 @@
+### 1.4.1
+- Fixed a bug in `removeAllEdges()` and added a test for it
+
 ### 1.4.0
 - Added a Minimum Spanning Tree Fuction `mst()` based on Jarnik's Algorithm (aka Prim's Algorithm)
 - Simplified Dijkstra's Algorithm implementation

README.md

@@ -17,7 +17,7 @@ Use the CocoaPod `SwiftGraph`.
 Add the following to your `Cartfile`:
 
 ```
-github "davecom/SwiftGraph" ~> 1.4.0
+github "davecom/SwiftGraph" ~> 1.4.1
 ```
 
 ### Swift Package Manager (SPM)

Sources/Graph.swift

@@ -162,12 +162,12 @@ open class Graph<V: Equatable>: CustomStringConvertible, Sequence, Collection {
     /// - parameter to: The ending vertex's index.
     /// - parameter bidirectional: Remove edges coming back (to -> from)
     public func removeAllEdges(from: Int, to: Int, bidirectional: Bool = true) {
-        for i in 0..<edges[from].count where edges[from][i].v == to {
+        for (i, edge) in edges[from].enumerated().reversed() where edge.v == to {
             edges[from].remove(at: i)
         }
 
         if bidirectional {
-            for i in 0..<edges[to].count where edges[to][i].v == from {
+            for (i, edge) in edges[to].enumerated().reversed() where edge.v == from {
                 edges[to].remove(at: i)
             }
         }

SwiftGraph.podspec

@@ -1,6 +1,6 @@
 Pod::Spec.new do |s|
   s.name             = 'SwiftGraph'
-  s.version          = '1.4.0'
+  s.version          = '1.4.1'
   s.license          = { :type => "Apache License, Version 2.0", :file => "LICENSE" }
   s.summary          = 'A Graph Data Structure in Pure Swift'
   s.homepage         = 'https://github.com/davecom/SwiftGraph'

SwiftGraphTests/SwiftGraphTests.swift

@@ -81,6 +81,21 @@ class SwiftGraphTests: XCTestCase {
         XCTAssertEqual(g[2], "Miami", "Expected result at vertex 2")
     }
 
+    func testRemoveAllEdges() {
+        let graph = UnweightedGraph(vertices: ["0", "1", "2", "3", "4", "5", "6"])
+        
+        graph.addEdge(from: "0", to: "1", directed: false)
+        graph.addEdge(from: "1", to: "2", directed: false)
+        graph.addEdge(from: "2", to: "3", directed: false)
+        graph.addEdge(from: "3", to: "2", directed: false)
+        graph.addEdge(from: "3", to: "4", directed: false)
+        graph.addEdge(from: "4", to: "5", directed: false)
+        
+        graph.removeAllEdges(from: 2, to: 3, bidirectional: true)
+        XCTAssertFalse(graph.edgeExists(from: 2, to: 3))
+        XCTAssertFalse(graph.edgeExists(from: 3, to: 2))
+    }
+    
     //func testPerformanceExample() {
         // This is an example of a performance test case.
      //   self.measureBlock() {