PHP Class Trismegiste\Mondrian\Graph\BreadthFirstSearch
Uses the breadth first search method : shortest path and avoid cycle
Note : this is my own algorithm, I find it ugly and not DRY
Exibir arquivo
Open project: trismegiste/mondrian
Protected Properties
| Property |
Type |
Description |
|
| $stack |
|
|
|
Public Methods
| Method |
Description |
|
|
searchPath ( Vertex $src, Vertex $dst ) |
|
|
Protected Methods
Method Details
recursivSearchPath()
protected method
|
protected recursivSearchPath ( SplObjectStorage $step, Vertex $dst ) |
|
$step |
SplObjectStorage |
|
|
$dst |
Vertex |
|
resetVisited()
protected method
Reset visited state of edges
searchPath()
public method
|
public searchPath ( Vertex $src, Vertex $dst ) |
|
$src |
Vertex |
|
|
$dst |
Vertex |
|
Property Details
$stack protected_oe property