Wallogit.com
2017 © Pedro Peláez
dijkstra algorithm
, (*1)
composer require taniko/dijkstra
$graph = Taniko\Dijkstra\Graph::create();
$graph
->add('s', 'a', 1)
->add('s', 'b', 2)
->add('a', 'b', 2)
->add('a', 'c', 4)
->add('b', 'c', 2)
->add('b', 'd', 5)
->add('c', 'd', 1)
->add('c', 't', 3)
->add('d', 't', 1);
$route = $graph->search('s', 't'); // ['s', 'b', 'c', 'd', 't']
$cost = $graph->cost($route); // 6.0
dijkstra algorithm
MIT
dijkstra algorithm
MIT
dijkstra algorithm
MIT