337 views
0 votes
0 votes

a) How many strongly connected components are in the following directed graph?

b) What is a potential application of strongly connected components in a directed graph?

c) After finding Strongly Connected Components in a directed graph, we realize that we added one edge too many. We would therefore like to delete this extra edge. Give an example of how deleting this extra edge can change the number of strongly connected components.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
3
zshaikh asked May 10, 2023
229 views
For the following regular expression:a+|(ab)+Over the alphabet:{a,b}Give an epsilon-NFA that recognizes the same language.
3 votes
3 votes
6 answers
4
jaiganeshcse94 asked Jul 27, 2016
5,050 views
A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}?