directed graph
Mane (Îngilîzî)
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.
Têgînên
directed graph
digraph
oriented graph
'%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)
Dest bi hînbûna îngilîzî bi learnfeliz .
Axaftin û ezberkirina " directed graph "û gelek peyv û hevokên din di îngilîzî de pratîk bikin.
Biçe rûpela qursa me ya îngilîzî
Notes
Sign in to write sticky notes
Hevokên
A directed graph consists of nodes and edges .
Grafikek ji nod û perdeyan pêk tê.
Questions
