Both the depth-first and breadth-first traversals process disjoint graphs. Write an algorithm that traverses a graph and returns true if the graph is connected and false if it is disjoint.  Write an...

Both the depth-first and breadth-first traversals process disjoint graphs. Write an algorithm that traverses a graph and returns true if the graph is connected and false if it is disjoint.

 Write an algorithm that determines whether there is at least one arc pointing to a specified vertex. (Hint: This is a very simple algorithm.)