diff --git a/ElementaryCycles.podspec b/ElementaryCycles.podspec
index 7d39e3c..dae49a4 100644
--- a/ElementaryCycles.podspec
+++ b/ElementaryCycles.podspec
@@ -1,6 +1,6 @@
 Pod::Spec.new do |s|
   s.name         = 'ElementaryCycles'
-  s.version          = '0.1.0'
+  s.version          = '0.2.0'
   s.summary          = 'Find all elementary cycles in a directed graph'
   s.description      = <<-DESC
 Swift port of an algorythm by Donald B. Johnson to find all the cycles in a directed graph.
diff --git a/ElementaryCyclesSearch.podspec b/ElementaryCyclesSearch.podspec
index 4e1680b..1fe056a 100644
--- a/ElementaryCyclesSearch.podspec
+++ b/ElementaryCyclesSearch.podspec
@@ -1,6 +1,6 @@
 Pod::Spec.new do |s|
   s.name             = 'ElementaryCyclesSearch'
-  s.version          = '0.1.0'
+  s.version          = '0.2.0'
   s.summary          = 'Elementary Circuits of a Directed Graph'
   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.