Please enable JavaScript.
Coggle requires JavaScript to display documents.
Graphs (Review (Bubble (insertion), Is it a min heap (Yes (yes (No))),…
Graphs
Review
Bubble
insertion
Is it a min heap
Yes
yes
No
Pivot value
26
N people to F friends
log N+ log F
N logf
log N+ F Squared log F
open hash table
7000
closed hash table
Basics
Graphs are composed of
verticies/ Nodes
Edge
Types
Directed
Undirected
Could be implemented with
Adjacency Matrix
2D Array
Use for
dense graphs
Lots of interconnection between most verticies
Adjacency List
Array of Linked List
Use for
sparse graphs
Misc
Matrix Multiplication can be used to find n edges apart
Traversal
Types
Breadth
Implementation
Queue
Depth
Implementation
Stack