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 < 358, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 346367314648891555. (Vertex 2 must be…