Of Notes
Graph Distance
Generally there are many solutions to finding minimal routes but we broadly express
which plainly says that we pick the minimal length for all connections which are greater than 0 length (disconnected). And if there is no path we say that