Please enable JavaScript.
Coggle requires JavaScript to display documents.
M10, Grafos, Busca em profundidade, Busca em largura, Ordenação topológica…
M10
Início
Fim
Grafos
Path
Path length
Direct path
Adjacency matrix
More efficient in dense graphs
Adjacency lists
Good for representing sparse graphs
Weighted graphs
Weighted matrix
Vertices
Edges
Directed (endpoints)
Undirected (tail/head)
Dense/Sparse
Complete
Connectivity
Cycle
Busca em profundidade
Efficiency
Matrix Θ(v^2)
List Θ(V+E)
Depth first search forest
Tree edge
Back edge
Busca em largura
Ordenação topológica