PHP download

Download the PHP package letournel/path-finder without Composer

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

Table of contents
Download letournel/path-finder
More information about letournel/path-finder
Files in letournel/path-finder

Vendor letournel
Package path-finder
Short Description Path finder algorithm
License MIT

Keywords shortest path dijkstra Graph algorithms travelling salesman astar floydwarshall nearest neighbour 2opt 3opt

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 letournel/path-finder

Informations about the package path-finder

PathFinder - The best route is the shortest

PathFinder is a standalone library aiming to implement famous path and route finding algorithms in PHP to solve classical problems such as:

Features

Distances: Chebyshev, Euclidean, Manhattan, Octile, Zero
SSP solving algorithms: AStar, Dijkstra, FloydWarshall
TSP solving algorithms: NearestNeighbour, 2Opt, 3Opt

Roadmap

New SSP solving algorithms: Kruskal MooreBellmanFord Prim or others
New TSP solving algorithms: Christofides, kOpt, LinKernighan or others
Speed optimisations
Open to suggestions and contributions

Classes

Core Classes

Heuristic: A distance with a floating weight.
Node: A node entity used in NodeGrid, NodeGraph, NodeMap or NodePath which is basically a couple of coordinates (x, y) or indices (i,j)
NodeGraph: A graph is a set of vertices connected by edges. Here, vertices are nodes and any couple of them can be connected by an edge with a floating value. By default, the graph is symmetric so the edge from vertex A to vertex B and vice versa have the same value.
NodeGrid: Simply a matrix of Nodes with coordinates (x, y) or indices (i,j) using the following pattern:
NodeMap: A map or dictionary which maps a Node (as key) to an object (as value) which can be a Node, boolean, ...
NodePath: A linked list of successive Nodes which forms a path

Algorithms Classes

ShortestDistance\Dijkstra: Compute shortest distance with Dijkstra algorithm
ShortestDistance\FloydWarshall: Compute shortest distance with FloydWarshall algorithm
ShortestPath\AStar: Compute shortest path with AStar algorithm
ShortestPath\Dijkstra: Compute shortest path with Dijkstra algorithm
TravelingSalesman\NearestNeighbour: Compute shortest tour with NearestNeighbour algorithm
TravelingSalesman\ThreeOpt: Improve shortest tour with ThreeOpt algorithm
TravelingSalesman\TwoOpt: Improve shortest tour with TwoOpt algorithm

Converters Classes

Grid\ASCIISyntax: Allow converting map with an ASCII syntax to NodeMap, NodePath, Node Objects back and forth

Distances Classes

Chebyshev: Compute the Chebyshev distance between two nodes which is max(|dx|, |dy|)
Euclidean: Compute the Euclidean distance between two nodes which is sqrt(|dx|^2 + |dy|^2)
Manhattan: Compute the Manhattan distance between two nodes which is |dx| + |dy|
Octile : Compute the Octile distance between two nodes which is (|dx| < |dy|) ? (sqrt(2) - 1) |dx| + |dy|: (sqrt(2) - 1) |dy| + |dx|
Zero : Compute the null or zero distance between two nodes A and B which is always 0

Examples

ASCIISyntax for maps:

Path: '.'
Source: '>'
Target: '<'
Wall: 'X'

SSP solving:

Installation

Use composer:

Legal

Code released under the MIT license

All versions of path-finder with dependencies

PHP Build Version

Package Version

Version 1.2.1 Release 23. Jul 2017
create-project require 0 people choosed require and
0 people choosed create-project.

Download

Download latest version of path-finder from vendor letournel

Requires php Version >=5.3.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 letournel/path-finder contains the following files

Loading the files please wait ....