This post is completed by 3 users

Add to List 
270. Weighted Graph Implementation – JAVA
We have already discussed about Graph basics. We recommend reading this before you continue to read this article.
What is Weighted Graph?
A Graph is called weighted graph when it has weighted edges which means there are some cost associated with each edge in graph.
Example:
Implementation:
 Each edge of a graph has an associated numerical value, called a weight.
 Usually, the edge weights are nonnegative integers.
 Weighted graphs may be either directed or undirected.
 The weight of an edge is often referred to as the "cost" of the edge.
 Will create an Edge class to put weight on each edge
Output:
vertex0 is connected to 2 with weight 3 vertex0 is connected to 1 with weight 4 vertex1 is connected to 2 with weight 5 vertex1 is connected to 3 with weight 2 vertex2 is connected to 3 with weight 7 vertex3 is connected to 4 with weight 2 vertex4 is connected to 5 with weight 6 vertex4 is connected to 1 with weight 4 vertex4 is connected to 0 with weight 4
Reference: here