摘要： #include <stdio.h>#define N 6#define M 1<<10typedef struct {int pi[N];int end;}pathtype;int main(){ int array[N][N] ={ // v0 v1 v2 v3 v4 v5 /*v0*/ { 0, 20, 15, M, M, M}, /*v1*/ { 2, 0, 4, M, 10, 30}, /*v2*... 阅读全文

摘要： 图的深度和广度优先算法#include <stdio.h>#include <stdlib.h>#include <errno.h>#include <strings.h>#define N 5#define M 10typedef int datatype;typedef struct { datatype data[M]; int front,rear;}sequeue;sequeue * create(){ sequeue * sq; if((sq = (sequeue *)malloc(sizeof(sequeue)))==NULL) { 阅读全文