课程设计成果学院:计算机工程学院班级:计算机科学与技术学生姓名:学号:设计地点（单位）：设计题目:普里姆算法求最小生成树完成日期：2016年1月6日指导教师评语:__________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________成绩(五级记分制):_____________________教师签名:_____________________________目录TOC\o"1-3"\h\z\uHYPERLINK\l"_Toc439956497"1需求分析PAGEREF_Toc439956497\h1HYPERLINK\l"_Toc439956498"1.1系统目标PAGEREF_Toc439956498\h1HYPERLINK\l"_Toc439956499"1.2主体功能PAGEREF_Toc439956499\h1HYPERLINK\l"_Toc439956500"1.2开发环境PAGEREF_Toc439956500\h1HYPERLINK\l"_Toc439956501"2概要设计PAGEREF_Toc439956501\h2HYPERLINK\l"_Toc439956502"2.1功能模块划分PAGEREF_Toc439956502\h2HYPERLINK\l"_Toc439956503"2.2系统流程图PAGEREF_Toc439956503\h3HYPERLINK\l"_Toc439956504"2.2.1CreateMGraph()函数程序框图PAGEREF_Toc439956504\h3HYPERLINK\l"_Toc439956505"2.2.2普利姆函数程序框图PAGEREF_Toc439956505\h4HYPERLINK\l"_Toc439956506"2.2.3createALgraph()函数程序框图PAGEREF_Toc439956506\h5HYPERLINK\l"_Toc439956507"2.2.4邻接矩阵Output()输出函数程序框图PAGEREF_Toc439956507\h5HYPERLINK\l"_Toc439956508"3详细设计PAGEREF_Toc439956508\h6HYPERLINK\l"_Toc439956509"3.1数据结构PAGEREF_Toc439956509\h6HYPERLINK\l"_Toc439956510"3.2模块设计PAGEREF_Toc439956510\h8HYPERLINK\l"_Toc439956511"3.2.1创建有向网图邻接矩阵存储PAGEREF_Toc439956511\h8HYPERLINK\l"_Toc439956512"3.2.2创建无向网图邻接矩阵存储PAGEREF_Toc439956512\h9HYPERLINK\l"_Toc439956513"3.2.3创建有向网图邻接表存储PAGEREF_Toc439956513\h10HYPERLINK\l"_Toc439956514"3.2.4创建无向网图邻接表存储PAGEREF_Toc439956514\h11HYPERLINK\l"_Toc439956515"3.2.5prim算法求最小生成树PAGEREF_Toc439956515\h12HYPERLINK\l"_Toc439956516"3.2.6输出邻接矩阵存储函数PAGEREF_Toc439956516\h13HYPERLINK\l"_Toc439956517"3.2.7输出邻接表存储函数PAGEREF_Toc439956517\h14HYPERLINK\l"_Toc439956518"3.2.8邻接表转换成邻接矩阵函数PAGEREF_Toc439956518\h14