用链表结构存储无权图,
#include <iostream>
using namespace std;
class Node
{
public:
Node()=default;
Node(char val):value(val),next(nullptr){}
inline Node*& getNext(){ return next; }
inline char getValue(){ return value; }
private:
Node *next;
char value; //每一个结点的值
};
void printLList(Node **head,size_t n); //打印图,以边的形式打印
void Insert(Node **&head,size_t &n,char val1, char val2, bool flag); //插入一条边
void Delete(Node **&head,size_t &n,char val1, char val2, bool flag); //删除一条边
Node* Search(Node **head,size_t n,char val);
void Delete(Node **&head,size_t &n,char val1, char val2, bool flag)
{
Node *temp = Search(head,n,val1);
if(temp == nullptr)
cout<<"该边不存在!"<<endl;
else
{
Node *parent = temp;
temp = temp->getNext();
while(temp != nullptr && temp->getValue() != va