msksbr/data-structures-and-algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

邻接矩阵类写完基础功能，邻接表类修复已存在连接判断bug

Browse Source
This commit is contained in:
御坂スバル
2024-12-06 01:12:57 +08:00
parent b8cde94091
commit 80e8826057
4 changed files with 136 additions and 62 deletions
Download Patch File Download Diff File Expand all files Collapse all files
homework5/ListGraph.h
+58 -49
View File
@@ -1,7 +1,4 @@
//
// Created by 31416 on 24-12-4.
//
// 邻接表类
#ifndef LIST_GRAPH_H
#define LIST_GRAPH_H
@@ -28,95 +25,107 @@ using namespace std;
template<typename T>
class ListGraph {
private:
struct node{
struct node {
T data;
T weight;
struct node* next;
struct node *next;
};
vector<node*> nodes;
bool flag; //定义是否有向
bool isWeighted; //定义是否有权
vector<node *> nodes;
bool flag; //定义是否有向
bool isWeighted; //定义是否有权
public:
ListGraph(bool flag=false,bool isWeighted=false) {
ListGraph(bool flag = false, bool isWeighted = false) {
nodes.clear();
flag = false;
isWeighted = false;
this->flag = flag;
this->isWeighted = isWeighted;
}
void insert(T data) {
node* insert = new node();
insert->data=nodes.size();
node *insert = new node();
insert->data = nodes.size();
insert->weight = 0;
insert->next=new node();
insert->next->data=data;
insert->next->next=NULL;
insert->next = new node();
insert->next->data = data;
insert->next->next = NULL;
nodes.push_back(insert);
}
void connect(int id1,int id2,T weight=0) { //flag区分是否为有向图
if ((id1>nodes.size()-1||id2>nodes.size()-1)||(id1<0)||(id2<0)) {
throw NodeIdOutOfRangeException("您提供的id超出范围",0X002);
void connect(int id1, int id2, T weight = 0) {
//flag区分是否为有向图
if ((id1 > nodes.size() - 1 || id2 > nodes.size() - 1) || (id1 < 0) || (id2 < 0)) {
throw NodeIdOutOfRangeException("您提供的id超出范围", 0X002);
}
if(id1==id2) {
throw SameNodeConnectException("禁止连接图中的同一个点",0x001);
if (id1 == id2) {
throw SameNodeConnectException("禁止连接图中的同一个点", 0x001);
}
node *current = nodes.at(id1);
//跳过id节点和值节点
for(int i=0;i<1;i++) {
for (int i = 0; i < 1; i++) {
current = current->next;
}
while(current->next!=NULL) {
if(current->next->data==id2) {
if (current->next->weight==weight) {
throw InsertExistedConnectException("禁止插入已存在的连接",0x003);
while (current->next != NULL) {
if (current->next->data == id2) {
if (current->next->weight == weight) {
throw InsertExistedConnectException("禁止插入已存在的连接", 0x003);
}
current->next->weight=weight;
current->next->weight = weight;
if (!flag) {
node *current2 = nodes.at(id2);
while (current2->next != NULL) {
current2 = current2->next;
}
current2->next->weight = weight;
}
return;
}
current = current->next;
}
current->next=new node();
current->next->data=id2;
current->next = new node();
current->next->data = id2;
current->next->weight = weight;
current->next->next=NULL;
current->next->next = NULL;
if (!flag) {
node *current2 = nodes.at(id2);
while(current2->next!=NULL) {
while (current2->next != NULL) {
current2 = current2->next;
}
current2->next=new node();
current2->next->data=id1;
current2->next = new node();
current2->next->data = id1;
current2->next->weight = weight;
current2->next->next=NULL;
current2->next->next = NULL;
}
}
string to_string() {
stringstream ss;
for (int i=0;i<=nodes.size()-1;i++) {
node* current = nodes.at(i);
while(current!=NULL) {
if(current->next==NULL) {
for (int i = 0; i <= nodes.size() - 1; i++) {
node *current = nodes.at(i);
while (current != NULL) {
if (current->next == NULL) {
if (isWeighted) {
ss<<current->data<<"|"<<current->weight;
ss << current->data << "|" << current->weight;
} else {
ss << current->data;
}
else {
ss<<current->data;
}
}else {
if (isWeighted){
ss<<current->data<<"|"<<current->weight<<" ";
}
else {
ss<<current->data<<" ";
} else {
if (isWeighted) {
ss << current->data << "|" << current->weight << " ";
} else {
ss << current->data << " ";
}
}
current = current->next;
}
ss<<endl;
ss << endl;
}
return ss.str();
}
vector<T> BFS(int startId) {
if (startId >= nodes.size() || startId < 0) {
throw NodeIdOutOfRangeException("起始节点id超出范围", 0X004);
@@ -134,7 +143,7 @@ public:
q.pop();
result.push_back(currentId);
node* current = nodes.at(currentId);
node *current = nodes.at(currentId);
// 跳过id节点和值节点
current = current->next->next;