2 "name": "ElementaryCyclesSearch",
4 "summary": "Elementary Circuits of a Directed Graph",
5 "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.",
6 "homepage": "https://github.com/hectr/swift-elementary-cycles",
11 "authors": "Hèctor Marquès",
12 "social_media_url": "https://twitter.com/elnetus",
18 "git": "https://github.com/hectr/swift-elementary-cycles.git",
21 "source_files": "Sources/ElementaryCyclesSearch/**/*",
22 "swift_version": "4.2"