diff --git a/ElementaryCycles.podspec b/ElementaryCycles.podspec new file mode 100644 index 0000000..7d39e3c --- /dev/null +++ b/ElementaryCycles.podspec @@ -0,0 +1,18 @@ +Pod::Spec.new do |s| + s.name = 'ElementaryCycles' + s.version = '0.1.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. + DESC + s.homepage = 'https://github.com/hectr/swift-elementary-cycles' + s.license = { :type => 'BSD-2', :file => 'LICENSE' } + s.author = 'Hèctor Marquès' + s.social_media_url = 'https://twitter.com/elnetus' + s.ios.deployment_target = '10.0' + s.osx.deployment_target = '10.13' + s.source = { :git => 'https://github.com/hectr/swift-elementary-cycles.git', :tag => s.version.to_s } + s.source_files = 'Sources/ElementaryCycles/**/*' + s.dependency 'ElementaryCyclesSearch' + s.swift_version = '4.2' +end diff --git a/ElementaryCyclesSearch.podspec b/ElementaryCyclesSearch.podspec new file mode 100644 index 0000000..4e1680b --- /dev/null +++ b/ElementaryCyclesSearch.podspec @@ -0,0 +1,17 @@ +Pod::Spec.new do |s| + s.name = 'ElementaryCyclesSearch' + s.version = '0.1.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. + DESC + s.homepage = 'https://github.com/hectr/swift-elementary-cycles' + s.license = { :type => 'BSD-2', :file => 'LICENSE' } + s.author = 'Hèctor Marquès' + s.social_media_url = 'https://twitter.com/elnetus' + s.ios.deployment_target = '10.0' + s.osx.deployment_target = '10.13' + s.source = { :git => 'https://github.com/hectr/swift-elementary-cycles.git', :tag => s.version.to_s } + s.source_files = 'Sources/ElementaryCyclesSearch/**/*' + s.swift_version = '4.2' +end