Hopcroft–Karp algorithm: Difference between revisions

Revision as of 16:23, 28 October 2023

Revision as of 16:24, 28 October 2023

Line 69:

Dist[NIL] := ∞

'''while''' Empty(Q) = false '''do'''

u := Dequeue(LMQ)

'''if''' Dist[u] < Dist[NIL] '''then'''

'''for each''' v '''in''' Adj[u] '''do'''