From 824a7d8c9beff5bb4ce81ce65877e63c1bb85fac Mon Sep 17 00:00:00 2001
From: hectr <h@mrhector.me>
Date: Sun, 11 Aug 2019 19:39:23 +0200
Subject: [PATCH] Release 0.4.0

---
 ElementaryCycles.podspec       | 2 +-
 ElementaryCyclesSearch.podspec | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/ElementaryCycles.podspec b/ElementaryCycles.podspec
index 452abb7..623cf31 100644
--- a/ElementaryCycles.podspec
+++ b/ElementaryCycles.podspec
@@ -1,6 +1,6 @@
 Pod::Spec.new do |s|
   s.name         = 'ElementaryCycles'
-  s.version          = '0.3.0'
+  s.version          = '0.4.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 15856e6..a04523a 100644
--- a/ElementaryCyclesSearch.podspec
+++ b/ElementaryCyclesSearch.podspec
@@ -1,6 +1,6 @@
 Pod::Spec.new do |s|
   s.name             = 'ElementaryCyclesSearch'
-  s.version          = '0.3.0'
+  s.version          = '0.4.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.