Contact

-
Kartik Butani

 Moblie No. : 8460304360


Comments

Post a Comment

Popular posts from this blog

Greedy Prim Algorithm using c/c++

-
Greedy Prim Algorithm using c/c++ In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds 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. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex. #include<stdio.h> #include<conio.h> #include<iostream.h> enum logical {TRUE=1,FALSE=0}; struct edge {                 int from,to ;                 float cost ;                 logical rejected,selected ; }; int nv,ne; struct edge e[20...
Read more