Arrangement

Материал из WikiGrapp
Перейти к навигации Перейти к поиску

Arrangementаранжировка.

A numbering [math]\displaystyle{ F }[/math] of an alt [math]\displaystyle{ C }[/math] is called an arrangement if every simple path in [math]\displaystyle{ C }[/math] from its initial node is [math]\displaystyle{ F }[/math]-path.