construct/rlve shortest path count
construct/rlve shortest path count: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Construct a simple undirected graph on N vertices, numbered 1..N, with N < 35, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 33. (Vertex 2 must be reachable from…
The task
Construct a simple undirected graph on N vertices, numbered 1..N, with N < 35, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 33. (Vertex 2 must be reachable from vertex 1.)