0
/ 10
A graph with relatively few edges is called:
Search Results
Searching for: graphs
Individual Exercises
0
/ 10
A graph with many edges is called:
0
/ 10
A graph that does not have a path of length 3 or more that connects a node v to itself is:
0
/ 10
A directed graph is one
0
/ 10
A complete graph is one which each pair of vertices:
0
/ 10
A DAG is:
0
/ 10
The sequence of vertices v1...vn with edges connecting all the vertices is called:
0
/ 10
Trees and lists are special cases of graphs.
0
/ 10
Based on the adjacency matrix shown below, which of the following statements is true:
0
/ 10
The adjacency matrix shown below is an accurate representation of the graph shown below.
0
/ 10
On a breadth first search traversal of the graph shown below, and starting at node a, the first three nodes visited are:
0
/ 10
On a depth first search traversal of the graph shown below, and starting at node a, the first three nodes visited are:
0
/ 15
You have created an adjacency matrix with enough space to store the distances between May Tricks' magic shops. Now it is time to enter...
0
/ 90
Given is an adjacency matrix and a starting index.
Complete the breadth first traversal method. Comments noted with //_________________...
0
/ 20
May Tricks owns a chain of magic shops. She hands you a list of her store locations and asks you to find a way of quickly looking up the...
0
/ 90
Given is an adjacency matrix and a starting index.
Complete the depth first traversal method. Comments noted with //_________________ are...
0
/ 50
Given is the number of edges and vertices in a directed graph. Using this information return the density of the graph.
Number of possible...
0
/ 15
As a wild publicity stunt May Tricks has made her Middletown store disappear! You have no idea how she did this or if the store will ever...
0
/ 20
Since May Tricks has proved to be a very unpredictable client you have decided to take extra precautions. By creating a remove vertex...