PHPackages                             diolan12/dijkstra - PHPackages - PHPackages  [Skip to content](#main-content)[PHPackages](/)[Directory](/)[Categories](/categories)[Trending](/trending)[Leaderboard](/leaderboard)[Changelog](/changelog)[Analyze](/analyze)[Collections](/collections)[Log in](/login)[Sign up](/register)

1. [Directory](/)
2. /
3. [Utility & Helpers](/categories/utility)
4. /
5. diolan12/dijkstra

ActiveLibrary[Utility & Helpers](/categories/utility)

diolan12/dijkstra
=================

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

1.2.6(2y ago)2441MITPHP

Since Mar 31Pushed 1y ago1 watchersCompare

[ Source](https://github.com/diolan12/php-dijkstra)[ Packagist](https://packagist.org/packages/diolan12/dijkstra)[ Docs](https://github.com/diolan12/dijkstra)[ RSS](/packages/diolan12-dijkstra/feed)WikiDiscussions main Synced 1mo ago

READMEChangelog (10)Dependencies (1)Versions (11)Used By (0)

Dijkstra PHP Implementation
===========================

[](#dijkstra-php-implementation)

[![PHP Composer](https://github.com/diolan12/dijkstra/actions/workflows/php.yml/badge.svg)](https://github.com/diolan12/dijkstra/actions/workflows/php.yml)[![Downloads](https://camo.githubusercontent.com/5b2b98addfe68fcc9992bfe7971093225e1ed1b668bfcb44bdae26a0a8523878/68747470733a2f2f696d672e736869656c64732e696f2f7061636b61676973742f64742f64696f6c616e31322f64696a6b73747261)](https://packagist.org/packages/diolan12/dijkstra)[![Latest Stable Version](https://camo.githubusercontent.com/3c0ca47fd14a6ae0f1c1f486f5b16551ae32f90f630f5ff37471aca32e5a912a/68747470733a2f2f696d672e736869656c64732e696f2f7061636b61676973742f762f64696f6c616e31322f64696a6b73747261)](https://packagist.org/packages/diolan12/dijkstra)[![License](https://camo.githubusercontent.com/a9b56099b32bb2db706ed973826049ea8caa60a435156222bde074ab4bdda931/68747470733a2f2f696d672e736869656c64732e696f2f7061636b61676973742f6c2f64696f6c616e31322f64696a6b73747261)](LICENSE)

A simple PHP implementation for Dijkstra's algorithm

Generated by OpenAI ChatGPT [Mar 14 Version](https://help.openai.com/en/articles/6825453-chatgpt-release-notes)

See [Wikipedia](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)

Installation
------------

[](#installation)

```
composer require diolan12/dijkstra

```

Usage
-----

[](#usage)

[![Dijkstra_Animation](graph.png)](graph.png)

### Using `addVertex` or `addEdge` method

[](#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

[](#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`
-------------------------------

[](#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.

Dev Test
--------

[](#dev-test)

```
./vendor/bin/phpunit tests

```

###  Health Score

28

—

LowBetter than 54% of packages

Maintenance31

Infrequent updates — may be unmaintained

Popularity12

Limited adoption so far

Community9

Small or concentrated contributor base

Maturity51

Maturing project, gaining track record

 Bus Factor1

Top contributor holds 100% of commits — single point of failure

How is this calculated?**Maintenance (25%)** — Last commit recency, latest release date, and issue-to-star ratio. Uses a 2-year decay window.

**Popularity (30%)** — Total and monthly downloads, GitHub stars, and forks. Logarithmic scaling prevents top-heavy scores.

**Community (15%)** — Contributors, dependents, forks, watchers, and maintainers. Measures real ecosystem engagement.

**Maturity (30%)** — Project age, version count, PHP version support, and release stability.

###  Release Activity

Cadence

Every ~27 days

Recently: every ~45 days

Total

10

Last Release

892d ago

### Community

Maintainers

![](https://www.gravatar.com/avatar/d1d741881b8cc8aa64eb9f315ea06fcbba83f0ef1572ac6b424a063bd31ff986?d=identicon)[zulhamfendhy](/maintainers/zulhamfendhy)

![](https://www.gravatar.com/avatar/cfd6c8435b994bdf80c92e6d9c49f1dfb9d46fc9111a3c19b8cc99cd53bb2fa5?d=identicon)[diolan12](/maintainers/diolan12)

---

Top Contributors

[![diolan12](https://avatars.githubusercontent.com/u/24894631?v=4)](https://github.com/diolan12 "diolan12 (64 commits)")

---

Tags

algorithmchatgptcomposerdijkstradijkstra-algorithmlibraryopenaiphpshortest-path-algorithmphpAlgorithmdijkstraChatGptpathfinding

###  Code Quality

TestsPHPUnit

### Embed Badge

![Health badge](/badges/diolan12-dijkstra/health.svg)

```
[![Health](https://phpackages.com/badges/diolan12-dijkstra/health.svg)](https://phpackages.com/packages/diolan12-dijkstra)
```

###  Alternatives

[rubix/ml

A high-level machine learning and deep learning library for the PHP language.

2.2k1.4M28](/packages/rubix-ml)[fisharebest/algorithm

Implementation of standard algorithms in PHP.

7192.7k1](/packages/fisharebest-algorithm)[imanghafoori/laravel-anypass

A minimal yet powerful package to help you in development.

21421.6k](/packages/imanghafoori-laravel-anypass)

PHPackages © 2026

[Directory](/)[Categories](/categories)[Trending](/trending)[Changelog](/changelog)[Analyze](/analyze)