Woordeboek
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.
'%3e%3c/path%3e%3c/g%3e%3cdefs%3e%3cmarker%20markerWidth='4.5'%20markerHeight='4.5'%20refX='2.25'%20refY='2.25'%20viewBox='0%200%204.5%204.5'%20orient='auto'%20id='SvgjsMarker4023'%3e%3cpolygon%20points='0,4.5%201.5,2.25%200,0%204.5,2.25'%20fill='white'%3e%3c/polygon%3e%3c/marker%3e%3c/defs%3e%3c/svg%3e)
Begin leer Engels met learnfeliz .
Oefen praat en memoriseer " directed graph " en baie ander woorde en sinne in Engels .
Gaan na ons Engels kursusbladsySinne
A directed graph consists of nodes and edges .
A directed graph consists of nodes and edges.
