![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
c语言
八棵树
古今多少事,渔唱起三更。
展开
-
c语言版——四则运算
#include<stdio.h>#include<conio.h>#include<string.h>#include<stdlib.h>#define MAX 1024typedef char elemtype;typedef struct SequenStack{ elemtype data[MAX]; //int type; int top;}Sequ原创 2015-12-02 13:45:02 · 1903 阅读 · 3 评论 -
实验七(以邻接矩阵为储存方式的广度优先搜索和以邻接表为储存方式的深度优先搜索方式)
#include<stdio.h>#include<stdlib.h>#define MaxVertexNum 100#define N 100typedef char VertexType;typedef int EdgeType;int visited[N];typedef struct { VertexType vexs[MaxVertexNum]; EdgeT原创 2015-12-07 16:00:25 · 1355 阅读 · 0 评论 -
最近让交的实验内容:实验一
#include<stdio.h>#include<stdlib.h>#define MAXSIZE 1000typedef int elemtype;typedef struct sequlist{ elemtype data[MAXSIZE]; int last;}SequenList;SequenList *l,*B;SequenList *Init_Seque原创 2015-12-07 15:44:27 · 460 阅读 · 0 评论 -
实验八.字符串排序
直接上代码#include<stdio.h>#include<stdlib.h>#include<conio.h>#include<string.h>#define M 10#define N 10typedef struct student{ char name[M];}student;typedef struct { student data[N];原创 2015-12-07 16:05:42 · 702 阅读 · 0 评论 -
实验一的第二个又叫并集。
# include<stdio.h># include<stdlib.h># include<string.h># define MAX 1000typedef struct List{ int ia[MAX]; int Last;} List;List *LA; List *LB;List *LC;List *creat_list();List *build_原创 2015-12-07 15:47:04 · 426 阅读 · 0 评论 -
实验三的迷宫问题
先上代码#include<stdio.h>#include<stdlib.h>#include<time.h>#define SIZE 7#define MAX 1024 //typedef int Elemtype;typedef struct//路径方块查找方向的数据结构 { int x; int y;}Direction;typedef struct //路径方原创 2015-12-07 15:51:26 · 468 阅读 · 0 评论