Practice Types Of Edges In Directed Graphs (22.4.2.1)

Practise this section

9 questions

Flashcard drill
5 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is a directed graph?
Show hintHide hint
Think about how edges connect the vertices.
Question 2.
Define a backward edge.
Show hintHide hint
It 'backs' up the tree.
3Question 3.
What type of edge connects a vertex to one of its descendants in a DFS tree?
- Tree Edge
- Forward Edge
- Backward Edge
Show hintHide hint
This edge helps in traversing downward.
4Question 4.
If a traversal reveals a backward edge, what does this indicate?
- True
- False
Show hintHide hint
Think about the relationship to ancestors.
Question 5.
Create your own directed graph with at least 6 vertices, and label all edge types found in a DFS traversal. Identify any cycles.
Show hintHide hint
Draw the graph and trace your DFS path!
Question 6.
Given a directed graph, how can you determine the number of strongly connected components? Write a pseudocode for this process.
Show hintHide hint
Think about how you can utilize DFS both ways to uncover hidden connections.

5 more questions in this section. Enroll free to practise them all.