logo CodeStepByStep logo

graphPropertiesExam2

Language/Type: C++ graphs graph properties

Consider the following crudely-drawn graph, and answer the following questions about it:

             13
    +--- B ------> C <--+
   1|    |         ^    |
    |    |         |    |3
    V    |         |    |
    A  6 |       8 |    D
    |    |         |    ^
    |    |         |    |
   2|    V         |    |2
    +--> E ------> F ---+
              4
Is the graph connected?
Is the graph cyclic?
What vertex has the highest in-degree, and what is its in-degree? (e.g. "A 5")

You must log in before you can solve this problem.

Log In

Need help?

Stuck on an exercise? Contact your TA or instructor.

If something seems wrong with our site, please

Is there a problem? Contact us.