QQuikGraphWeb0.2.0

Graph laboratoryDocumentation ↗npm ↗

EXPLORE THE LIBRARY

⌕

Native JavaScript · Optional native engines
Based on QuikGraph ↗

PATHS & TRAVERSAL

Shortest path, made visible.

Find the lowest-cost route through a weighted graph using Dijkstra’s algorithm.

Interactive example

Directed graph8 vertices · 12 edges

Graph edge Algorithm resultSelect a vertex to inspect

CONFIGURATION

Run the algorithm

Source vertexTarget vertex

Open binary graph

GRAPH EDITOR

Edit this graph and rerun. Double-click the canvas to add a vertex.

RESULT

—execution time

—result items

Ready to explore.

Source

Executed locally in your browser

Native engine output

Rendered graph

QuikGraphWeb Directed & undirected graphs · Algorithms · Graphviz · Serialization · Petri netsCompatibility & test coverage ↗