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

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


An '''antidirected path''' in a digraph is a simple path, every two adjacent arcs of which
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 [[vertex|vertices]]. Similarly, an '''[[antidirected Hamiltonian cycle]]''' is defined.
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.

Текущая версия от 16:30, 23 октября 2018

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.