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 < 364, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 586828300174062601. (Vertex 2 must be…
The task
Construct a simple undirected graph on N vertices, numbered 1..N, with N < 364, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 586828300174062601. (Vertex 2 must be reachable from vertex 1.)