d da db dc dd de df dg dh di dj dk dl dm dn do dp dr ds dt du dw dx dy dz

Перевод: digraph

[существительное]
диграф

Тезаурус:

1. This means that there are fewer paths, so the cover of a digraph may be smaller than the cover of the undirected graph.
2. The task space is a finite digraph without cycles.
3. Next, we come to the notion of a directed graph, sometimes called a digraph.
4. The cover of a digraph may be finite, while if you leave out all its arrows, its undirected cover is infinite.
5. In fact, the cover of a digraph may even be smaller than the original digraph.
6. digraph
7. The task space is a digraph without cycles.
8. Similarly, any connected digraph with a root has a covering tree.
9. In pictures, a graph consists of points and lines as in Figure 1, while in a digraph, Figure 2, the lines have arrows on them.