logo CodeStepByStep logo

graphPropertiesExam1

Language/Type: C++ graphs graph properties
Author: Marty Stepp (on 2016/06/16)

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

     6       2
 A <---> B <---- C
 |       |       |
2|       |1      |1
 |       |       |
 V   8   V   2   V
 E ----> F <---- G
 |       ^       |
3|       |2      |5
 |       |       |
 V   1   |   1   V
 H ----> I ----> J
Is the graph directed or undirected?
Is the graph weighted or unweighted?
Is the graph connected?
Is the graph cyclic?
What are the in-degree and out-degree of vertex A (as two integers, separated by spaces)?
What are the in-degree and out-degree of vertex B?
What are the in-degree and out-degree of vertex C?
What are the in-degree and out-degree of vertex E?
What are the in-degree and out-degree of vertex F?
What are the in-degree and out-degree of vertex G?
What are the in-degree and out-degree of vertex H?
What are the in-degree and out-degree of vertex I?
What are the in-degree and out-degree of vertex J?
Write the order that a depth-first search (DFS) would visit vertexes if it were looking for a path from vertex A to vertex I. Assume that any "for-each" loop over neighbors returns them in ABC order. Write the vertex names in order, separated by commas.
Write the path that such a DFS would return.
Write the order that a breadth-first search (BFS) would visit vertexes if it were looking for a path from vertex C to vertex H. Assume that any "for-each" loop over neighbors returns them in ABC order. Write the vertex names in order, separated by commas.
Write the path that such a BFS would return.

You must log in before you can solve this problem.


Log In

Need help?

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.

© Marty Stepp, all rights reserved.