Dijkstra shortest paths

Directed nonnegative weighted edges, parallel edges/self-loops/zeros valid. Return minimum Int costs, source 0 and unreachable nullopt. Reject n<=0, invalid source/endpoints, negative weight with invalid_argument. Prototype simple paths; final min-heap Dijkstra with stale-entry checks. Preserve edges.

Public signatures:

Vec<Opt<Int>> prototype(const Int& n,const Vec<std::tuple<Int,Int,Int>>& edges,const Int& source);
Vec<Opt<Int>> solve(const Int& n,const Vec<std::tuple<Int,Int,Int>>& edges,const Int& source);

Compile and run from this directory:

c++ -std=c++20 -O2 -Wall -Wextra -pedantic -pthread main.cpp -o practice
./practice --stage prototype
./practice --stage final

Edit exercise.hpp. Both stages start unfinished and must report failures until implemented. Keep main.cpp as the executable contract. The runner returns nonzero for a failed check, an unexpected exception, an invalid stage, or an empty suite. C++20 and only the standard library are required.