Graph — French cities (ARC)
Preloaded with the one‑way connections used in the French cities example.
What this is?
A focused version of the graph playground, prefilled with the real French cities toy network. You can now leave either field blank:
- Only Start: list all
Xreachable from Start with one shortest chain each — likepath(start, X). - Only Goal: list all
Xthat can reach Goal — likepath(X, goal). - Both: show the shortest route Start → Goal.
Edges
Directed edges as in the source. Known nodes:
Answer
Reason why
BFS: finds the fewest hops in an unweighted graph. We run BFS forward (from Start) or on the reversed graph (from Goal) to list all solutions with their shortest chains.