Sign inSign in

Asynchronous relaxation-based BFS algorithm (second Attempt)

A relaxation-based algorithm similar to Bellman-Ford where processes track hop distance and update their parent pointer upon discovering a shorter path to correct for asynchrony errors.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Lecturers

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.