C++ help!!! 1. A vertex which has incoming edges from all vertices and has no ou

ID: 3570647 • Letter: C

Question

C++ help!!!

1. A vertex which has incoming edges from all vertices and has no outgoing edges is called a Universal sink.

2. Write a function that returns true if there is a Universal sink in a graph, false otherwise.

3. Write a function that return true if a graph is connected, false otherwise.

4. Write a function that return true if a graph is complete, false otherwise.

5. Write a function that deletes a vertex from a graph (clearly, you must delete all incoming/outgoing edges as well !)

6. Write a function that returns true if there is at least one vertex that is not reachable

// step 2 int candidate = 0; for(int i=1; i

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.