Graph Algorithm Workbench
Explore a network's connections and groups. Count links and find the path with the fewest steps between two nodes.
What does a graph algorithm analyze?
A graph represents items as nodes and relationships as edges. This workbench reports node degrees and connected components, and can find the fewest-edge path between two named nodes.
Your result
A little clarity, right here.
Start with your own content or load the example. Your result will appear here.
Three simple steps
How to use Graph Algorithm Workbench
Choose your input and review the processing notice.
Send the job to the isolated processing service.
Review the result and download your export.
Common questions
Good to know
Understand the result.
Keep the original.
Is this tool free, and are my files uploaded?
This tool is free with no account required. When you run the tool, your input goes to a separate processing service. Temporary files are deleted when the job ends. You can download the result to your device.
What are the limits and details?
Edges are unweighted. An optional third edge value is not used. Choose directed or undirected interpretation explicitly; shortest paths do not represent travel time or distance.
Limits: one file up to 8 MB; 500,000 characters per text field. One job runs at a time on the worker, with a two-minute limit.