Draw a diagram of the following undirected graph: \[ V = \{a, b, c, d, e\} \] \[ E = \{(a, c), (d, a), (c, d), (a, e), (b, e)\} \] In the above graph, what is |E|?
Write the formal set-based representation for the following directed graph:
In the above graph, what is |V|?
For the following problems, refer to these two graphs G and H:
Is G acyclic?
Is there a path from 3 to 5 in G?
Is H directed?
Is (1, 2) an edge in H?
What is the degree of node 5 in G?
What is |V| in G?
What is |E| in H?
Is H strongly connected? Is H weakly connected?
Draw the adjacency matrix representation for graph G above.
Draw the adjacency list representation for graph H above.