代码搜索：Infinity
找到约 1,499 项符合「Infinity」的源代码
代码结果 1,499
www.eeworm.com/read/323340/13343552
h graph.h
//Graph.h
//uuhorse
//2008.05.30
/////////////////////////////////////////////
#ifndef _MG_GRAPH_ADJMATRIX_
#define _MG_GRAPH_ADJMATRIX_
#define INFINITY INT_MAX //树权最大值
#define MA
www.eeworm.com/read/323340/13343554
h mgraph.h
//Graph.h
//uuhorse
//2008.05.30
/////////////////////////////////////////////
#ifndef _MG_GRAPH_ADJMATRIX_
#define _MG_GRAPH_ADJMATRIX_
#define INFINITY 100/*INT_MAX*/ //树权最大值
#d
www.eeworm.com/read/136812/5857311
c isinf.c
#if !defined(lint) && defined(SCCSIDS)
static char sccsid[] = "@(#)isinf.c 1.1 92/07/30 SMI";
#endif
/*
* Recognize an infinity or a NaN when one is presented.
* This is for keeping various IO rout
www.eeworm.com/read/251835/12317676
m moebius.m
function map = moebius(varargin)
%MOEBIUS Moebius transformation.
% MOEBIUS(Z,W) creates the Moebius transformation the maps the
% 3-vector Z to W. Infinity is allowed in Z and W.
%
% MO
www.eeworm.com/read/251835/12317698
m eval.m
function f = eval(map,z)
%Evaluate Moebius transformation at point(s).
% EVAL(M,Z) evaluates the Moebius transformation M at the point(s)
% in Z. Infinity is a valid input.
% Copyright (c)
www.eeworm.com/read/128476/14294809
java fig10_46.java
public class Fig10_46
{
/* START: Fig10_46.txt */
public static final long INFINITY = Long.MAX_VALUE;
/**
* Compute optimal ordering of matrix multiplication.
www.eeworm.com/read/344585/3207853
m linf.m
function [perf,which] = linf(e)
% L infinity norm of the residuals
%
% >> perf = linf(E);
%
% see also:
% mse, mae, medae, trimmedmse
% Copyright (c) 2002, KULeuven-ESAT-SCD, License & help
www.eeworm.com/read/303435/3811681
c cholesky.c
/* Copyright (c) Colorado School of Mines, 2006.*/
/* All rights reserved. */
#include "cwp.h"
#define INFINITY 9e+99
#define EPSLON 0.001
/*
This function implements the par
www.eeworm.com/read/293917/3927341
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
www.eeworm.com/read/293917/3927482
cpp fig09_32.cpp
void Graph::weightedNegative( Vertex s )
{
Queue q;
for each Vertex v
v.dist = INFINITY;
s.dist = 0;
q.enqueue( s );
while( !q.isEmpty( ) )
{