HF RL Explorer

You are given a connected undirected weighted graph consisting of $$$n$$$ vertices and $$$m$$$ edges.

You are given a connected undirected weighted graph consisting of $$$n$$$ vertices and $$$m$$$ edges.: a task in TaskCompendium spike examples (Harbor dataset). You need to print the $$$k$$$-th smallest shortest path in this graph (paths from the vertex to itself are not counted, paths from…

The task

You need to print the $$$k$$$-th smallest shortest path in this graph (paths from the vertex to itself are not counted, paths from $$$i$$$ to $$$j$$$ and from $$$j$$$ to $$$i$$$ are counted as one).

Part of open-athena/taskcompendium-spike.