Please enable JavaScript.
Coggle requires JavaScript to display documents.
Graphs, Depht-first Search(DFS), Breadth-First Search, Topological Sorting…
Graphs
Representation
Adjacency lists
Weighted Graphs
Paths and cycles
Vertices and edges
Directed and undirected
Digraphs
Graphs can be dense, complete and sparse
Depht-first Search(DFS)
Exhaustive search
Depht-first search Forest
Edges
tree edge
back edge
High time efficiency
Breadth-First Search
Breadth-first search forest
Edges
Tree edge
Cross edge
Implements a FIFO queue
High time efficiency
Topological Sorting
Directed graph
Directed cycle
Sequence of three or more vertices that starts and ends in the same vertex