Please enable JavaScript.
Coggle requires JavaScript to display documents.
Graphs - Coggle Diagram
Graphs
Deepth-dirst search
starts a graphs traversal
proceeds to an unvisited vertex
statck to tracve
trace the
algorithm’s action
depth-first search forest
Not a florest
tree edges
back edges
dfs traversal
efficient
Topological sorting
digraph
direted cycle
undirected graph
graph has no
directed cycles
algorithm
DFS
decrease and conquer
edge
Direct
tail
head
paths
lenth = number of vertices
connectivity
acyclicity
computer representaion
adjacency matrix
adjancency list
Collection of nodes
G= {V,E}
cicle
connected