Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
Question
Book Icon
Chapter 29.4, Problem 29.4.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) };

Prim’s Algorithm:

Prim’s Algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph by finding a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.

Time Complexity of Prim’s algorithm:

Prim’s Algorithm Steps using adjacency matrix to store the weighted edges:

Step 1: Select a random vertex v, add v to S, assign an array A where A[i] = d{v, i}

Step 2:  While there are vertices that belong to G and not to S do:

2.1. Iterate through A, select the minimum value A[i], add vertex i to S

2.2. for each edge e={i, j} connected to vertex i do:

2.2.1. if d{i, j} < A[j] then A[j] = d{i ,j}

Given Graph:

Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition), Chapter 29.4, Problem 29.4.1CP

Blurred answer
Students have asked these similar questions
Apply Prim's algorithm or Kruskal's algorithm or Borvuka's algorithm to find the minimum spanning tree for the following graph. Illustrate the algorithm stepwise while applying it on the graph. |1
Write a program that creates the minimum spanning tree for the graph
Apply Kruskal's algorithm to find a minimum spanning tree of the following graph. You need to do it step by step. Answer: here a 5 b () 3 1 d 4 C 2 6 e
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education