|
/* Graph.h */
#ifndef __GRAPH_H__
#define __GRAPH_H__
#include<iostream>
#include<string>
#include<fstream>
#define value_type char //图顶点的数据类型
#define weight_vaule_type int
#define max_weight_value_type 0x7FFFFFFF //默认int类型是signed int
//图中邻接矩阵都是动态申请空间
using namespace std;
namespace meihao
{
static bool graph_error = false;
class Graph
{
public:
Graph(const string& fileName):_vertexNum(0)
,_vertex(nullptr)
,_arc(nullptr)
{
readGraphFromFile(fileName);
}
~Graph();
void printVertexMatrix()const;
void printGraphEdgeMatrix()const;
int getGraphVertexNumber()const;
weight_vaule_type getGraphEdgeWeight(int vi,int vj)const;
value_type getGraphVertexData(int vi)const; //获取第vi个顶点的值
int setGraphEdgeWeight(int vi,int vj,int weight); //修改边的权值
int getOutDegree(int vi)const; //获取某一个顶点的出度
int getInputDegree(int vi)const; //获取某一个顶点的入度
protected:
void readGraphFromFile(const string& fileName);
void writeGraphFromFile(const string& fileName);
private:
int _vertexNum; //图的顶点数
value_type* _vertex; //顶点数组
weight_vaule_type** _arc; //邻接矩阵,边数组
};
};
#endif
/* mainfunc.cpp */
#include"Graph.h"
int main()
{
meihao::Graph g("data.txt");
cout<<"图顶点数："<<g.getGraphVertexNumber()<<endl;
cout<<"图顶点矩阵："<<endl;
g.printVertexMatrix();
g.printGraphEdgeMatrix();
cout<<"点A的入度："<<g.getInputDegree(0)<<endl;
cout<<"点A的出度："<<g.getOutDegree(0)<<endl;
cout<<"(A,C)="<<g.getGraphEdgeWeight(1,2)<<endl;
cout<<"set <C,D> =5"<<endl;
g.setGraphEdgeWeight(2,3,5);
cout<<"(C,D) ="<<g.getGraphEdgeWeight(2,3)<<endl;
system("pause");
}
/* data.txt */
4
A B C D
0 1 1 1
1 0 1 0
1 1 0 1
1 0 1 0
运行结果：
//文件目录结构
|
/* Graph.cpp */
#include"Graph.h"
namespace meihao
{
void Graph::readGraphFromFile(const string& filename)
{
ifstream ifs(filename.c_str(),ios::in|ios::out); //打开文件，可读可写
if(ifs.bad())
{
cout<<"read file data init Graph failure!"<<endl;
return ;
}
ifs>>_vertexNum;
_vertex = new value_type[_vertexNum]();
for(int idx=0;idx!=_vertexNum;++idx) //初始化顶点数组
ifs>>_vertex[idx];
//动态开辟二维数组的内存空间
_arc = new weight_vaule_type*[_vertexNum]();
for(int idx=0;idx!=_vertexNum;++idx)
{
_arc[idx] = new weight_vaule_type[_vertexNum]();
}
//初始化边数组，邻接矩阵
for(int idx=0;idx!=_vertexNum;++idx)
{
for(int iidx=0;iidx!=_vertexNum;++iidx)
{
ifs>>_arc[idx][iidx];
}
}
ifs.close();
}
void Graph::writeGraphFromFile(const string& fileName)
{
ofstream ofs(fileName.c_str(),ios::out);
if(ofs.bad())
{
cout<<"write file Graph failure!"<<endl;
return ;
}
//写顶点数
ofs<<_vertexNum<<endl;
//写顶点数组
for(int idx=0;idx!=_vertexNum;++idx)
{
ofs<<_vertex[idx]<<" ";
}
ofs<<endl;
//写邻接矩阵
for(int idx=0;idx!=_vertexNum;++idx)
{
for(int iidx=0;iidx!=_vertexNum;++iidx)
{
ofs<<_arc[idx][iidx]<<" ";
}
ofs<<endl;
}
ofs<<endl;
}
void Graph::printVertexMatrix()const
{
for(int idx=0;idx!=_vertexNum;++idx)
{
cout<<_vertex[idx]<<" ";
}
cout<<endl;
}
void Graph::printGraphEdgeMatrix()const
{
for(int idx=0;idx!=_vertexNum;++idx)
{
for(int iidx=0;iidx!=_vertexNum;++iidx)
{
cout<<_arc[idx][iidx]<<" ";
}
cout<<endl;
}
cout<<endl;
}
int Graph::getGraphVertexNumber()const
{
return _vertexNum;
}
value_type Graph::getGraphVertexData(int vi)const
{
return _vertex[vi];
}
weight_vaule_type Graph::getGraphEdgeWeight(int vi,int vj)const
{
if(vi<0||vj<0||vi==vj||vi>=_vertexNum||vi>=_vertexNum)
{
graph_error = true;
return -1; //因为图的权值可以是负数，为了区分，就拿一个bool变量来标记什么情况下-1表示出错了
}
return _arc[vi][vj];
}
int Graph::setGraphEdgeWeight(int vi,int vj,weight_vaule_type weight)
{
if(vi<0||vj<0||vi==vj||vi>=_vertexNum||vi>=_vertexNum||weight>max_weight_value_type)
{
graph_error = true;
return -1;
}
_arc[vi][vj] = weight;
writeGraphFromFile("data.txt");
}
int Graph::getOutDegree(int vi)const
{
if(vi<0||vi>=_vertexNum)
{
graph_error = true;
return -1;
}
int OD = 0;
for(int idx=0;idx!=_vertexNum;++idx)
OD += _arc[vi][idx];
return OD;
}
int Graph::getInputDegree(int vi)const
{
if(vi<0||vi>=_vertexNum)
{
graph_error = true;
return -1;
}
int ID = 0;
for(int idx=0;idx!=_vertexNum;++idx)
ID += _arc[idx][vi];
return ID;
}
Graph::~Graph()
{
if(nullptr!=_vertex)
{
delete []_vertex;
_vertex = nullptr;
}
if(nullptr!=_arc)
{
for(int idx=0;idx!=_vertexNum;++idx)
delete []_arc[idx];
delete []_arc;
_arc = nullptr;
}
}
};
|
