PHP download

Download the PHP package nexus-scholar/graph-algorithms without Composer

On this page you can find all versions of the php package nexus-scholar/graph-algorithms. It is possible to download/install these versions without Composer. Possible dependencies are resolved automatically.

Table of contents
Download nexus-scholar/graph-algorithms
More information about nexus-scholar/graph-algorithms
Files in nexus-scholar/graph-algorithms

Vendor nexus-scholar
Package graph-algorithms
Short Description A high-performance library of standard graph algorithms for PHP.
License MIT
Homepage https://github.com/nexus-scholar/graph-algorithms

Keywords network graph Pagerank algorithms pathfinding centrality

FAQ

After the download, you have to make one include require_once('vendor/autoload.php');. After that you have to import the classes with use statements.

Example:

If you use only one package a project is not needed. But if you use more then one package, without a project it is not possible to import the classes with use statements.

In general, it is recommended to use always a project to download your libraries. In an application normally there is more than one library needed.

Some PHP packages are not free to download and because of that hosted in private repositories. In this case some credentials are needed to access such packages. Please use the auth.json textarea to insert credentials, if a package is coming from a private repository. You can look here for more information.

Some hosting areas are not accessible by a terminal or SSH. Then it is not possible to use Composer.
To use Composer is sometimes complicated. Especially for beginners.
Composer needs much resources. Sometimes they are not available on a simple webspace.
If you are using private repositories you don't need to share your credentials. You can set up everything on our site and then you provide a simple download link to your team member.
Simplify your Composer build process. Use our own command line tool to download the vendor folder as binary. This makes your build process faster and you don't need to expose your credentials for private repositories.

Please rate this library. Is it a good library?

Example code of nexus-scholar/graph-algorithms

Informations about the package graph-algorithms

nexus-scholar/graph-algorithms

graph-algorithms is a PHP package of graph algorithms built on nexus-scholar/graph-core. It provides centrality, pathfinding, traversal, component analysis, topological ordering, and minimum-spanning-tree algorithms through typed, reusable APIs.

Role In Nexus Scholar

This package is the algorithm layer for Nexus Scholar citation-network analysis. graph-core owns graph storage and export primitives; graph-algorithms owns reusable graph computations; nexus-scholar/core applies those capabilities to scholarly workflows such as citation graphs, co-citation analysis, bibliographic coupling, snowballing, and review exports.

The package is generic enough to use outside research tooling, but its main public value is showing that Nexus Scholar's graph work is package-quality PHP, not only application code.

Features

PageRank and degree centrality.
Dijkstra and A* pathfinding.
Breadth-first and depth-first traversal.
Strongly connected components using Tarjan's algorithm.
Topological sort with cycle detection.
Minimum spanning tree support.
Integer-indexed AlgorithmGraph proxy for efficient algorithm execution.
Typed value objects such as PathResult and MstResult.
Pest test coverage and canonical fixtures.

Requirements

PHP 8.2+
nexus-scholar/graph-core ^1.0

Installation

Quick Start

PageRank

Shortest Path

A* With A Heuristic

Traversal

Strongly Connected Components

Custom Weights

Pathfinding algorithms can read weights from arbitrary edge attributes:

Error Handling

Algorithms expose failure states through typed returns or meaningful exceptions depending on the operation:

Dijkstra rejects negative weights.
Topological sort reports cycles.
Minimum spanning tree returns no result for disconnected graphs.
Pathfinding returns null when no path exists.

Architecture

AlgorithmGraph: optimized integer-indexed graph proxy used during algorithm execution.
IndexMap: bidirectional string-to-integer mapping.
CentralityAlgorithmInterface: centrality algorithm contract.
PathfindingAlgorithmInterface: pathfinding contract returning PathResult.
TraversalAlgorithmInterface: traversal contract.
PathResult: immutable shortest-path result.
MstResult: minimum-spanning-tree result.

Testing

Use Cases

Citation-network analysis.
Scholarly influence and discovery graphs.
Dependency resolution and build ordering.
Workflow orchestration.
Route planning and logistics.
Infrastructure and network analysis.
Game pathfinding and level connectivity.

License

This library is open-sourced software licensed under the MIT license.

All versions of graph-algorithms with dependencies

PHP Build Version

Package Version

Version v1.2.0 Release 22. May 2026
create-project require 0 people chose require and
0 people chose create-project.

Download

Download latest version of graph-algorithms from vendor nexus-scholar

Requires php Version ^8.2
nexus-scholar/graph-core Version ^1.0

Composer command for our command line client (download client) This client runs in each environment. You don't need a specific PHP version etc. The first 20 API calls are free. Standard composer command

The package nexus-scholar/graph-algorithms contains the following files

Loading the files please wait ...