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);

Question

Want to see the full answer?

Answer 1

Question

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);

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

void listEmployees (void) { for (int i=0; i 10000. Make a guess about why the comparison function takes 2 struct Employee parameters (as opposed to struct Employee *) **

Given the following C code: struct Node int data; struct Node struct Node next; prev; struct Node head; void funx ( ) if (head==NULL) return; struct Node current=head; while (current->next!=NULL) current=current-->next; while (current!=NULL) printf("&d ", current->data; current=current->prev; What is the functionality of this function? a) Print the contents of linked list b) Print the contents of linked list in reverse order c) None

//give the output of the following program and draw the link list. struct node{ int info; struct node *link;};typedef struct node *nodePTR;void insort(nodePTR*,struct Info);nodePTR getnode();int main(void){nodePTR p=NULL,head=NULL,save;inti; for(i=0;i<3;i++){ insort (&head,i+5);}save=head;do{ printf("%d",save->info); save=save->link;}while(save!=NULL); return0;}nodePTR getnode(){nodePTR q;q=(nodePTR)malloc(sizeof(struct node));return q;}void insort(NODEPTR *head , int x){ NODEPTR p,q,r; q=NULL; for(p=*head; p!=NULL &&x>p->info; p=p->link) q=p; if(q=NULL) { p=getnode(); p->info=x; p->link=head; head=p; }else{ r=getnode(); q->link=r; r->info=x; r->link=p; }}