Please enable JavaScript.
Coggle requires JavaScript to display documents.
Graph, Simple Graph, Tree, AM (space complexity O(V^2), count V: O(1）,…
-
-
-
AM
-
-
-
-
Neighborhood - traverse the row where U is located
undirectional: O(V) traverse V elems
directional: O(V) traverse both column and row containing element U
AL
-
-
-
check Edge existence: O(K), K is the number of neighbors for a vertex
Neighbors -> O(K), K is the number of neighbors for a vertex
-
Directed Graph
u->v, v is a neighbor of u, not true conversely
-
-
-
edges & vertices
vertices has degree, incoming degree and outcoming degree
-
-
-
-
-
-
-
cut edge/vertex
an edge or vertex connects two components and it will divide the graph into two different graphs if removing it
-
-
-
-