Class Doctrine\ORM\Internal\CommitOrderCalculator

CommitOrderCalculator implements topological sorting, which is an ordering algorithm for directed graphs (DG) and/or directed acyclic graphs (DAG) by using a depth-first 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).

Methods
`public`	`__construct()`	#
`public`	`hasNode(string $hash): bool` Checks for node (vertex) existence in graph. Checks for node (vertex) existence in graph.	#
`public`	`addNode(string $hash, ClassMetadata $node): void` Adds a new node (vertex) to the graph, assigning its hash and value. Adds a new node (vertex) to the graph, assigning its hash and value.	#
`public`	`addDependency(string $fromHash, string $toHash, int $weight): void` Adds a new dependency (edge) to the graph using their hashes. Adds a new dependency (edge) to the graph using their hashes.	#
`public`	`sort()` Return a valid order list of all current nodes. The desired topological sorting is the reverse post order of these… Return a valid order list of all current nodes. The desired topological sorting is the reverse post order of these searches. {@internal Highly performance-sensitive method.}	#
`private`	`visit(Vertex $vertex): void` Visit a given node definition for reordering. Visit a given node definition for reordering. {@internal Highly performance-sensitive method.}	#

Constants
`public`	`NOT_VISITED = VertexState::NOT_VISITED`	#
`public`	`IN_PROGRESS = VertexState::IN_PROGRESS`	#
`public`	`VISITED = VertexState::VISITED`	#

Properties
`private`	`array<string, Vertex>`	`$nodeList = []`	#
`private`		`$sortedNodeList = []` Volatile variable holding calculated nodes during sorting process. Volatile variable holding calculated nodes during sorting process.	#

Namespaces

Classes

Traits

Class Doctrine\ORM\Internal\CommitOrderCalculator