graph — Create an undirected graph object.
graph creates an undirected graph compatibility object with inspectable Nodes and Edges tables. It supports edge-list construction with numeric or named nodes, optional edge weights, optional node names, and dense adjacency matrices.
Syntax
graph()GPU memory and residency
No. Graph construction and traversal are host metadata/control-flow operations.
Using graph with coding agents
Open a RunMat example with live inputs, then ask the agent to explain how graph changes the result.
Run a small graph example, explain the result, then change one input and compare the output.
Related Graph functions
adjacency · bfsearch · conncomp · degree · dfsearch · digraph · distances · findedge · 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 graph is executed, line by line, in Rust.
- View the source for graph 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.