最小生成树在应用场景中经常用到,因此温习看看
最小生成树普利姆算法 http://www.cnblogs.com/biyeymyhjob/archive/2012/07/30/2615542.html
C#代码实现:
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace ConsoleApp1
{
class Program
{
//结点初始状态
static int N = -1;
//结点已加入状态
static int Y = 1;
static void Main(string[] args)
{
//起始点 顶点以0开始 A顶点为0,B为1
int start = 3;
//无向图邻接矩阵
int[,] map = new int[7, 7] {
{0,7,N,5,N,N,N }, //A顶点的边
{7,0,8,9,7,N,N }, //B顶点的边
{N,8,0,N,5,N,N }, //C顶点的边
{5,9,N,0,N,6,N }, //D顶点的边
{N,7,5,N,0,8,9 }, //E 顶点的边
{N,N,N,6,8,0,11 }, //F 顶点的边
{N,N,N,N,9,11,0 }, //G顶点的边
};