graph theory - basic lemmas

excepts from CLRS(https://en.wikipedia.org/wiki/Introduction_to_Algorithms
)

initialize-single-sources Lemma 24.1 triangular inequality upper-bound property no-path property Lemma 13 Convergence property path-relaxation property Lemma 16
predecessor-subgraph property