小賀のBlog

使用Java语言完整实现邻接表表示图与经典应用，如深度/广度优先遍历、Dijkstra最短路径问题

使用Java代码完整实现邻接矩阵表示图以及图的深度/广度优先遍历和最小生成树

注释详细完整且健壮的二叉树的顺序/链式以及线索二叉树实现与常规操作的代码：二叉树的顺序实现//// main.c// SqBiTree//// Created by Eason on 2020/8/7.// Copyright © 2020 Eason. All rights reserved.//#include <stdio.h>#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#defin

注释详细完整且健壮的串的常规操作以及朴素和KMP算法的代码：串的常规操作与模式匹配//// main.c// StringList//// Created by Eason on 2020/8/3.// Copyright © 2020 Eason. All rights reserved.//#include <stdio.h>#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define M

注释详细完整且健壮的两种方式实现队列的代码：顺序队列//// main.c// SequenceQueue//// Created by Eason on 2020/8/2.// Copyright © 2020 Eason. All rights reserved.//#include <stdio.h>#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 21 /

含超详细注释的完整且健壮的栈的三种实现方式代码：顺序栈//// main.c// SequenceStack//// Created by Eason on 2020/8/1.// Copyright © 2020 Eason. All rights reserved.//#include <stdio.h>#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 20t

完整且健壮的两种线性表的表示代码线性表的顺序表示：//// main.c// SQList//// Created by Eason on 2020/7/28.// Copyright © 2020 Eason. All rights reserved.//#include<stdio.h>#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define maxsize 100typedef i