- 博客(7)
- 资源 (4)
- 收藏
- 关注
RSS订阅原创 马踏棋盘算法（骑士周游问题）C++
#include<iostream> #include<cstdio> using namespace std; #define X 8 //定义棋盘 #define Y 8 int chess[X+1][Y+1]; int nextxy(int &x,int &y,int count){ //判断该棋盘格是否可以插入棋子 switch (count) { case 1: if(x + 2 <= X && y - 1 &.
2020-08-31 21:18:30
961
原创 DFS（深度优先遍历算法）C++
void matrix_make(Graph &g){ //由邻接表构造邻接矩阵 Arcnode *p = new Arcnode; memset(g.arc_matrix,0,sizeof(g.arc_matrix)); for(int i = 1;i <= g.vex_sum;i++) { p = g.vexlist[i].firstarc; while(p){ g.arc_matrix[i][p->adjvex] = 1; p = p->nex.
2020-08-30 08:21:44
965
原创 邻接表（逆邻接表）创建
#include<cstdio> #include<iostream> #include<malloc.h> #define max_sum 30 using namespace std; typedef struct Arcnode{ int adjvex; struct Arcnode *nextarc; }Arcnode; typedef struct Vexnode{ char data; struct Arcnode *firstarc; }Vnod.
2020-08-29 09:01:52
2555
原创 二叉树的创建和遍历 C/C++
#include<cstdio> #include<malloc.h> #include<iostream> using namespace std; typedef char Elemtype; typedef struct BiTnode{ char data; struct BiTnode* lchild; struct BiTnode* rchild; }BiTnode,*BiTree; //前序创建二叉树 void BiTree_creat(BiTre.
2020-08-20 15:08:49
310
原创 双向循环链表创建
#include<iostream> #include<malloc.h> #include<cstdio> using namespace std; struct List{ int data; List* next; List* prior; }*list,*end; int len = 0; void List_made(){ int t; list = new List; list->next = NULL; list->prior =.
2020-08-18 14:34:48
334
原创 链表创建（尾插法）
#include<iostream> #include<malloc.h> #include<cstdio> using namespace std; struct List{ int data; List* next; }*list,*end; int len = 0; void List_made(){ int t; list = new List; list->next = NULL; List *p; List *head = new Lis.
2020-08-18 14:23:24
201
1
原创 链表创建（头插法）
#include<iostream> #include<malloc.h> #include<cstdio> using namespace std; struct List{ int data; List* next; }*list; void List_made(){ int t; list = new List; list->next = NULL; List *p; List *head = new List; head = list; .
2020-08-18 14:11:21
136
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人