PHP Mysql table preview without column names.

Chestia asta preia din orice tabela mai intai header-ul, apoi toate inregistrarile si le afiseaza intr-un tabel.

Este foarte potrivita pentru o afisare a bazei de date pentru ca nu trebuie sa mai scrieti peste tot $rand['nume' ,$rand['prenume....etc...

 

Modificati-o pentru a fi compatibila cu cerintele voastre. Sau numele campului ce selecteaza tabelul din Baza de date sa se numeasca "t".

 

 

$_SESSION['table']=$_POST['t'];
$tabel=$_SESSION['table'];
$result = mysqli_query($_SESSION['con'],"SELECT * FROM $tabel");
$e = mysqli_num_fields($result);

 

echo "<table border='1'>";
$i = 0;
echo "<tr>";   
while($i<$e)
{
$meta=mysqli_fetch_field($result);

 

  echo "<th>".$meta->name."</th>";
$i++;
}
echo "</tr>";

 

while($row = mysqli_fetch_array($result))
{
echo "<tr>";
for($i=0;$i<$e;)
{
echo "<td>" . $row[$i] . "</td>";
$i++;
}
echo "</tr>";
}
echo "</table>";

Prim Algorithm C++ Language

#include<iostream.h>
#include<conio.h>
#include<fstream.h>
#include<stdio.h>
int main()
{
int i,j,n,x;
FILE *in,*out;
in=fopen("in.txt","r");
out=fopen("out.txt","w");
fscanf(in,"%d",&n);
fscanf(in,"\n");
int c[10][10],ni[10];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fscanf(in,"%d",&c[i][j]);
fscanf(in,"\n");
}
cout<<"Date initiale:"<<endl;
fprintf(out,"Date initale:\n");
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(c[i][j]>0)
{
cout<<i<<"--"<<j<<" cost ="<<c[i][j]<<endl;
fprintf(out,"%d--%d cost=%d\n",i,j,c[i][j]);
}
int nr[10];
for(i=1;i<=n;i++)
{
nr[i]=0;
for(j=1;j<=n;j++)
if(c[i][j]!=0)
nr[i]++;
}
int max=ni[1],init;
cout<<"Nodul de plecare:";cin>>init;
for(i=1;i<=n;i++)
if(nr[i]>max)
{
init=1;
max=nr[i];
}
cout<<endl<<"Nodul initial:"<<init<<endl;
fprintf(out,"Nodul initial:%d\n",init);
ni[1]=init;
int nrn=1,cf=0;
cout<<endl<<"Arborele de cost minim:"<<endl;
fprintf(out,"Arborele de cost minim:\n");
do {
int min=0,x=0,y=0;
for(i=1;i<=nrn;i++)
{
for(j=1;j<=n;j++)
{
if(c[ni[i]][j]!=0 && min==0)
{
min=c[ni[i]][j];
y=j;
x=i;
continue;
}
if(c[ni[i]][j]!=0 && c[ni[i]][j]<min)
{
min=c[ni[i]][j];
y=j;
x=i;
}
}
}
if(min>0)
{
cout<<ni[x]<<"--"<<y<<" cost="<<c[ni[x]][y]<<endl;
fprintf(out,"%d--%d cost=%d\n",ni[x],y,c[ni[x]][y]);
cf+=c[ni[x]][y];
for(i=1;i<=nrn;i++)
{
c[ni[i]][y]=0;
c[y][ni[i]]=0;
}
nrn++;
ni[nrn]=y;
}
} while(nrn<n);
cout<<"Cost final="<<cf;
fprintf(out,"cost final=%d",cf);
fclose(in);
fclose(out);
getch();
return 0;
}

Kruskal Algorithm C Language

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

int i,j,k,a,b,u,v,n,ne=1;
int min,mincost=0,cost[9][9],parent[9];
int find(int);
int uni(int,int);
void main()
{

FILE *in;
in=fopen("in.txt","r");

fscanf(in,"%d",&n);
clrscr();
for(i=1;i<=n;i++)

for(j=1;j<=n;j++)
{

fscanf(in,"%d",&cost[i][j]);
//if(cost[i][j]==0)
// cost[i][j]=999;

}

while(ne<n)
{
for(i=1,min=999;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(cost[i][j]<min)
{
min=cost[i][j];
a=u=i;
b=v=j;
}
}
}
u=find(u);
v=find(v);
if(uni(u,v))
{
printf("\n%d edge (%d,%d) =%d\n",ne++,a,b,min);
mincost +=min;
}
cost[a][b]=cost[b][a]=999;
}
printf("\n\tMinimum cost = %d\n",mincost);
getch();
}
int find(int i)
{
while(parent[i])
i=parent[i];
return i;
}
int uni(int i,int j)
{
if(i!=j)
{
parent[j]=i;
return 1;
}
return 0;

}