Chapter 29.3, Problem 29.3.1CP

Program Plan Intro

Weighted Graph:

A graph is termed as weighted graph if each edge of the graph is assigned a weight. The weighted edges stored in the weighted graphs can be stored in adjacency lists.

Weighted edges can be represented using a two-dimensional array. An weighted edge can be represented as “WeightedEdge(u,v,w)”, where “u” and “v” are edges and “w” represents the weight between them.

Example of storing edge in a weighted graph:

Object[][] edges =

{ new Integer(0), new Integer(1), new SomeTypeForWeight(8) };

Program:

PriorityQueue<WeightedEdge> q = new PriorityQueue<>();

q.offer(new WeightedEdge(1, 2, 3.5));

q.offer(new WeightedEdge(1, 6, 6.5));

q.offer(new WeightedEdge(1, 7, 1.5));

System.out.println(q.poll().weight);

System.out.println(q.poll().weight);

System.out.println(q.poll().weight);