Problem Statement:

You have a business with several offices; you want to lease phone lines to connect them up
with each other; and the phone company charges different amounts of money to connect
different pairs of cities. You want a set of lines that connects all your offices with a minimum
total cost. Solve the problem by suggesting appropriate data structures.

Code:

 ``` 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255``` ```//============================================================================ // Name : PhoneGraph.cpp // Author : VNKDJ5 // Version : 3 // Copyright : way2techin.blogspot.com //PROBLEM: You have a business with several offices; you want to lease phone lines //to connect them up with each other; and the phone company charges different //amounts of money to connect different pairs of cities. You want a set of lines //that connects all your offices with a minimum total cost. Solve the problem by // suggesting appropriate data structures. //============================================================================ #include #include using namespace std; const int MAX=10; class EdgeList; //forward declaration class Edge //USED IN KRUSKAL { int u,v,w; public: Edge(){} //Empty Constructor Edge(int a,int b,int weight) { u=a; v=b; w=weight; } friend class EdgeList; friend class PhoneGraph; }; //---- EdgeList Class ---------- class EdgeList { Edge data[MAX]; int n; public: friend class PhoneGraph; EdgeList() { n=0;} void sort(); void print(); }; //----Bubble Sort for sorting edges in increasing weights' order ---// void EdgeList::sort() { Edge temp; for(int i=1;idata[j+1].w) { temp=data[j]; data[j]=data[j+1]; data[j+1]=temp; } } void EdgeList::print() { int cost=0; for(int i=0;i>data[i][j]; } } void PhoneGraph::printGraph() { cout<<"\nAdjacency (COST) Matrix: \n"; for(int i=0;i>vertices; PhoneGraph p1(vertices); p1.readgraph(); do { cout<<"\n1.Find Minimum Total Cost(By Prim's Algorithm)" <<"\n2.Find Minimum Total Cost(by Kruskal's Algorithms)" <<"\n3.Re-Read Graph(INPUT)" <<"\n4.Print Graph" <<"\n0. Exit" <<"\nEnter your choice: "; cin>>choice; switch(choice) { case 1: cout<<" Minimum cost of Phone Line to cities is: "<

Output: