84
правки
Изменения
→Псевдокод алгоритма Фринка
<tex>v - w = E[0]</tex>
<tex>R = </tex> reductions<tex>(G, v - w)</tex>
'''if''' bridgeless <tex>(G[V - \{v, w\}, E \cup R[0] ])</tex>
<tex>r = R[0]</tex>
'''else'''
<tex>M =</tex> frinkMatching <tex>(G[V - \{v, w\}, E \cup r])</tex>
'''if''' <tex>|r \cap M| = 2 </tex>
<tex>C =</tex> alternatingCycle <tex>(G, M, r[0])</tex>
<tex>M = M \oplus C</tex>
<tex>M = (M - r) \cup </tex> simpleReversion<tex>(G, v, w, r, M)</tex>
