Algoritma Prims

#include <iostream>
#include <stdlib.h>


/* run this program using the console pauser or add your own getch, system("pause") or input loop */

using namespace std;

class prims{
      private:

              int n;
              int graph_edge[250][4];
              int g;
              int tree_edge[250][4];
              int t;
              int s;
              int T1[50],t1;
              int T2[50],t2;
             
      public:
             void input();
             int findset(int);
             void algorithm();
             void output();
      };
     
void prims::input(){
     cout<<"Masukkan No Node : ";
     cin>>n;
     g=0;
     cout<<"Enter the weights for the following edges : \n";
     for(int i=1;i<=n;i++){
             for(int j=i+1;j<=n;j++){
                     cout<<"< "<<i<<", "<<j<<" > : ";
                     int w;
                     cin>>w;
                     if(w!=0){
                              g++;
                              graph_edge[g][1]=1;
                              graph_edge[g][2]=j;
                              graph_edge[g][3]=w;
                              }
                     }
             }
     cout<<"\n\nThe edges in the given graph are : \n";
     for(int i=1;i<=g;i++){
             cout<<"< "<<graph_edge[i][1]<<" , "<<graph_edge[i][2]<<" > : "<<graph_edge[i][3]<<endl;
             }
     }
   
int prims::findset(int x){
    for(int i=1;i<=t1;i++){
            if(x==T1[i]) return 1;
            }
    for(int i=1;i<=t2;i++){
            if(x==T2[i]) return 2;
            }
    return -1;
    }
   
void prims::algorithm(){
     t=0;
     t1=1;
     T1[1]=1;
     t2=n-1;
     int i;
     for(i=1;i<=n;i++){
                       T2[i]=i+1;
                       }
     cout<<"\nThe Algorithm starts\n\n";
     while(g!=0 && t!=n-1){
                int min=9999;
                int p;
                int u,v,w;
                for(int i=1;i<=g;i++){
                        bool flag1 = false, flag2 = false;
                        if(findset(graph_edge[i][1])!=findset(graph_edge[i][2])){
                                 if(min>graph_edge[i][3]){
                                 min=graph_edge[i][3];
                                 u=graph_edge[i][1];
                                 v=graph_edge[i][2];
                                 w=graph_edge[i][3];
                                 p=i;
                                 }
                                 }
                  }
                cout<<"The edge include in the tree is : ";
                cout<<"< "<<u<<", "<<v<<" >\n";
               
                for(int l=p;l<g;l++){
                        graph_edge[l][1]=graph_edge[l+1][1];
                        graph_edge[l][2]=graph_edge[l+1][2];
                        graph_edge[l][3]=graph_edge[l+1][3];
                        }
                g--;
                t++;
                tree_edge[t][1]=u;
                tree_edge[t][2]=v;
                tree_edge[t][3]=w;
                t++;
               
                int m;
                if(findset(v)==2){
                                  T1[t1]=v;
                                  m=v;
                                  }
                else if(findset(u)==2){
                     T1[t1]=u;
                     m=u;
                     }
                int x;
                for(x=1;T2[x]!=m;x++){
                                       for(;x<t2;x++){
                                                      T2[x]=T2[x+1];
                                                      }
                                       }
                                       t2--;
                int k;
                cout<<"NOW\nT1 : ";
                for(k=1;k<=t1;k++) cout<<T1[k]<<" ";
                cout<<endl;
                cout<<"T2 : ";
                for(k=1;k<=t2;k++) cout<<T2[k]<<" ";
                cout<<endl;
               
                cout<<"The graph edges are : \n";
                for(int i=1;i<=g;i++){
                        cout<<"< "<<graph_edge[i][1]<<", "<<graph_edge[i][2]<<" > : "<<graph_edge[i][3]<<endl;
                        }
                cout<<"\n\n";
                }
     }
   
void prims::output(){
     cout<<"\nThe selected edges are : \n";
     for(int i=1;i<=t;i++){
             cout<<"< "<<tree_edge[i][1]<<", "<<tree_edge[i][2]<<" > : "<<tree_edge[i][3]<<endl;
             }
     }

int main(int argc, char *argv[])
{
    awal:
    prims dyas;
    dyas.input();
    dyas.algorithm();
    dyas.output();
   
    char L;
    cout<<"\n\nLanjut? : ";
    cin>>L;
    if(L=='y') {
               system("cls");
               goto awal;
               }
   
    system("PAUSE");
    return EXIT_SUCCESS;
}

Mencari Nilai Tertinggi

#include<conio.h>
#include<stdio.h>
#include<iostream.h>

main(){
int a[3];


   for (int i=0;i<3;i++){
    cout<<"Masukkan angka "<<i+1<<" : ";
    cin>>a[i];
   }
   int x;
   for (int i=0;i<2;i++)
    for (int j=i+1;j<3;j++){
    if (a[i]>a[j]){
          x=a[i];
            a[i]=a[j];
            a[j]=x;
         }
    }

   cout<<"\nTertinggi : "<<a[2];
   cout<<"\nTengah : "<<a[1];
   cout<<"\nTerendah : "<<a[0];

getche();//header conio.h
}



Sumber : http://ilmusayabagi.blogspot.com/2013/03/c-mencari-nilai-tertinggi.html

Mengurutkan NIlai Terkecil ke Terbesar

#include<conio.h>
#include<stdio.h>
#include<iostream.h>

main(){
int a[50],jml;

   cout<<"Masukkan jumlah data : ";
   cin>>jml;

   for (int i=0;i<jml;i++){
    cout<<"Masukkan angka "<<i+1<<" : ";
    cin>>a[i];
   }

   int x;
   for (int i=0;i<jml-1;i++)
    for (int j=i+1;j<jml;j++){
    if (a[i]>a[j]){
          x=a[i];
            a[i]=a[j];
            a[j]=x;
         }
    }

   for (int i=0;i<jml;i++){
    cout<<a[i]<<" ";
   }

getche();//header conio.h
}

Mencari Bilangan Terbesar

#include <cstdlib>
#include <iostream>

using namespace std;
void CariElemenTerbesar(int a[], int &maks){
     int k,n;
     maks = a[0];
     n = sizeof (a);
     for(k=2;k<=n;k++){
                       if (a[k] > maks){
                               maks = a[k];
                               }
                       }
     }
int main(int argc, char *argv[])
{
    int maks;
    int a[]={7,6,13,10,8,9};
    CariElemenTerbesar(a,maks);
    cout<<endl<<maks<<endl;
    system("PAUSE");
    return EXIT_SUCCESS;
}

Mencari bilangan pangkat

#include <cstdlib>
#include <iostream>

using namespace std;
int pangkat (int a, int n)
{
      int k, hasil;
      hasil=1;
      for (k=1; k<=n; k++){
            hasil *= a;
            }
            return hasil;
      }     

int main(int argc, char *argv[])
{
    cout<<pangkat(2,3)<<endl;
    system("PAUSE");
    return EXIT_SUCCESS;
}

Raisa Teka_Teki

Raisa Teka-Teki

 Mp3 Info :

Artist : Raisa (Raisa Teka Teki)
Title : Teka Teki
Album : Singgle Oktober 2014
Genre : Pop

Download lagunya Raisa Teka-Teki !!

Geisha Setengah Hatiku Tertinggal

Geisha setengah hatiku tertinggal

Download lagu Geisha setengah hatiku tertinggal.mp3
Mp3 Info :
Artist : Geisha (Bersinar Terang (2014))
Title : Setengah Hatiku Tertinggal
Album : Bersinar Terang (2014)
Genre : Pop