代码搜索：Infinity
找到约 1,499 项符合「Infinity」的源代码
代码结果 1,499
www.eeworm.com/read/281000/10273914
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/352747/10518852
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/422125/10662212
txt vhdl主程序的简单注释.txt
library ieee;
use IEEE.STD_LOGIC_1164.ALL;
use IEEE.STD_LOGIC_ARITH.ALL;
use IEEE.STD_LOGIC_UNSIGNED.ALL;
--Travis Gilbert
-- last modified 21 Febur 2009
-- FP Multiplier (11-bit: 1 bit sign,
www.eeworm.com/read/422125/10662549
vhd mul11.vhd
library ieee;
use IEEE.STD_LOGIC_1164.ALL;
use IEEE.STD_LOGIC_ARITH.ALL;
use IEEE.STD_LOGIC_UNSIGNED.ALL;
--Travis Gilbert
-- last modified 21 Febur 2009
-- FP Multiplier (11-bit: 1 bit sign,
www.eeworm.com/read/273406/10918339
java valuescope.java
//: ValueScope.java
//package g3ds.joop.ch3;
public class ValueScope{
public static void main(String[] args){
//声明变量
byte b;
char c;
short s;
int i;
long l;
float f;
do
www.eeworm.com/read/155618/6960691
h graph.h
/*********************************************\
* *
* 图论算法 *
* *
*
www.eeworm.com/read/461110/7233705
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/454528/7387845
cpp theshortestpathmethod.cpp
#include "stdafx.h"
#include "stdio.h"
#include "conio.h"
#define INFINITY 32767
//入口参数：Graph是图的矩阵表示；
//row 是矩阵的行数；
//v0是起点的序号；
//final[i]记录从起点到第i个节点是否有路可达；
void ShortestPath_DIJ(int G[6][
www.eeworm.com/read/444737/7607816
cpp algorithms_for_graph_theory.cpp
/********************************************** *
* 图论算法 *
* *
* z
www.eeworm.com/read/436719/7765276
cpp func7-8.cpp
// func7-8.cpp 算法7.16，algo7-10.cpp和algo7-11.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，则