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