Logo

Theory Seminar Spring 2021 - Shared screen with speaker view
Cameron Musco
16:38
@rik not sure if this is what you are thinking, but i think you only care about failed nodes on the x y path. else the shortest path distance doesn't change when they fail. So you are just storing the path from x to y avoiding log n nodes, spaced out along the path from x to y
Rik Sengupta
16:53
Got it, that answers my question
Rik Sengupta
17:04
Thanks!