Expand description
GPU compute graph — a typed, topologically-ordered execution planner.
Models the task graph used internally by modern GPU driver stacks (e.g. DirectX 12 command lists, Vulkan render graphs, WebGPU compute passes).
§Node types
| Variant | Meaning |
|---|---|
NodeKind::Kernel | Dispatch a compute shader / kernel. |
NodeKind::Copy | Transfer data between buffers (DMA-style). |
NodeKind::Barrier | Memory / execution barrier between stages. |
§Workflow
- Create a
ComputeGraph. - Add nodes via
ComputeGraph::add_node. - Add resource bindings via
ComputeGraph::bind_resource. - Add edges via
ComputeGraph::add_edge. - Call
ComputeGraph::execution_orderto obtain a valid ordering. - Optionally call
ComputeGraph::validateto check for binding issues.
Structs§
- Compute
Graph - Directed acyclic graph of compute nodes with resource binding management.
- Execution
Plan - The result of topological ordering: an ordered list of node IDs.
- Graph
Node - A single node in the compute graph.
- Pipeline
Stage Flags - Bit flags representing pipeline stages for barrier nodes.
- Resource
Binding - A named resource bound to a specific node.
Enums§
- Graph
Error - Errors produced by the compute graph.
- Node
Kind - The functional category of a compute graph node.
- Resource
Access - Read / write access mode for a resource binding.