Lab 11: Graphs  

• Download the following files:
  • ListGraph.java
  • GraphEdge.java
  • TestLGraph.java

• Study the ListGraph implementation of a directed weighted graph in ListGraph.java and the class GraphEdge.java.
• Add the following methods to the class ListGraph
  • getEdgeWeight(int s, int d) returns the weight of the directed edge from s to d.
  • toAdjMatrix() returns the adjacency matrix representation of the graph.
• Add the following constructor
  • public ListGraph (int numVertices, int type) which creates empty graph (no edges) with numVertices nodes if the type is 0, complete graph if the type is 1 and ring graph if the type is 2.

>java TestLGraph

Graph G:
0: (1, 5) (2, 3) (3, 2) (4, 1)
1: (0, 1) (2, 2) (3, 1) (4, 5)
2: (0, 2) (1, 1) (3, 2)
3: (0, 3) (4, 2)
4: (0, 1) (1, 2)

Matrix representation of G

0 5 3 2 1
1 0 2 1 5
2 1 0 2 0
3 0 0 0 2
1 2 0 0 0
Complete graph:

0: (1, 5) (2, 0) (3, 4) (4, 5)
1: (0, 2) (2, 0) (3, 3) (4, 6)
2: (0, 6) (1, 3) (3, 6) (4, 1)
3: (0, 2) (1, 4) (2, 1) (4, 0)
4: (0, 2) (1, 8) (2, 5) (3, 4)

Ring graph:
0: (1, 3)
1: (2, 6)
2: (3, 5)
3: (4, 5)
4: (0, 4)

empty graph:
0:
1:
2:
3:
4: