Download the PHP package actived/graphphp without Composer
On this page you can find all versions of the php package actived/graphphp. It is possible to download/install these versions without Composer. Possible dependencies are resolved automatically.
FAQ
Example:
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 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.
Informations about the package graphphp
GraphPHP
A PHP graph theory package that provides structures and algorithms for working with graphs.
Installation
You can install the package via Composer:
Features
Graph
The Graph class provides the foundation for working with undirected graphs in PHP. It includes methods for manipulating nodes, edges, and retrieving various properties of the graph.
Creating a Graph
Adding Nodes
Adding Edges
Removing Nodes and Edges
Nodes and edges can be removed from the graph:
Neighbors
Retrieve the neighbors of a given node:
Adjacency Matrix
Get the adjacency matrix of the graph:
Checking for Cycles
Determine if the graph contains a cycle:
Transitive Closure
Compute the transitive closure of the graph using the Floyd-Warshall algorithm:
Shortest Path
Compute the shortest path between two nodes using Dijkstra's algorithm:
String Representation
To get a string representation of the graph:
Note: The Graph class assumes an undirected graph. For directed graphs, refer to the DiGraph class documentation.
DiGraph (Directed Graph)
The DiGraph class extends the base Graph class and represents a directed graph. This means all edges in this graph have a direction, going from a source node to a target node.
Creating a Directed Graph
Adding Directed Edges
Only directed edges can be added to a directed graph:
Outgoing Neighbors
Retrieve the outgoing neighbors of a given node:
Predecessors
Retrieve the predecessors (nodes with directed edges pointing to the given node) of a node:
Bellman-Ford Shortest Path
Compute the shortest path between two nodes using the Bellman-Ford algorithm:
Checking for Cycles in Directed Graphs
Determine if the directed graph contains a cycle:
Adjacency Matrix for Directed Graphs
Get the adjacency matrix of the directed graph:
Note: The DiGraph class is specific to directed graphs. If you need an undirected graph, refer to the base Graph class documentation.
Directed Acyclic Graphs (DAG)
Create and manipulate directed acyclic graphs.
Transitive Reduction
Perform transitive reduction on a DAG.
Topological Sort
Get a topological ordering of the nodes in a DAG.
Roadmap
- Testing: Implement comprehensive tests for the current functionalities.
- Trees: Introduce tree graph structures.
- Directed Trees: Extend the tree structures to support directed trees.
- Binary Trees: Implement binary tree structures and related algorithms.
Contributing
If you have suggestions or improvements, feel free to submit a pull request or open an issue on the GitHub repository.
License
This package is open-sourced software licensed under the MIT license.
