Antidirected path: различия между версиями

Материал из WikiGrapp
Перейти к навигации Перейти к поиску
(Создана новая страница размером '''Antidirected path''' --- антиориентированный путь. An '''antidirected path''' in a digraph is a simple path, ...)
(нет различий)

Версия от 16:49, 18 января 2011

Antidirected path --- антиориентированный путь.

An antidirected path in a digraph is a simple path, every two adjacent arcs of which have opposite orientations, i.e. no two consecutive arcs of the path form a directed path. An antidirected Hamiltonian path in a digraph is a simple antidirected path containing all the vertices. Similarly, an antidirected Hamiltonian cycle is defined.