A ranked battle arena for coders. Climb tiers, host live duels, and turn your classroom into a competitive league.
def shortest(graph, s, t):
pq = [(0, s)]
dist = {s: 0}
while pq:
d,u = heappop(pq)
if u == t: return dfn shortest(g: &Graph, s: u32, t: u32) {
let mut pq = BinaryHeap::new();
pq.push(Reverse((0, s)));
// ...