Module topo 

Topological-level analysis and critical-path scheduling.

Beyond a simple topological order (provided by ComputeGraph::topological_order), this module computes rich scheduling information:

• Level assignment: Each node gets a “level” equal to the length of the longest path (in edges) from any source node to that node.
• Cost-weighted ASAP/ALAP: As-Soon-As-Possible and As-Late-As-Possible schedules using per-node cost hints.
• Slack: The difference ALAP - ASAP for each node; zero-slack nodes lie on the critical path.
• Priority lists: Used by the stream partitioner to order ready nodes.

Structs

NodeInfo

Scheduling metadata for a single node, produced by TopoAnalysis.

TopoAnalysis

Result of running topological-level analysis on a ComputeGraph.

Functions

analyse

Performs full topological-level analysis on graph.