Please enable JavaScript.
Coggle requires JavaScript to display documents.
GRAPHS, TOPOLOGICAL SORTING, DEPTH-FIRST SEARCH AND BREADTH-FIRST SEARCH -…
GRAPHS
EDGES/ARCS
VERTICLES/NODES
WEIGHT MATRIX OR COST MATRIX
CONNECTIVITY
ACYCLICITY
DIRECTED PATH
TOPOLOGICAL SORTING
DIRECTED GRAPH OR DIGRAPH
CPM - CRITICAL PATH METHOD
PERT - PROGRAM EVALUATION AND REVIEW TECHNIQUE
DAG (DIRECTED ACYCLIC GRAPH)
DEPTH-FIRST SEARCH AND BREADTH-FIRST SEARCH
DFS
TREE EDGE
BACK EDGE
ARTICULATION POINT
STACK
TWO ORDERINGS
CONNECTIVITY
ACYCLICITY
EFFICIENCY FOR ADJACENCY MATRIX: Θ(|V²|)
EFFICIENCY FOR ADJACENCY LISTS: Θ(|V| + |E|)
BFS
TREE EDGE
CROSS EDGE
QUEUE
ONE ORDERING
CONNECTIVITY
ACYCLICITY
MINIMUM-EDGE PATHS
EFFICIENCY FOR ADJACENCY MATRIX: Θ(|V²|)
EFFICIENCY FOR ADJACENCY LISTS: Θ(|V| + |E|)