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