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

Leaderboard

Visual style

Options

Switch template

Continue editing: ?