| { |
| "name": "ElementaryCyclesSearch", |
| "version": "0.3.0", |
| "summary": "Elementary Circuits of a Directed Graph", |
| "description": "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.", |
| "homepage": "https://github.com/hectr/swift-elementary-cycles", |
| "license": { |
| "type": "BSD-2", |
| "file": "LICENSE" |
| }, |
| "authors": "Hèctor Marquès", |
| "social_media_url": "https://twitter.com/elnetus", |
| "platforms": { |
| "ios": "10.0", |
| "osx": "10.13" |
| }, |
| "source": { |
| "git": "https://github.com/hectr/swift-elementary-cycles.git", |
| "tag": "0.3.0" |
| }, |
| "source_files": "Sources/ElementaryCyclesSearch/**/*", |
| "swift_versions": "5.0", |
| "swift_version": "5.0" |
| } |
