A spanning tree of a graph is a tree with that always has which of the following properties?
a) It includes some of the edges and some of the vertices of the graph.
b) It includes all of the edges and some of the vertices of the graph.
c) It includes some of the edges and all of the vertices of the graph.
d) It includes all of the edges and all of the vertices of the graph.
e) none of the above
c) It includes some of the edges and all of the vertices of the graph.
You might also like to view...
What term is given to the current location of a process?
What will be an ideal response?
An integer is said to be prime if it is divisible by only 1 and itself. For example, 2, 3, 5 and 7 are prime, but 4, 6, 8 and 9 are not.
a) Write a function that determines whether a number is prime. b) Use this function in a script that determines and prints all the prime numbers between 1 and 10,000. How many of these 10,000 numbers do you really have to test before being sure that you have found all the primes? Display the results in a