代码搜索：Infinity
找到约 1,499 项符合「Infinity」的源代码
代码结果 1,499
www.eeworm.com/read/163821/5508924
h mathdef.h
/* Copyright (C) 1997, 1998, 1999, 2000 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it un
www.eeworm.com/read/162614/5529955
c float-range-2.c
/* Floating constants outside the range of their type should receive a
pedwarn, not a warning. This includes INFINITY if the target does
not support infinities. */
/* Origin: Joseph Myers
www.eeworm.com/read/162614/5531240
c builtin-inf-1.c
/* { dg-do compile } */
float fi = __builtin_inff();
double di = __builtin_inf();
long double li = __builtin_infl();
float fh = __builtin_huge_valf();
double dh = __builtin_huge_val();
long double l
www.eeworm.com/read/293882/8266793
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/174160/9605659
readme
###############
Description:
MATLAB routines to simulate and visualize various queueing systems:
M/M/1, M/D/1, M/G/1, M/G/infinity. Requires the "toolbox" for
generation of random numbers. It
www.eeworm.com/read/367274/9763744
asm float.asm
;Testname=unoptimized; Arguments=-O0 -fbin -ofloat.bin; Files=stdout stderr float.bin
;Testname=optimized; Arguments=-Ox -fbin -ofloat.bin; Files=stdout stderr float.bin
;
; Test of floating-po
www.eeworm.com/read/415144/11083423
cpp trans.cpp
//#include"c1.h"
#include
#include
#include
using namespace std;
#define INFINITY 9999999
#define MAX_VERTEX_NUM 30
typedef int VRType;
typedef struct ArcCell{
VRT
www.eeworm.com/read/266379/11229050
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/266379/11229243
cpp fig10_79.cpp
Distance Graph::shortest( $s$, $t$ )
{
Distance $d_t$, temp;
if( $s$ == $t$ )
return 0;
$d_t$ = $\infinity$;
for each Vertex $v$ adjacent to $s$
{
tmp =
www.eeworm.com/read/147503/12550114
h graph.h
/*********************************************\
* *
* 图论算法 *
* *
*