runbiscuit/dijkstra

A simple PHP implementation on Dijkstra's algorithm generated by ChatGPT

v1.1.1 2026-01-12 09:56 UTC

Requires (Dev)

• phpunit/phpunit: 9.5.26

MIT

• Dio Lantief Widoyoko
• zulhameffendy14

• php
• Algorithm
• dijkstra
• pathfinding
• ChatGpt

README

Forked from diolan12/dijkstra.

A simple PHP implementation for Dijkstra's algorithm

Generated by OpenAI ChatGPT Mar 14 Version

See Wikipedia

Installation

composer require diolan12/dijkstra

Usage

Using addVertex or addEdge method

// Adding edge
$dijkstra->addEdge('D', 'B', 5)->addEdge('D', 'C', 6);
// Is equals to adding vertex
$dijkstra->addVertex('D', ['B' => 5, 'C' => 6]);

use Diolan12\Dijkstra;

$dijkstra = new \Diolan12\Dijkstra();
// or
$dijkstra = new Dijkstra();
// or
$dijkstra = Dijkstra::instance();

// Add vertices and edges
$dijkstra->addVertex('A', ['B' => 4, 'C' => 2]);
$dijkstra->addVertex('B', ['A' => 4, 'C' => 1, 'D' => 4]);
$dijkstra->addVertex('C', ['A' => 2, 'B' => 1, 'D' => 6]);
$dijkstra->addEdge('D', 'B', 4, true)->addEdge('D', 'C', 6, true);

$paths = $dijkstra->findShortestPath('A', 'D'); // [A, C, B, D]

Using graph via class instantiation

Creating graph like this

$graph = [
    'A' => [
        'B' => 4,
        'C' => 2
    ],
    'B' => [
        'A' => 4,
        'C' => 1,
        'D' => 4
    ],
    'C' => [
        'A' => 2,
        'B' => 1,
        'D' => 6
    ],
    'D' => [
        'B' => 4,
        'C' => 6
    ]
];

$dijkstra = Dijkstra::instance($graph);

Is the same with this method

$dijkstra->addVertex('A', ['B' => 4, 'C' => 2]);
$dijkstra->addVertex('B', ['A' => 4, 'C' => 1, 'D' => 4]);
$dijkstra->addVertex('C', ['A' => 2, 'B' => 1, 'D' => 6]);
$dijkstra->addEdge('D', 'B', 4)->addEdge('D', 'C', 6);

Method addVertex vs addEdge

addVertex: This method is used to add a vertex to the graph. A vertex represents a point or node in the graph. In the context of the Dijkstra algorithm, a vertex can be thought of as a location or node in a network. The addVertex method takes two parameters: the name of the vertex and an array of neighboring vertices (edges) with their corresponding edge weights. It adds the vertex and its associated edges to the graph.

addEdge: This method is used to add an edge between two vertices in the graph. An edge represents a connection or link between two vertices. In the context of the Dijkstra algorithm, an edge represents a cable route or path between two locations in a network. The addEdge method takes three parameters: the source vertex, the destination vertex, and the weight or cost of the edge. It establishes the connection between the source and destination vertices with the specified weight.

To summarize, addVertex is used to add a vertex with its neighboring edges to the graph, while addEdge is used to establish a connection (edge) between two vertices with a specified weight. Together, these methods allow you to build the graph representation required for the Dijkstra algorithm to find the shortest path between vertices in the network.

Method findShortestPath

To make this library work in use cases where edges should be "taggable" and contain other metadata, the following methods have been modified:

addEdge($src, $dest, $weight, ?string $tag = null, array $data = [], $reversible = false): Edges can contain a tag parameter and data parameter. addVertex($name, $edges): Edges can be an array of arrays with the keys tag, data and weight, or just the weight value.

findShortestPath($start, $end, $verbose = false): In order to receive the supplied data in our response, the verbose parameter has been added.

findShortestPath(start: 'A', end: 'D', verbose: true) output:

array(4) {
  ["cost"]=>
  int(7)
  ["edges"]=>
  array(3) {
    [0]=>
    array(3) {
      ["tag"]=>
      string(6) "A to C"
      ["data"]=>
      array(0) {
      }
      ["weight"]=>
      int(2)
    }
    [1]=>
    array(3) {
      ["tag"]=>
      string(6) "C to B"
      ["data"]=>
      array(0) {
      }
      ["weight"]=>
      int(1)
    }
    [2]=>
    array(3) {
      ["tag"]=>
      string(6) "B to D"
      ["data"]=>
      array(0) {
      }
      ["weight"]=>
      int(4)
    }
  }
  ["path"]=>
  array(4) {
    [0]=>
    string(1) "A"
    [1]=>
    string(1) "C"
    [2]=>
    string(1) "B"
    [3]=>
    string(1) "D"
  }
  ["merged"]=>
  array(7) {
    [0]=>
    string(1) "A"
    [1]=>
    array(3) {
      ["tag"]=>
      string(6) "A to C"
      ["data"]=>
      array(0) {
      }
      ["weight"]=>
      int(2)
    }
    [2]=>
    string(1) "C"
    [3]=>
    array(3) {
      ["tag"]=>
      string(6) "C to B"
      ["data"]=>
      array(0) {
      }
      ["weight"]=>
      int(1)
    }
    [4]=>
    string(1) "B"
    [5]=>
    array(3) {
      ["tag"]=>
      string(6) "B to D"
      ["data"]=>
      array(0) {
      }
      ["weight"]=>
      int(4)
    }
    [6]=>
    string(1) "D"
  }
}

Dev Test

./vendor/bin/phpunit tests