代码搜索：Infinity
找到约 1,499 项符合「Infinity」的源代码
代码结果 1,499
www.eeworm.com/read/387480/8674305
cpp pathfunction.cpp
#include "shortestPath.h"
//get the location of v0 in the DNetwork
//return -1 if v0 is not exist
int VexLocation(DNetwork G,VertexType v0){
assert( strlen(v0)!=0 );
int i;
for(i=0;i
www.eeworm.com/read/429977/8775798
h xfloyed.h
/*/////////////////////////////////////////
// 版权所有(C) 2000-2008 邓辉 //
// Email： denghui0815@hotmail.com //
// 说明： Intel线程优化大赛参赛作品//
////////////////////////////////////////
www.eeworm.com/read/382947/8988176
cpp func7-2.cpp
// func7-2.cpp 算法7.16,algo7-7.cpp和algo7-9.cpp用到
void ShortestPath_FLOYD(MGraph G,PathMatrix P,DistancMatrix D)
{ // 用Floyd算法求有向网G中各对顶点v和w之间的最短路径P[v][w]及其带权长度D[v][w]。
// 若P[v][w][u]为TRUE，则u是从v
www.eeworm.com/read/283723/8993856
cpp func7-2.cpp
// func7-2.cpp 算法7.16,algo7-7.cpp和algo7-9.cpp用到
void ShortestPath_FLOYD(MGraph G,PathMatrix P,DistancMatrix D)
{ // 用Floyd算法求有向网G中各对顶点v和w之间的最短路径P[v][w]及其带权长度D[v][w]。
// 若P[v][w][u]为TRUE，则u是从v
www.eeworm.com/read/372708/9496758
out dijkstra.out
========================
Source:2
Target:1
Distance:20
Path:2-->1
========================
========================
Source:2
Target:3
Distance:25
Path:2-->3
========================
==
www.eeworm.com/read/365029/9881386
cpp tracebacksw.cpp
#include "muscle.h"
#include "profile.h"
#include "pwpath.h"
#include
#define TRACE 0
#define EQ(a, b) (fabs(a-b) < 0.1)
void TraceBackSW(const ProfPos *PA, unsigned uLengthA, con
www.eeworm.com/read/365029/9881427
cpp traceback.cpp
#include "muscle.h"
#include "profile.h"
#include "pwpath.h"
#include
#define TRACE 0
#define EQ(a, b) (fabs(a-b) < 0.1)
SCORE TraceBack(const ProfPos *PA, unsigned uLengthA, cons
www.eeworm.com/read/359902/10116682
h graph.h
/*********************************************\
* *
* 图论算法 *
* *
*
www.eeworm.com/read/281000/10273575
cpp fig09_16.cpp
void Graph::unweighted( Vertex s )
{
for each Vertex v
{
v.dist = INFINITY;
v.known = false;
}
s.dist = 0;
for( int currDist = 0; currDist < NUM_VERTICE