Week 6: Directed Graphs Flashcards
1
Q
What is a Digraph?
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/391/126/776/a_image_thumb.png?1659059696)
2
Q
What are the properties of a digraph?
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/391/126/790/a_image_thumb.png?1659059722)
3
Q
Searching a digraph can be implemented by means of…
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/391/126/795/a_image_thumb.png?1659059761)
4
Q
What is reachability in a digraph?
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/391/126/804/a_image_thumb.png?1659059790)
5
Q
What is strong connectivity of a digraph?
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/391/126/812/a_image_thumb.png?1659059817)
6
Q
What is topological ordering?
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/391/126/818/a_image_thumb.png?1659059868)
7
Q
What is the algorithm for Topological sorting?
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/391/126/830/a_image_thumb.png?1659059887)
8
Q
Use a queue to represent the topological sorting of this graph:
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/391/126/838/a_image_thumb.png?1659059914)