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
cyclic graph	strongly connected components (SCC)
depth-first forest	topological sort
depth-first search (DFS)	uncontrolled flooding
digraph	vertex
directed acyclic graph (DAG)	weight
directed graph

You have attempted of activities on this page