Class CommitOrderCalculator
CommitOrderCalculator implements topological sorting, which is an ordering algorithm for directed graphs (DG) and/or directed acyclic graphs (DAG) by using a depthfirst searching (DFS) to traverse the graph built in memory. This algorithm have a linear running time based on nodes (V) and dependency between the nodes (E), resulting in a computational complexity of O(V + E).
Namespace: Doctrine\ORM\Internal
Author: Guilherme Blanco guilhermeblanco@hotmail.com
Author: Roman Borschel roman@codefactory.org
Since: 2.0
Located at ORM/Internal/CommitOrderCalculator.php
Author: Guilherme Blanco guilhermeblanco@hotmail.com
Author: Roman Borschel roman@codefactory.org
Since: 2.0
Located at ORM/Internal/CommitOrderCalculator.php
public
boolean


public


public

#
addDependency( string $fromHash, string $toHash, integer $weight )
Adds a new dependency (edge) to the graph using their hashes. 
public
array

integer 
NOT_VISITED

#
0

integer 
IN_PROGRESS

#
1

integer 
VISITED

#
2
