ICS 46 - Graphs
0.0(0)
Studied by 0 people
Call Kai
Learn
Practice Test
Spaced Repetition
Match
Flashcards
Knowt PlayCard Sorting
1/10
Earn XP
Description and Tags
ICS 46 - Graphs
Last updated 12:12 AM on 3/16/25
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
11 Terms
1
New cards
Adjacency List
Faster to iterate through
Better for sparse data
2
New cards
Adjacency Matrix
O(n²) memeory used, not ideal for sparse data sets
3
New cards
Depth First Traversal
DFS is also a traversal approach in which the traverse begins at the root node and proceeds through the nodes as far as possible until we reach the node with no unvisited nearby nodes.
4
New cards
Breadth First Search
BFS is a traversal approach in which we first walk through all nodes on the same level before moving on to the next level.
5
New cards
Iterative Deepening DFS
6
New cards
Toplogical Sort
7
New cards
Kruskals
8
New cards
Prims
9
New cards
Dijkstras
10
New cards
Bellman-Ford
11
New cards
A*
