INDEGREE - For a vertex, the number of head ends adjacent to a vertex is called the, OUTDEGREE - the number of tail ends adjacent to a vertex is its, PATH OF A GRAPH - sequence of vertices with the property that each vertex in the sequence is adjacent to the vertex next to it., DFS AND BFS - Graph traversal teniques,

GRAPH THEORY 1

Tisk
Vložit

Výsledková tabule/Žebříček

Vizuální styl

Možnosti

Přepnout šablonu

Obnovit automatické uložení: ?