Cytoscape Shortest Path Highlight
A weighted network with the shortest path between a designated start and end node highlighted in red — Cytoscape's built-in `elements.aStar()` algorithm computes the path on the fly using edge weights. Non-path edges are dimmed so the optimal route stands out. Edge labels carry t
Template details
- chart
- network
- shortest-path
- algorithm
- cytoscape
When to use this template
This visualization makes obvious the most efficient or lowest-cost route between two points in a weighted network. Analysts reach for it to quickly identify optimal paths, understand the cumulative cost of a chosen route, and compare alternative connections in systems where minimizing traversal cost is critical.
- Network data with distinct nodes and edges.
- Edges possessing a single, positive numerical weight attribute.
- Datasets where a clear start and end node can be defined.
- Networks with a traversable path between selected nodes.
- Graph data where edge weights represent cost, distance, or time.
- Moderate graph density for visual interpretability.