EvaluationOrder

This represents a node in the dependency graph of entities to be evaluated.

Constructs an EvaluationOrder object with the given starting entities.

Breaks a cycle in the dependency graph.

Report one cycle and break it.

Computes the evaluation order of the entities.

This method implements Kahn's algorithm to perform a topological sort of the entities based on their dependencies.

Get a node for an entity in the dependency graph.

If the entity is already in the graph, its corresponding node is returned. Otherwise, a new node is created for the entity and added to the graph.

This method also recursively adds nodes for all dependencies of the entity to the graph.

Computes the evaluation order of the given starting entities.

The dependencies of the starting entities are recursively explored to determine the order in which they should be evaluated.

Places a node in the evaluation order.

This method adds the node's entity to the ordered_entities vector and removes the node from the dependency graph.

Removes a node from the dependencies of all its dependents.

It also moves all dependents that are now ready to be evaluated into the ready_nodes set.

The nodes that have dependencies and are not ready to be evaluated.

The entities in the order they should be evaluated.

The nodes that have no dependencies and are ready to be evaluated.

The entities that have been added to the evaluation order.

These are stored as entities since their nodes are no longer needed and have been freed.

Constructs a node for the given entity.

Adds a dependency to this node.

Checks if this node is ready to be evaluated.

Removes a dependency from this node.

The nodes that this node depends on.

The nodes that depend on this node.

The entity corresponding to this node.