digraph — Create a directed graph object.
digraph creates a directed graph compatibility object with Nodes and Edges tables. It supports edge-list construction with numeric or named nodes, optional weights, optional node names, and dense adjacency matrices.
Syntax
digraph()GPU memory and residency
No. Directed graph construction and traversal are host metadata/control-flow operations.
Using digraph with coding agents
Open a RunMat example with live inputs, then ask the agent to explain how digraph changes the result.
Run a small digraph example, explain the result, then change one input and compare the output.
Related Graph functions
adjacency · bfsearch · conncomp · degree · dfsearch · distances · findedge · graph · indegree · neighbors · numedges · numnodes · outdegree · predecessors · shortestpath · successors · toposort · treelayout
Open-source implementation
Unlike proprietary runtimes, every RunMat function is open-source. Read exactly how digraph is executed, line by line, in Rust.
- View the source for digraph in Rust on GitHub
- Learn how the RunMat runtime works
- Found a bug? Open an issue with a minimal reproduction.
About RunMat
RunMat is an open-source runtime that executes MATLAB-syntax code blazing on any GPU. It is licensed under the Apache 2.0 license.
- RunMat automatically optimizes your math for GPU execution on Apple, Nvidia, and AMD hardware. No code changes needed. Simulations that took hours now take minutes.
- Start running code in seconds. RunMat runs in the browser, on the desktop, or from the CLI. No license server, no IT ticket.