Graphs II: Basic Algorithms :

Introduction

•  Assume, in a country, there are many oil wells. It is necessary to connect them by a pipeline. Main objective of         designing should be minimization of total cost of laying pipeline.
• This problem can be modeled as a graph problem. The set of oil wells are represented by vertices. The pipeline    between any pair of oil wells is corresponding to the edge between the vertices denoting these oil wells.
• The cost of laying a pipeline between a pair of oil wells is the weight of the edge joining these oil wells.
• Consider the following example of five oil wells. The weight on the edges denotes the cost of the laying pipeline       between their respective oil wells.