#4818 Interactive N-Hop Graph Pathfinding
#4818 Interactive N-Hop Graph Pathfinding #4818 Concept: app to visually analyze Travelling Salesman Problem graph. Click on a node and select N jumps, show shortest path from that node for N jumps Finding the shortest simple path of length N starting from a selected vertex is a variant of the k-step shortest simple path problem (or truncated TSP / longest path depending on objective). Because it forbids visiting the same node twice, finding this path is generally NP-hard for arbitrary N , but on small to moderate graph sizes ( V <= 20 ), exact branch-and-bound or exhaustive DFS runs in milliseconds. Core Algorithmic Architecture Graph Representation: A fully connected or sparse weighted graph G = (V, E) where edge weights w(u, v) represent Euclidean distances between 2D nodes. Search Logic ( N jumps): State: (current_node, visited_mask, steps_remaining, current_distance) Base Case: When steps_remaining == 0 , compare current_distance against b...