{"packages":{"graphp/graph":{"0.9.x-dev":{"name":"graphp/graph","description":"GraPHP is the mathematical graph/network library written in PHP.","keywords":["network","graph","mathematical","vertex","edge"],"homepage":"https://github.com/graphp/graph","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/graph.git","type":"git","reference":"32380f0ce9dff8533e717535186bccc920112997"},"dist":{"url":"https://api.github.com/repos/graphp/graph/zipball/32380f0ce9dff8533e717535186bccc920112997","type":"zip","shasum":"","reference":"32380f0ce9dff8533e717535186bccc920112997"},"type":"library","funding":[{"url":"https://clue.engineering/support","type":"custom"},{"url":"https://github.com/clue","type":"github"}],"time":"2022-10-19T09:37:24+00:00","autoload":{"psr-4":{"Fhaculty\\Graph\\":"src/"}},"require":{"php":">=5.3"},"require-dev":{"phpunit/phpunit":"^9.3 || ^5.7 || ^4.8.35"},"suggest":{"graphp/graphviz":"GraphViz graph drawing / DOT output","graphp/algorithms":"Common graph algorithms, such as Dijkstra and Moore-Bellman-Ford (shortest path), minimum spanning tree (MST), Kruskal, Prim and many more.."},"uid":3272615},"1.x-dev":{"name":"graphp/graph","description":"GraPHP is the mathematical graph/network library written in PHP.","keywords":["network","graph","mathematical","vertex","edge"],"homepage":"https://github.com/graphp/graph","version":"1.x-dev","version_normalized":"1.9999999.9999999.9999999-dev","license":["MIT"],"authors":[{"name":"Christian Lück","email":"christian@clue.engineering"}],"source":{"url":"https://github.com/graphp/graph.git","type":"git","reference":"0adb04de628a69498d8110705fc54cb47d8fc6a1"},"dist":{"url":"https://api.github.com/repos/graphp/graph/zipball/0adb04de628a69498d8110705fc54cb47d8fc6a1","type":"zip","shasum":"","reference":"0adb04de628a69498d8110705fc54cb47d8fc6a1"},"type":"library","funding":[{"url":"https://clue.engineering/support","type":"custom"},{"url":"https://github.com/clue","type":"github"}],"time":"2022-10-27T09:51:59+00:00","autoload":{"psr-4":{"Graphp\\Graph\\":"src/"}},"default-branch":true,"require":{"php":">=5.3"},"require-dev":{"phpunit/phpunit":"^9.5 || ^5.7 || ^4.8.35"},"suggest":{"graphp/graphviz":"GraphViz graph drawing / DOT output","graphp/algorithms":"Common graph algorithms, such as Dijkstra and Moore-Bellman-Ford (shortest path), minimum spanning tree (MST), Kruskal, Prim and many more.."},"uid":6643230},"v0.5.0":{"name":"graphp/graph","description":"A mathematical graph/network library written in PHP","keywords":["network","graph","mathematical","vertex","edge","shortest path","dijkstra","moore-bellman-ford","minimum spanning tree","kruskal","prim"],"homepage":"http://github.com/clue/graph","version":"v0.5.0","version_normalized":"0.5.0.0","license":["MIT"],"authors":[],"source":{"url":"https://github.com/graphp/graph.git","type":"git","reference":"6a40c4c773d9659f0d83f826cdd00d7e9bccc520"},"dist":{"url":"https://api.github.com/repos/graphp/graph/zipball/6a40c4c773d9659f0d83f826cdd00d7e9bccc520","type":"zip","shasum":"","reference":"6a40c4c773d9659f0d83f826cdd00d7e9bccc520"},"type":"library","time":"2013-05-07T14:17:48+00:00","autoload":{"psr-0":{"Fhaculty":"lib/"}},"require":{"php":">=5.3.0"},"uid":3272481},"v0.6.0":{"name":"graphp/graph","description":"A mathematical graph/network library written in PHP","keywords":["network","graph","graphviz","mathematical","vertex","edge","shortest path","dijkstra","moore-bellman-ford","minimum spanning tree","kruskal","prim"],"homepage":"https://github.com/clue/graph","version":"v0.6.0","version_normalized":"0.6.0.0","license":["MIT"],"authors":[],"source":{"url":"https://github.com/graphp/graph.git","type":"git","reference":"466f79ecdd3dfb38e54298282abd1415cdbfc73e"},"dist":{"url":"https://api.github.com/repos/graphp/graph/zipball/466f79ecdd3dfb38e54298282abd1415cdbfc73e","type":"zip","shasum":"","reference":"466f79ecdd3dfb38e54298282abd1415cdbfc73e"},"type":"library","time":"2013-07-11T08:37:05+00:00","autoload":{"psr-0":{"Fhaculty":"lib/"}},"require":{"php":">=5.3.0"},"require-dev":{"phpunit/phpunit":"3.7.*"},"uid":3272482},"v0.7.0":{"name":"graphp/graph","description":"A mathematical graph/network library written in PHP","keywords":["network","graph","graphviz","mathematical","vertex","edge","shortest path","dijkstra","moore-bellman-ford","minimum spanning tree","kruskal","prim"],"homepage":"https://github.com/clue/graph","version":"v0.7.0","version_normalized":"0.7.0.0","license":["MIT"],"authors":[],"source":{"url":"https://github.com/graphp/graph.git","type":"git","reference":"d0d548a21b09099a266eacba8e4098aeae6409f8"},"dist":{"url":"https://api.github.com/repos/graphp/graph/zipball/d0d548a21b09099a266eacba8e4098aeae6409f8","type":"zip","shasum":"","reference":"d0d548a21b09099a266eacba8e4098aeae6409f8"},"type":"library","time":"2013-09-11T22:52:40+00:00","autoload":{"psr-0":{"Fhaculty":"lib/"}},"require":{"php":">=5.3.0"},"require-dev":{"phpunit/phpunit":"3.7.*"},"uid":3272483},"v0.7.1":{"name":"graphp/graph","description":"A mathematical graph/network library written in PHP","keywords":["network","graph","graphviz","mathematical","vertex","edge","shortest path","dijkstra","moore-bellman-ford","minimum spanning tree","kruskal","prim"],"homepage":"https://github.com/clue/graph","version":"v0.7.1","version_normalized":"0.7.1.0","license":["MIT"],"authors":[],"source":{"url":"https://github.com/graphp/graph.git","type":"git","reference":"f4c2c2c2419e938299a85bf700a8da8c301b904d"},"dist":{"url":"https://api.github.com/repos/graphp/graph/zipball/f4c2c2c2419e938299a85bf700a8da8c301b904d","type":"zip","shasum":"","reference":"f4c2c2c2419e938299a85bf700a8da8c301b904d"},"type":"library","time":"2014-03-12T22:54:24+00:00","autoload":{"psr-0":{"Fhaculty":"lib/"}},"require":{"php":">=5.3.0"},"require-dev":{"phpunit/phpunit":"3.7.*"},"uid":3272484},"v0.8.0":{"name":"graphp/graph","description":"A mathematical graph/network library written in PHP","keywords":["network","graph","mathematical","vertex","edge","shortest path","dijkstra","moore-bellman-ford","minimum spanning tree","kruskal","prim"],"homepage":"https://github.com/clue/graph","version":"v0.8.0","version_normalized":"0.8.0.0","license":["MIT"],"authors":[],"source":{"url":"https://github.com/graphp/graph.git","type":"git","reference":"23d5f34da45bba9b19fe4f37b1748adcac1b83d2"},"dist":{"url":"https://api.github.com/repos/graphp/graph/zipball/23d5f34da45bba9b19fe4f37b1748adcac1b83d2","type":"zip","shasum":"","reference":"23d5f34da45bba9b19fe4f37b1748adcac1b83d2"},"type":"library","time":"2014-12-31T15:51:10+00:00","autoload":{"psr-0":{"Fhaculty":"lib/"}},"require":{"php":">=5.3.0"},"require-dev":{"phpunit/phpunit":"3.7.* | ~4.0"},"suggest":{"graphp/graphviz":"GraphViz graph drawing / DOT output"},"uid":3272485},"v0.9.0":{"name":"graphp/graph","description":"A mathematical graph/network library written in PHP","keywords":["network","graph","mathematical","vertex","edge"],"homepage":"https://github.com/clue/graph","version":"v0.9.0","version_normalized":"0.9.0.0","license":["MIT"],"authors":[],"source":{"url":"https://github.com/graphp/graph.git","type":"git","reference":"0336a4d5229fa61a20ccceaeab25e52ac9542700"},"dist":{"url":"https://api.github.com/repos/graphp/graph/zipball/0336a4d5229fa61a20ccceaeab25e52ac9542700","type":"zip","shasum":"","reference":"0336a4d5229fa61a20ccceaeab25e52ac9542700"},"type":"library","time":"2015-03-07T18:11:31+00:00","autoload":{"psr-4":{"Fhaculty\\Graph\\":"src/"}},"require":{"php":">=5.3.0"},"require-dev":{"phpunit/phpunit":"~4.0"},"suggest":{"graphp/graphviz":"GraphViz graph drawing / DOT output","graphp/algorithms":"Common graph algorithms, such as Dijkstra and Moore-Bellman-Ford (shortest path), minimum spanning tree (MST), Kruskal, Prim and many more.."},"uid":3272486},"v0.9.1":{"name":"graphp/graph","description":"GraPHP is the mathematical graph/network library written in PHP.","keywords":["network","graph","mathematical","vertex","edge"],"homepage":"https://github.com/graphp/graph","version":"v0.9.1","version_normalized":"0.9.1.0","license":["MIT"],"authors":[],"source":{"url":"https://github.com/graphp/graph.git","type":"git","reference":"07ce1e2f6d5be2ff600ce13660b25f25cf928c66"},"dist":{"url":"https://api.github.com/repos/graphp/graph/zipball/07ce1e2f6d5be2ff600ce13660b25f25cf928c66","type":"zip","shasum":"","reference":"07ce1e2f6d5be2ff600ce13660b25f25cf928c66"},"type":"library","time":"2019-10-02T09:10:26+00:00","autoload":{"psr-4":{"Fhaculty\\Graph\\":"src/"}},"require":{"php":"^7.0 || ^5.3"},"require-dev":{"phpunit/phpunit":"^6.4 || ^5.7 || ^4.8.35"},"suggest":{"graphp/graphviz":"GraphViz graph drawing / DOT output","graphp/algorithms":"Common graph algorithms, such as Dijkstra and Moore-Bellman-Ford (shortest path), minimum spanning tree (MST), Kruskal, Prim and many more.."},"uid":3272487},"v0.9.2":{"name":"graphp/graph","description":"GraPHP is the mathematical graph/network library written in PHP.","keywords":["network","graph","mathematical","vertex","edge"],"homepage":"https://github.com/graphp/graph","version":"v0.9.2","version_normalized":"0.9.2.0","license":["MIT"],"authors":[{"name":"Christian Lück","email":"christian@clue.engineering"}],"source":{"url":"https://github.com/graphp/graph.git","type":"git","reference":"187902e158dead96fc5da3ae368ea1080abf267d"},"dist":{"url":"https://api.github.com/repos/graphp/graph/zipball/187902e158dead96fc5da3ae368ea1080abf267d","type":"zip","shasum":"","reference":"187902e158dead96fc5da3ae368ea1080abf267d"},"type":"library","time":"2020-12-03T18:55:21+00:00","autoload":{"psr-4":{"Fhaculty\\Graph\\":"src/"}},"require":{"php":">=5.3"},"require-dev":{"phpunit/phpunit":"^9.3 || ^5.7 || ^4.8.35"},"suggest":{"graphp/graphviz":"GraphViz graph drawing / DOT output","graphp/algorithms":"Common graph algorithms, such as Dijkstra and Moore-Bellman-Ford (shortest path), minimum spanning tree (MST), Kruskal, Prim and many more.."},"uid":4713197},"v0.9.3":{"name":"graphp/graph","description":"GraPHP is the mathematical graph/network library written in PHP.","keywords":["network","graph","mathematical","vertex","edge"],"homepage":"https://github.com/graphp/graph","version":"v0.9.3","version_normalized":"0.9.3.0","license":["MIT"],"authors":[{"name":"Christian Lück","email":"christian@clue.engineering"}],"source":{"url":"https://github.com/graphp/graph.git","type":"git","reference":"d1661c0a0e011a8550fa60ae5354f230d1555909"},"dist":{"url":"https://api.github.com/repos/graphp/graph/zipball/d1661c0a0e011a8550fa60ae5354f230d1555909","type":"zip","shasum":"","reference":"d1661c0a0e011a8550fa60ae5354f230d1555909"},"type":"library","funding":[{"url":"https://clue.engineering/support","type":"custom"},{"url":"https://github.com/clue","type":"github"}],"time":"2021-12-30T09:22:01+00:00","autoload":{"psr-4":{"Fhaculty\\Graph\\":"src/"}},"require":{"php":">=5.3"},"require-dev":{"phpunit/phpunit":"^9.3 || ^5.7 || ^4.8.35"},"suggest":{"graphp/graphviz":"GraphViz graph drawing / DOT output","graphp/algorithms":"Common graph algorithms, such as Dijkstra and Moore-Bellman-Ford (shortest path), minimum spanning tree (MST), Kruskal, Prim and many more.."},"uid":5817482}}}}