Each edge is associated with two vertices. The order of the two connected vertices is unimportant. If the graph contains n vertices, then the grid contains n rows and n columns. Edge lists and Edge set A directed graph with n vertices can be represented by n different linked lists. List number i provides the connections for vertex i.
Adjacency matrix is a waste.
Information is stored in the vertices. The information stored in a vertex is called the vertex's label. Initialize a Graph with n vertices, no edges, and null labels. Generate a copy of this Graph. Static method to print the labels of a graph with a depth-first search.