All Versions
18
Latest Version
Avg Release Cycle
104 days
Latest Release
2033 days ago
Changelog History
Page 1
Changelog History
Page 1
-
v3.0.0 Changes
April 12, 2019- ๐จ This is an API breaking refactor
- This version requires Swift 5.0 (Xcode 10.2)
Graph
no longer conforms toclass
so structs can beGraph
s (@davecom)Graph
andEdge
are nowCodable
meaning all implementations must be as well including all vertex types, leading to the removal ofCodableUnweightedGraph
andCodableWeightedGraph
, which are now unnecessary (@davecom)- ๐ New CONTRIBUTORS.md file containing some history (@davecom)
- ๐ New search traversal methods (@ferranpujolcamins)
- ๐ Improvements to
UniqueElementsGraph
(@ferranpujolcamins) - โ Useful constructors for testing (@ferranpujolcamins)
- ๐ Improvements to
UniqueElementsGraph
tests (@ferranpujolcamins) - ๐จ Refactor many aspects of
UnweightedGraph
andWeightedGraph
into conditional conformance extensions toGraph
and new protocols (@ferranpujolcamins) - โ Add new performance tests (@ferranpujolcamins)
- โ Add direction back to
Edge
(@ferranpujolcamins)
-
v2.0.0 Changes
September 19, 2018- ๐จ This is an API breaking refactor
- This version requires Swift 4.2 (Xcode 10.1)
Graph
is now a protocol instead of a class- ๐
edgesToVertices()
is now a method onGraph
instead of a free function - The
Edge
protocol has been significantly simplifieid UnweightedEdge
andWeightedEdge
are nowCodable
- ๐ Subclasses of
Graph
CodableUnweightedGraph
andCodableWeightedGraph
provide serialization support to JSON and anything elseCodable
supports (thanks for the help, @yoiang) - Experimental subclass of
UnweightedGraph
,UniqueElementsGraph
provides a union operation and guarantees no duplicate vertices & edges in a graph (thanks @ferranpujolcamins) - Cycle detector method that returns edges (thanks @ZevEisenberg)
-
v1.5.1 Changes
October 12, 2017- ๐ง Project reorganized to support testing on Linux, just run
swift test
- ๐
Package.swift
updated for Swift 4 package management style - โ Added
detectCyles()
which uses the Liu/Wang algorithm for detecting cycles up to any length in a graph - โ Added a couple unit tests for testing
detectCycles()
- ๐ง Project reorganized to support testing on Linux, just run
-
v1.5.0 Changes
September 13, 2017- โฌ๏ธ Upgraded to Swift 4
- Project now built with Xcode 9
- SwiftPriorityQueue replaced with newer version
-
v1.4.1 Changes
July 09, 2017- ๐ Fixed a bug in
removeAllEdges()
and added a test for it
- ๐ Fixed a bug in
-
v1.4.0 Changes
May 31, 2017- โ Added a Minimum Spanning Tree Fuction
mst()
based on Jarnik's Algorithm (aka Prim's Algorithm) - Simplified Dijkstra's Algorithm implementation
- โ Added a Minimum Spanning Tree Fuction
-
v1.3.1 Changes
May 10, 2017- ๐ Fixes a bug that could result in the wrong edges being removed when a vertex is removed (thanks @brandonroth)
- โ Silences some warnings about printing optionals introduced in Swift 3.1
-
v1.3.0 Changes
February 21, 2017- ๐ Carthage Support (via re-organizing into framework) - thanks @klundberg
- ๐ New search methods added - versions of
bfs()
anddfs()
that support custom goal functions findAll()
added as a version ofbfs()
with multiple potential outcomes- ๐ watchOS support added to Podfile
-
v1.2.0 Changes
October 06, 2016- ๐ Moved search functions from free functions to extensions of
Graph
andWeightedGraph
- Switched license to Apache 2.0 from MIT
- โ Added
topologicalSort()
andisDAG
- ๐ Changed access level for most types to
open
- โ Added unit tests for topologicalSort and isDAG
- ๐ Moved search functions from free functions to extensions of
-
v1.1.1 Changes
September 19, 2016- ๐ Fixes for the final version of Swift 3
- โก๏ธ Updated version of SwiftPriorityQueue
- โ Added .swift-version file