When do you say that a digraph is acyclic
A)if and only if its first search does not have back arcs
B)a digraph is acyclic if and only if its first search does
not have back vertices
C)if and only if its first search does not have same
dfnumber
D)None of these
Answer Posted / liamsi422
i
| Is This Answer Correct ? | 1 Yes | 1 No |
Post New Answer View All Answers
What is a lookup table in c?
What are the types of type qualifiers in c?
How is a structure member accessed?
How to get string length of given string in c?
Write a program to display all the prime nos from 1 to 1000000, your code should not take time more than a minute to display all the nos.
What is the value of h?
Why doesn't C support function overloading?
Explain the binary height balanced tree?
Why c is called procedure oriented language?
Is c dynamically typed?
What is the acronym for ansi?
What is %g in c?
What is enumerated data type in c?
What is a void pointer? When is a void pointer used?
What is static memory allocation?