Tags: LdDl/ch
Tags
Clear code and add clarifications (#22) * redudant AddVertex() * merge relaxation and actual dijkstra * count edges and shourtcuts on a fly + add getters * redudant 'IsShortcut' * organize heaps * shorten * rev names * mv incident * redudant NewVertex * decrease vertex fields num * rm heaps from graph * name * redudant nodeOrdering? * run fmt * pointer to incident edge * rename * merge relaxation and bi-dir search * order could be int64, clarification about contraction id * consider Goish loops * continue goish loops * merge checkID * com * clarify previousSourceID * comment section * comment section * comment section
PreviousNext