代码搜索：Infinity
找到约 1,499 项符合「Infinity」的源代码
代码结果 1,499
www.eeworm.com/read/390464/8464521
dfs
//DFS非递归算法
#include
#include
#include
#include
#define infinity 30000//若边的权值为infinity，此边为空边
#define MAX 20
int visited[MAX];
int (*visitFunc)(int
www.eeworm.com/read/431060/8710189
h tsp.h
#include
#include
#define INFINITY 9999
void TSP(int n);
void print(int n);
www.eeworm.com/read/362558/9992561
c 7.15.c
typedef unsigned int WeightType;
typedef WeightType AdjType;
typedef SeqList VertexSet;
ShortestPath_DJS(AdjMatrix g,int v0,WeightType dist[MAX_VERTEX_NUM],VertexSet path[MAX_VERTEX_NUM])
/* pat
www.eeworm.com/read/360770/10078842
m a124.m
%----------------------------------------------------------------
% Example a1.2.4: Utility Functions
%----------------------------------------------------------------
www.eeworm.com/read/358598/10184103
cpp prim.cpp
//Prim 算法
//注释见书
void Prim(Graph& G, int s) {
int *D, *V;
D = new int [G.n()];
V = new int [G.n()];
for (int i=0; i
www.eeworm.com/read/281000/10273787
cpp fig12_23.cpp
template
class DSL
{
public:
/**
* Construct the tree.
* inf is the largest Comparable.
*/
explicit DSL( const Comparable & inf ) : INFINITY( i
www.eeworm.com/read/281000/10274149
cpp fig09_31.cpp
void Graph::dijkstra( Vertex s )
{
for each Vertex v
{
v.dist = INFINITY;
v.known = false;
}
s.dist = 0;
for( ; ; )
{
Vertex v = smallest
www.eeworm.com/read/161368/10421474
cpp prim.cpp
//Prim 算法
//注释见书
void Prim(Graph& G, int s) {
int *D, *V;
D = new int [G.n()];
V = new int [G.n()];
for (int i=0; i
www.eeworm.com/read/161189/10439811
m phiinv.m
%
% Calculates the inverse normal distribution.
%
% x=phiinv(z)
%
% gives z=int((1/sqrt(2*pi))*exp(-t^2/2),t=-infinity..x)
%
function x=phiinv(z)
if (z >= 0.5),
x=sqrt(2)*erfinv((z-0.5)/.5);
www.eeworm.com/read/161189/10439860
m phiinv.m
%
% Calculates the inverse normal distribution.
%
% x=phiinv(z)
%
% gives z=int((1/sqrt(2*pi))*exp(-t^2/2),t=-infinity..x)
%
function x=phiinv(z)
if (z >= 0.5),
x=sqrt(2)*erfinv((z-0.5)/.5);