directed graph

Reikšmė (Anglų k.)

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.

Priešingybė
undirected graph
Sinonimai

oriented graph

Vertimai

graphe orienté

orientierter Graph

digraphe

graphe dirigé

grafo diretto

grafo orientato

gerichte graaf

yönlendirilmiş çizge

Notes

Sign in to write sticky notes