directed graph

Betekenis

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.

Engels

Begin leer Engels met learnfeliz .

Oefen praat en memoriseer " directed graph " en baie ander woorde en sinne in Engels .

Gaan na ons Engels kursusbladsy
Sinne

Comments