C / C++ / MFC

#include <stdio.h><br />
#include <conio.h><br />
#include <stdlib.h><br />
#include "ReadWrite.h"<br />
#include "Graph.h"<br />
<br />
<br />
void main(int doiso, char *thamso[])<br />
{<br />
	<br />
	GRAPH G;<br />
	int rf=G.ReadData(thamso[1]);<br />
	if(!rf)<br />
		printf("Khong doc duoc file!\n");<br />
	else<br />
	{<br />
		printf("Doc duoc file!\n");<br />
		G.GraphAlgorithm();<br />
		int wf=G.WriteData(thamso[2]);<br />
		if(wf)<br />
			printf("Ghi file thanh cong!");<br />
	}<br />
<br />
	getch();<br />
}<br />

#include <stdio.h><br />
#include <conio.h><br />
#include "Graph.h"<br />
<br />
int GRAPH::ReadData(char *FileName)<br />
{<br />
	FILE *fp=fopen(FileName,"rt");<br />
	if(!fp)<br />
		return 0;<br />
	fscanf(fp,"%d",&n);<br />
	B=new unsigned char *[n];<br />
	unsigned char *temp=new unsigned char [n];<br />
	for(int d=0; d<n; d++, temp+=d)<br />
		B[d]=temp;<br />
	for(int i=0; i<n; i++)<br />
		for(int j=0; j<n; j++)<br />
			fscanf(fp,"%d",&B[i][j]);<br />
	fclose(fp);<br />
	return 1;<br />
}<br />
<br />
const int GRAPH::WriteData(char *FileName)<br />
{<br />
	FILE *fp=fopen(FileName,"wt");<br />
	if(!fp)<br />
		return 0;<br />
	fprintf(fp,"%d",n);<br />
	for(int i=0; i<n; i++)<br />
	{<br />
		fprintf(fp,"\n");<br />
		for(int j=0; j<n; j++)<br />
			fprintf(fp,"%d\t",B[i][j]);<br />
	}<br />
	<br />
	//Hien thi thong tin thuat toan tim cac thanh phan lien thong<br />
	int nLT=label;<br />
	if(nLT==1)<br />
		fprintf(fp,"\nDo thi lien thong!");<br />
	else<br />
	{<br />
		fprintf(fp,"\nDo thi khong lien thong");<br />
		fprintf(fp,"\nCo %d thanh phan lien thong:",nLT);<br />
		for(int m=1; m<=label; m++)<br />
		{<br />
			fprintf(fp,"\nMien %d: ",m);<br />
			for(int i=0; i<n; i++)<br />
				if(LabelLT[i]==m)<br />
					fprintf(fp,"%4d",i);<br />
		}<br />
	}<br />
	fclose(fp);<br />
	return 1;<br />
}<br />
<br />
void GRAPH::GraphAlgorithm()<br />
{<br />
	//~Step 1:<br />
	label=0;<br />
	LabelLT = new int[n];<br />
	for(int i=0; i<n; i++)<br />
		LabelLT[i]=0;<br />
	//~Step 2:<br />
	for(i=0; i<n; i++)<br />
		if(LabelLT[i]==0)<br />
		{<br />
			label++;<br />
			Visit(i);<br />
		}<br />
}<br />
<br />
void GRAPH::Visit(int i)<br />
{<br />
	LabelLT[i]=label;<br />
	for(int j=0; j<n; j++)<br />
		if(B[i][j]==1||B[j][i]==1)<br />
			if(LabelLT[j]==0)<br />
				Visit(j);<br />
}<br />

class GRAPH<br />
{<br />
	private:<br />
		int n;<br />
		int label;<br />
		int *LabelLT;<br />
		unsigned char **B;<br />
	public:<br />
		int ReadData(char *FileName);<br />
		const int WriteData(char *FileName);<br />
		void GraphAlgorithm();<br />
		void Visit(int i);<br />
<br />
};