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

😭

Browse Source
This commit is contained in:
御坂スバル
2024-12-05 15:46:08 +08:00
parent 08f6f4b0f4
commit 4ae4cf8554
26 changed files with 1385 additions and 1381 deletions
Download Patch File Download Diff File Expand all files Collapse all files
homework5/ListGraph.h
+140 -136
View File
@@ -1,136 +1,140 @@
//
// Created by 31416 on 24-12-4.
//
#ifndef LIST_GRAPH_H
#define LIST_GRAPH_H
#include <sstream>
#include<vector>
#include "GraphExceptions/InsertExistedConnectException.h"
#include "GraphExceptions/NodeIdOutOfRangeException.h"
#include "GraphExceptions/SameNodeConnectException.h"
using namespace std;
/*
* 简述：
* 节点=数据域+指针域
* 第一个节点存储id
* 第二个节点存储值
* 后续节点存储连接关系
* 数据域：
* data：可存id，可存其他节点的id，可存数据
* weight：边上的权
*/
template<typename T>
class ListGraph {
private:
struct node{
T data;
T weight;
struct node* next;
};
vector<node*> nodes;
bool flag; //定义是否有向
bool isWeighted; //定义是否有权
public:
ListGraph() {
nodes.clear();
flag = false;
isWeighted = false;
}
ListGraph(bool flag) {
nodes.clear();
this->flag = flag;
isWeighted = false;
}
ListGraph(bool flag,bool isWeighted) {
nodes.clear();
this->flag = flag;
this->isWeighted = isWeighted;
}
void insert(T data) {
node* insert = new node();
insert->data=nodes.size();
insert->weight = 0;
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);
}
if(id1==id2) {
throw SameNodeConnectException("禁止连接图中的同一个点",0x001);
}
node *current = nodes.at(id1);
int current_id = 0;
while(current->next!=NULL) {
if((current->next->data==id2)&&(current_id>1)) {
if (current->next->weight==weight) {
throw InsertExistedConnectException("禁止插入已存在的连接",0x003);
}
current->next->weight=weight;
}
current = current->next;
current_id++;
}
current->next=new node();
current->next->data=id2;
current->next->weight = weight;
current->next->next=NULL;
if (!flag) {
node *current2 = nodes.at(id2);
int current2_id = 0;
while(current2->next!=NULL) {
if((current2->next->data==id2)&&(current2_id>1)) {
if (current2->next->weight==weight) {
throw InsertExistedConnectException("禁止插入已存在的连接",0x003);
}
current2->next->weight=weight;
}
current2 = current2->next;
current2_id++;
}
current2->next=new node();
current2->next->data=id1;
current2->next->weight = weight;
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) {
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;
}
return ss.str();
}
};
#endif //LIST_GRAPH_H
//
// Created by 31416 on 24-12-4.
//
#ifndef LIST_GRAPH_H
#define LIST_GRAPH_H
#include <sstream>
#include<vector>
#include "GraphExceptions/InsertExistedConnectException.h"
#include "GraphExceptions/NodeIdOutOfRangeException.h"
#include "GraphExceptions/SameNodeConnectException.h"
using namespace std;
/*
* 简述：
* 节点=数据域+指针域
* 第一个节点存储id
* 第二个节点存储值
* 后续节点存储连接关系
* 数据域：
* data：可存id，可存其他节点的id，可存数据
* weight：边上的权
*/
template<typename T>
class ListGraph {
private:
struct node{
T data;
T weight;
struct node* next;
};
vector<node*> nodes;
bool flag; //定义是否有向
bool isWeighted; //定义是否有权
public:
ListGraph() {
nodes.clear();
flag = false;
isWeighted = false;
}
ListGraph(bool flag) {
nodes.clear();
this->flag = flag;
isWeighted = false;
}
ListGraph(bool flag,bool isWeighted) {
nodes.clear();
this->flag = flag;
this->isWeighted = isWeighted;
}
void insert(T data) {
node* insert = new node();
insert->data=nodes.size();
insert->weight = 0;
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);
}
if(id1==id2) {
throw SameNodeConnectException("禁止连接图中的同一个点",0x001);
}
node *current = nodes.at(id1);
//跳过id节点和值节点
for(int i=0;i<2;i++) {
current = current->next;
}
while(current->next!=NULL) {
if(current->next->data==id2) {
if (current->next->weight==weight) {
throw InsertExistedConnectException("禁止插入已存在的连接",0x003);
}
current->next->weight=weight;
}
current = current->next;
}
current->next=new node();
current->next->data=id2;
current->next->weight = weight;
current->next->next=NULL;
if (!flag) {
node *current2 = nodes.at(id2);
//跳过id节点和值节点
for(int i=0;i<2;i++) {
current = current->next;
}
while(current2->next!=NULL) {
if((current2->next->data==id2)) {
if (current2->next->weight==weight) {
throw InsertExistedConnectException("禁止插入已存在的连接",0x003);
}
current2->next->weight=weight;
}
current2 = current2->next;
}
current2->next=new node();
current2->next->data=id1;
current2->next->weight = weight;
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) {
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;
}
return ss.str();
}
};
#endif //LIST_GRAPH_H