Значение

значений: 1
  1. A graph in which the edges are ordered pairs, so that, if the edge (a, b) is in the graph, the edge (b, a) need not be in the graph and is distinct from (a, b) if it is.

    A directed graph (A, R) is a set of vertices A together with an incidence relation R: if aRb then there is an edge going from A to B.

    gerichteter Graph, Digraph

    ориенти́рованный графorijentírovannyj graf, оргра́фorgráf

Переводы

языков: 7
Русский
По значениям 1
graph in which the edges are ordered pairs:
Deutsch
По значениям 1
graph in which the edges are ordered pairs:

Формы

мн. число: directed graphs
Ед. числоdirected graph
Мн. числоdirected graphs

правильный

Синонимы

синонимов: 1

Антонимы

антонимов: 1

Смотрите также

соседние слова
directed graph — значение, примеры, формы, синонимы | Krumeto