Skip to main content\(
\newcommand{\lt}{<}
\newcommand{\gt}{>}
\newcommand{\amp}{&}
\definecolor{fillinmathshade}{gray}{0.9}
\newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}}
\)
Section 7.24 Key Terms
Table 7.24.1.
| 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
of
activities on this page.
