dnrops
/
swift-elementary-cycles
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Release 0.4.0

This commit is contained in:
hectr 2019-08-11 19:39:23 +02:00
parent e9ddc48972
commit 824a7d8c9b
2 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
ElementaryCycles.podspec
View File

@ -1,6 +1,6 @@
Pod::Spec.new do |s| Pod::Spec.new do |s|
s.name = 'ElementaryCycles' s.name = 'ElementaryCycles'
s.version = '0.3.0' s.version = '0.4.0'
s.summary = 'Find all elementary cycles in a directed graph' s.summary = 'Find all elementary cycles in a directed graph'
s.description = <<-DESC s.description = <<-DESC
Swift port of an algorythm by Donald B. Johnson to find all the cycles in a directed graph. Swift port of an algorythm by Donald B. Johnson to find all the cycles in a directed graph.

2
ElementaryCyclesSearch.podspec
View File

@ -1,6 +1,6 @@
Pod::Spec.new do |s| Pod::Spec.new do |s|
s.name = 'ElementaryCyclesSearch' s.name = 'ElementaryCyclesSearch'
s.version = '0.3.0' s.version = '0.4.0'
s.summary = 'Elementary Circuits of a Directed Graph' s.summary = 'Elementary Circuits of a Directed Graph'
s.description = <<-DESC s.description = <<-DESC
The implementation is pretty much generic, all it needs is a adjacency-matrix of your graph and the objects of your nodes. Then you get back the sets of node-objects which build a cycle. The implementation is pretty much generic, all it needs is a adjacency-matrix of your graph and the objects of your nodes. Then you get back the sets of node-objects which build a cycle.