Week 6: Directed Graphs Flashcards
1
Q
What is a Digraph?
A
2
Q
What are the properties of a digraph?
A
3
Q
Searching a digraph can be implemented by means of…
A
4
Q
What is reachability in a digraph?
A
5
Q
What is strong connectivity of a digraph?
A
6
Q
What is topological ordering?
A
7
Q
What is the algorithm for Topological sorting?
A
8
Q
Use a queue to represent the topological sorting of this graph:
A
