{"packages":{"graphp/algorithms":{"0.9.x-dev":{"name":"graphp/algorithms","description":"Common mathematical graph algorithms implemented in PHP","keywords":["shortest path","dijkstra","moore-bellman-ford","minimum spanning tree","kruskal","prim","Graph algorithms"],"homepage":"https://github.com/graphp/algorithms","version":"0.9.x-dev","version_normalized":"0.9.9999999.9999999-dev","license":["MIT"],"authors":[{"name":"Christian Lück","email":"christian@clue.engineering"}],"source":{"url":"https://github.com/graphp/algorithms.git","type":"git","reference":"269389305c94ad9b72b35a9f798ed70c1f708fc2"},"dist":{"url":"https://api.github.com/repos/graphp/algorithms/zipball/269389305c94ad9b72b35a9f798ed70c1f708fc2","type":"zip","shasum":"","reference":"269389305c94ad9b72b35a9f798ed70c1f708fc2"},"type":"library","funding":[],"time":"2022-11-02T07:52:53+00:00","autoload":{"psr-4":{"Graphp\\Algorithms\\":"src/"}},"default-branch":true,"require":{"php":">=5.3","graphp/graph":"1.x-dev#fb198e4 as 1.0.0"},"require-dev":{"phpunit/phpunit":"^9.3 || ^5.7 || ^4.8.35"},"uid":6668704},"v0.8.0":{"name":"graphp/algorithms","description":"Common mathematical graph algorithms","keywords":["shortest path","dijkstra","moore-bellman-ford","minimum spanning tree","kruskal","prim","Graph algorithms"],"homepage":"https://github.com/graphp/algorithms","version":"v0.8.0","version_normalized":"0.8.0.0","license":["MIT"],"authors":[{"name":"Christian Lück","email":"christian@lueck.tv"}],"source":{"url":"https://github.com/graphp/algorithms.git","type":"git","reference":"c6f3db2f72f1ad27866da97d3de794b9645df071"},"dist":{"url":"https://api.github.com/repos/graphp/algorithms/zipball/c6f3db2f72f1ad27866da97d3de794b9645df071","type":"zip","shasum":"","reference":"c6f3db2f72f1ad27866da97d3de794b9645df071"},"type":"library","time":"2015-02-25T22:46:55+00:00","autoload":{"psr-4":{"Graphp\\Algorithms\\":"src/"}},"require":{"php":">=5.3","clue/graph":"~0.8.0"},"require-dev":{"phpunit/phpunit":"~4.0"},"uid":341666},"v0.8.1":{"name":"graphp/algorithms","description":"Common mathematical graph algorithms","keywords":["shortest path","dijkstra","moore-bellman-ford","minimum spanning tree","kruskal","prim","Graph algorithms"],"homepage":"https://github.com/graphp/algorithms","version":"v0.8.1","version_normalized":"0.8.1.0","license":["MIT"],"authors":[{"name":"Christian Lück","email":"christian@lueck.tv"}],"source":{"url":"https://github.com/graphp/algorithms.git","type":"git","reference":"81db4049c35730767ec8f97fb5c4844234b86cef"},"dist":{"url":"https://api.github.com/repos/graphp/algorithms/zipball/81db4049c35730767ec8f97fb5c4844234b86cef","type":"zip","shasum":"","reference":"81db4049c35730767ec8f97fb5c4844234b86cef"},"type":"library","time":"2015-03-08T10:12:01+00:00","autoload":{"psr-4":{"Graphp\\Algorithms\\":"src/"}},"require":{"php":">=5.3","clue/graph":"~0.9.0|~0.8.0"},"require-dev":{"phpunit/phpunit":"~4.0"},"uid":350943},"v0.8.2":{"name":"graphp/algorithms","description":"Common mathematical graph algorithms implemented in PHP","keywords":["shortest path","dijkstra","moore-bellman-ford","minimum spanning tree","kruskal","prim","Graph algorithms"],"homepage":"https://github.com/graphp/algorithms","version":"v0.8.2","version_normalized":"0.8.2.0","license":["MIT"],"authors":[{"name":"Christian Lück","email":"christian@clue.engineering"}],"source":{"url":"https://github.com/graphp/algorithms.git","type":"git","reference":"abebbc44109f65c2962cd66f048ea3b8563e0a4a"},"dist":{"url":"https://api.github.com/repos/graphp/algorithms/zipball/abebbc44109f65c2962cd66f048ea3b8563e0a4a","type":"zip","shasum":"","reference":"abebbc44109f65c2962cd66f048ea3b8563e0a4a"},"type":"library","funding":[],"time":"2020-02-20T18:01:41+00:00","autoload":{"psr-4":{"Graphp\\Algorithms\\":"src/"}},"require":{"php":">=5.3","clue/graph":"~0.9.0|~0.8.0"},"require-dev":{"phpunit/phpunit":"^6.4 || ^5.7 || ^4.8.35"},"uid":3630528},"v0.8.x-dev":{"name":"graphp/algorithms","description":"Common mathematical graph algorithms implemented in PHP","keywords":["shortest path","dijkstra","moore-bellman-ford","minimum spanning tree","kruskal","prim","Graph algorithms"],"homepage":"https://github.com/graphp/algorithms","version":"v0.8.x-dev","version_normalized":"0.8.9999999.9999999-dev","license":["MIT"],"authors":[{"name":"Christian Lück","email":"christian@clue.engineering"}],"source":{"url":"https://github.com/graphp/algorithms.git","type":"git","reference":"1411afc3d3286ff8d2bb034f5cd83b1c5389f4dd"},"dist":{"url":"https://api.github.com/repos/graphp/algorithms/zipball/1411afc3d3286ff8d2bb034f5cd83b1c5389f4dd","type":"zip","shasum":"","reference":"1411afc3d3286ff8d2bb034f5cd83b1c5389f4dd"},"type":"library","funding":[],"time":"2020-02-20T18:11:57+00:00","autoload":{"psr-4":{"Graphp\\Algorithms\\":"src/"}},"require":{"php":">=5.3","clue/graph":"~0.9.0|~0.8.0"},"require-dev":{"phpunit/phpunit":"^6.4 || ^5.7 || ^4.8.35"},"uid":3630543}}}}