Checks if a node exists in the graph.
The node name
true if the node exists
Gets all node names.
Array of node names
Performs topological sort on the graph.
Returns nodes in dependency order (dependencies first). Throws if circular dependencies are detected.
Array of node names in topological order
Gets the reverse topological order.
Useful for shutdown (shutdown in reverse initialization order).
Array of node names in reverse topological order
Clears all nodes from the graph.
Dependency graph for topological sorting of plugins.
Ensures plugins are initialized in the correct order based on their dependencies.
Example