Welcome to yEd Q&A!
Here you can ask questions and receive answers from other members of the community and yEd developers. And you can tell us your most wanted feature requests.

Most popular tags

import node export labels edge nodes bug-report layout excel groups graphml yed edges properties-mapper palette svg automatic-layout swimlane custom-properties text properties error-report pdf group linux hierarchical-layout bug label macosx html bpmn kb print installation uml settings family-tree resize ui color label-placement grouping url yed-live graphmlviewer windows import-excel printing java line entity-relationship gedcom background save arrow flowchart link image error license positioning structure-view select font open icon data search default arrows tree lines copy size graph 64-bit diagram neighborhood-view fit-node-to-label description paste feature font-size icons xml symbols tooltip custom shape move selection editing edit - file-format ubuntu word visio alignment user-defined-symbols

Categories

Shortest path between two nodes

+2 votes
On a very large graph, is there an easy way to find the shortest path connecting any given two nodes?
in Feature Requests by
This could be either a tool, or even an addition to the 'neighborhood' panels; select two or more nodes and a 'path' panel shows the chain of nodes connecting them (or them in isolation if there is no connection).
by (140 points)

1 Answer

0 votes
No, I don't think so.
by [yWorks] (26.8k points)
Powered by Question2Answer
Legal Disclosure | Privacy Policy
...