feat: GraphPathExplorer — k-shortest paths, waypoint routing, bottleneck detection

[sauravbhattacharya001]

GraphPathExplorer — Advanced Path Finding

Extends GraphVisual with advanced path exploration beyond basic shortest-path:

Features

Capability	Description
All simple paths	DFS enumeration with maxDepth and maxPaths guards
K shortest paths	Yen's algorithm (Dijkstra + edge/node exclusions)
Constrained paths	Route through ordered waypoints
Avoidance routing	Skip forbidden vertices and/or edges
Path statistics	Count, length distribution, weight stats, diversity metric
Vertex participation	How many paths pass through each intermediate vertex
Bottleneck detection	Vertices appearing in ALL paths between a pair
Text report	Summary + top-5 shortest + bottlenecks + bar-chart distribution

API

GraphPathExplorer explorer = new GraphPathExplorer(graph);

// All paths with depth/count limits
List<Path> all = explorer.findAllSimplePaths("A", "Z", 15, 500);

// K shortest paths (Yen's algorithm)
List<Path> top3 = explorer.findKShortestPaths("A", "Z", 3);

// Must visit waypoints in order
Path constrained = explorer.findConstrainedPath("A", "Z", List.of("M", "N"));

// Avoid specific nodes or edges
Path detour = explorer.findPathAvoiding("A", "Z",
    Set.of("blocked"), Set.of(edgeKey("X", "Y")));

// Statistics and bottlenecks
PathStats stats = explorer.computePathStats("A", "Z", 10);
Set<String> cuts = explorer.findBottleneckVertices("A", "Z", 10);

// Full text report
System.out.println(explorer.generateReport("A", "Z"));

Tests

82 tests across 11 test groups — all passing. Covers:

• Constructor validation, all 7 features, edge key canonicalization
• 7 test graphs: linear, diamond, 3x3 grid, weighted, disconnected, K4, bottleneck

Size

722 source lines + 484 test lines = 1,206 total

[chatgpt-codex-connector]

You have reached your Codex usage limits for code reviews. You can see your limits in the Codex usage dashboard.