代码搜索：Infinity
找到约 1,499 项符合「Infinity」的源代码
代码结果 1,499
www.eeworm.com/read/334090/12638430
asm fs_toi32.asm
;******************************************************************************
;* FS_TOI32.ASM - 32 BIT STATE - v2.24 *
;* Copyright (c) 1996-2002 Texas Instru
www.eeworm.com/read/334090/12638562
asm fd_toi32.asm
;******************************************************************************
;* FD_TOI32.ASM - 32 BIT STATE - v2.24 *
;* Copyright (c) 1996-2002 Texas Instru
www.eeworm.com/read/235539/14064906
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/106262/15642245
c grprim1.c
void Prim(Graph& G, int s) { // Prim's MST algorithm
// int D[G.n()]; // Distance vertex
// int V[G.n()]; // Who's closest
int *D, *V;
www.eeworm.com/read/106262/15642266
c grdijk1.c
void Dijkstra(Graph& G, int s) { // Compute shortest path distances
//int D[G.n()];
int *D;
D = new int [G.n()];
for (int i=0; i
www.eeworm.com/read/168845/5435898
cpp hash_float_test.cpp
// Copyright Daniel James 2005. Use, modification, and distribution are
// subject to the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.bo
www.eeworm.com/read/392021/8366960
m evalrpoly.m
function y = evalRPoly(roots,x,k)
%function y = evalRPoly(roots,x,k=1)
%Compute the value of a polynomial which is given in terms of its roots.
if(nargin
www.eeworm.com/read/292139/8376006
java division_by_zero.java
//【例5.1】 发现除数为0错。
public class Division_by_zero
{
public static void main (String args[])
{
// System.out.println(""+(3/0)); //整数除法，除数为0，抛出算术异常
System.out.p
www.eeworm.com/read/287905/8662310
c algo7-6.c
/* algo7-6.c 实现算法7.15的程序。迪杰斯特拉算法的实现 */
#include"c1.h"
#define MAX_NAME 5 /* 顶点字符串的最大长度+1 */
#define MAX_INFO 20 /* 相关信息字符串的最大长度+1 */
typedef int VRType;
typedef char InfoType;
typedef cha
www.eeworm.com/read/384841/8838932
c algo7-6.c
/* algo7-6.c 实现算法7.15的程序。迪杰斯特拉算法的实现 */
#include"c1.h"
#define MAX_NAME 5 /* 顶点字符串的最大长度+1 */
#define MAX_INFO 20 /* 相关信息字符串的最大长度+1 */
typedef int VRType;
typedef char InfoType;
typedef cha