Rice__的博客

运行结果截图(八方向可走)手写栈 LinkStack.h图 Maze.h#pragma warning(disable:4996)#ifndef MAZE_H_#define MAZE_H_#include<conio.h>#include <stdlib.h>#include <stdio.h>#include "LinkStack.h"typedef struct MAZE{ int size; int** data;}..

手写队列 Queue.h#ifndef SEQQUEUE_H#define SEQQUEUE_H#include <stdio.h>#include <stdlib.h>typedef struct Point{ int x; int y; struct Point* pre; // 保存路径中的上一个节点}Point;typedef Point* DataType;struct Node{ DataType data; struct Nod.

手写栈 LinkStack.h#ifndef LINKSTACK_H#define LINKSTACK_Htypedef enum { true = 1, false = 0 } bool;typedef int Data;struct Node { Data data; struct Node* next;};typedef struct Node* PNode;typedef struct Node* LinkStack;LinkStack CreatStack(){ .

算法思想算法伪代码测试用例过程代码实现#include <iostream>#include <cstdio>#include <vector>#include <queue>#include <iomanip>using namespace std;#define max 110 //最大顶点个数#define INF 0xfffff //权值上限int n; //顶点数str.

dijkstra是求一个顶点到其他所有顶点的最小距离,类似普里姆算法floyd是把所有结点之间的最小距离求出本程序使用接邻矩阵保存图,测试用例如下图:#pragma once#include <iostream>#include <iomanip>#include <map>using namespace std;template<class T>class MatriGraphx{public: MatriGraphx(s.

#pragma once#include <iostream>#include <iomanip>#include <map>using namespace std;template<class T>class MatriGraphx{public: MatriGraphx(size_t capacity = 20); ~MatriGraphx(); class Vertex//顶点 { public: Vertex(T v.

简单实现图的邻接表深度优先(DFS)与广度优先算法(BFS)遍历图头文件#pragma once#include <iostream>#include <list>#include <stack>#include <queue>using namespace std;template<class T>class AdjacencyGraph{public: AdjacencyGraph(size_t capaci.

图:用list表示接邻表链BFS:容器与队列DFS:递归/涂色法用例51 2 11 3 11 5 12 3 12 4 13 5 14 5 10 0 0结果BFS遍历如下:访问结点 1(父结点:0,距离:0)访问结点 2(父结点:1,距离:1)访问结点 3(父结点:1,距离:1)访问结点 5(父结点:1,距离:1)访问结点 4(父结点:2,距离:2)DF...