代码搜索：Prim
找到约 2,016 项符合「Prim」的源代码
代码结果 2,016
www.eeworm.com/read/182637/9198217
plg prim.plg
Build Log
--------------------Configuration: Prim - Win32 Debug--------------------
Command Lines
Creating temporary file "C:\DOCUME~1\buaaxgw\
www.eeworm.com/read/182637/9198221
dsp prim.dsp
# Microsoft Developer Studio Project File - Name="Prim" - Package Owner=
# Microsoft Developer Studio Generated Build File, Format Version 6.00
# ** DO NOT EDIT **
# TARGTYPE "Win32 (x86) Cons
www.eeworm.com/read/182637/9198223
h prim.h
www.eeworm.com/read/182637/9198226
cpp prim.cpp
#include
const int ItemNum = 6;
char Vexs[ItemNum] = {'a','b','c','d','e','f'};
int ArcCell [ItemNum][ItemNum] = {{0,6,1,5,0,0},{6,0,5,0,3,0},{1,5,0,5,6,4},
{5,0,5,0,0,2
www.eeworm.com/read/377774/9262689
m prim.m
function [p,data]=prim(a,e)
%在数据结构课程设计之余,即兴之作吧
%最小生成树的prim算法
%a为邻接矩阵，e为出发的顶点的序号
%p返回的是最小生成树的邻接矩阵
%data记录最后最小生成树的权值
data=0;
m=length(a); %图的顶点个数
if e>m|e
www.eeworm.com/read/375793/9349409
cpp prim.cpp
// 测试 Prim 最小耗费生成树算法
#include
#include "lwg.h"
using namespace std;
void main(void)
{
LinkedWGraph G(7);
EdgeNode t[7];
int n = 7;
int e, u, v, w;
c
www.eeworm.com/read/365461/9862878
txt prim.txt
#include
#include
#include
#define INFINITY 10000
#define MAX_VERTEX_NUM 20
#define MAX_NAME 5
#define OK 0
typedef char VertexType[MAX_NAME];
typedef struct Nrcel
www.eeworm.com/read/166306/10024271
m prim.m
function prim(pp)
%PRIM (求最小生成树)
%求最小生成树算法,通过prim算法求最优树,并给出相应图像.
%用法:
% 首先输入矩阵:
% map=[起点1 终点1 边长1;起点2 终点2 边长2;............;起点n 终点n 边长n]
% 再用[out,len]=kruskal(map)求最优树
%参数说明
% map----3列邻接矩