12 2016 档案

图——克鲁斯算法——构建最小生成树（采用邻接矩阵的方式存储）
摘要：include "stdafx.h" include include include include include include include include include include include using namespace std; typedef struct { vecto 阅读全文
posted @ 2016-12-16 11:09 wdan2016 阅读(521) 评论(0) 推荐(0)
图——普里姆算法——构建最小生成树（采用邻接矩阵的方式存储）
摘要：include "stdafx.h" include include include include include include include include include include include using namespace std; typedef struct { vecto 阅读全文
posted @ 2016-12-15 16:43 wdan2016 阅读(1064) 评论(0) 推荐(0)
图——广度优先遍历和深度优先遍历——邻接表表示法
摘要：// ConsoleApplication2.cpp : 定义控制台应用程序的入口点。 // include "stdafx.h" include "stdafx.h" include include include include include include include include i 阅读全文
posted @ 2016-12-15 10:09 wdan2016 阅读(578) 评论(0) 推荐(0)
图——广度优先遍历和深度优先遍历——邻接矩阵表示法
摘要：// test20.cpp : 定义控制台应用程序的入口点。 // include "stdafx.h" include include include include include include include include include using namespace std; type 阅读全文
posted @ 2016-12-13 22:43 wdan2016 阅读(594) 评论(0) 推荐(0)