Before you keep reading...
Runestone Academy can only continue if we get support from individuals like you. As a student you are well aware of the high cost of textbooks. Our mission is to provide great books to you for free, but we ask that you consider a $10 donation, more if you can or less if $10 is a burden.
Before you keep reading...
Making great stuff takes time and $$. If you appreciate the book you are reading now and want to keep quality materials free for other students please consider a donation to Runestone Academy. We ask that you consider a $10 donation, but if you can give more thats great, if $10 is too much for your budget we would be happy with whatever you can afford as a show of support.
7.24. Key Terms
acyclic graph |
edge |
adjacency list |
edge cost |
adjacency matrix |
graph |
adjacent |
parenthesis property |
breadth-first forest |
path |
breadth-first search (BFS) |
shortest path |
cycle |
spanning tree |
depth-first forest |
strongly connected components (SCC) |
depth-first search (DFS) |
topological sort |
digraph |
uncontrolled flooding |
directed acyclic graph (DAG) |
vertex |
directed graph |
weight |
You have attempted
1 of
1 activities on this page
