distances — Compute shortest-path distance matrices.
distances(G) computes all-pairs shortest-path distances. Optional source and target node lists restrict the rows and columns.
Syntax
distances(G)Using distances with coding agents
Open a RunMat example with live inputs, then ask the agent to explain how distances changes the result.
Run a small distances example, explain the result, then change one input and compare the output.
Related Graph functions
adjacency · bfsearch · conncomp · degree · dfsearch · digraph · 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 distances is executed, line by line, in Rust.
- View the source for distances 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.