directed
RU: ориентированный
Describes a graph whose edges are one-way: an edge A → B can be traversed only from A to B. Such a graph is often called a digraph.
RU: ориентированный
Describes a graph whose edges are one-way: an edge A → B can be traversed only from A to B. Such a graph is often called a digraph.