代码搜索：Infinity
找到约 1,499 项符合「Infinity」的源代码
代码结果 1,499
www.eeworm.com/read/219502/14878289
cpp algo0715.cpp
void ShortestPath_DIJ(MGraph G,int v0,PathMatrix &P,ShortPathTable &D)
{ // 算法7.15
// 用Dijkstra算法求有向网G的v0顶点到其余顶点v的最短路径P[v]
// 及其带权长度D[v]。
// 若P[v][w]为TRUE，则w是从v0到v当前求得最短路径上的顶点。
// final[v
www.eeworm.com/read/219502/14878316
cpp algo0716.cpp
void ShortestPath_FLOYD(MGraph G, PathMatrix P[], DistancMatrix &D) {
// 算法7.16
// 用Floyd算法求有向网G中各对顶点v和w之间的最短路径P[v][w]及其
// 带权长度D[v][w]。若P[v][w][u]为TRUE，则u是从v到w当前求得最
// 短路径上的顶点。
int v,w
www.eeworm.com/read/208856/15234227
cpp algo0715.cpp
void ShortestPath_DIJ(MGraph G,int v0,PathMatrix &P,ShortPathTable &D)
{ // 算法7.15
// 用Dijkstra算法求有向网G的v0顶点到其余顶点v的最短路径P[v]
// 及其带权长度D[v]。
// 若P[v][w]为TRUE，则w是从v0到v当前求得最短路径上的顶点。
// final[v
www.eeworm.com/read/208856/15234242
cpp algo0716.cpp
void ShortestPath_FLOYD(MGraph G, PathMatrix P[], DistancMatrix &D) {
// 算法7.16
// 用Floyd算法求有向网G中各对顶点v和w之间的最短路径P[v][w]及其
// 带权长度D[v][w]。若P[v][w][u]为TRUE，则u是从v到w当前求得最
// 短路径上的顶点。
int v,w
www.eeworm.com/read/167133/5469447
java doublecomp.java
public class DoubleComp {
private static class TestCase {
String arg1, arg2, expect;
double val1, val2;
TestCase(String arg1, String arg2, String expect) {
this.arg1 = arg1;
www.eeworm.com/read/167133/5469486
java doubleprint.java
class DoublePrint {
static final double[] dcases = {
0.0,
-0.0,
Double.longBitsToDouble(0x8000000000000000L),
1.0, /* test dconst_1 */
Double.NaN,
Double.POSITIVE_INFINITY,
www.eeworm.com/read/167046/5470656
h resource.h
/* Bit values & structures for resource limits. Linux/SPARC version.
Copyright (C) 1994,1996,1997,1998,1999,2000 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The G
www.eeworm.com/read/163821/5508932
h resource.h
/* Bit values & structures for resource limits. Linux/SPARC version.
Copyright (C) 1994,1996,1997,1998,1999,2000 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The G
www.eeworm.com/read/161121/5556868
s fp_util.s
/*
* fp_util.S
*
* Copyright Roman Zippel, 1997. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the foll
www.eeworm.com/read/152843/5658818
s fp_util.s
/*
* fp_util.S
*
* Copyright Roman Zippel, 1997. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the foll