代码搜索：Infinity
找到约 1,499 项符合「Infinity」的源代码
代码结果 1,499
www.eeworm.com/read/161189/10439938
m phiinv.m
%
% Calculates the inverse normal distribution.
%
% x=phiinv(z)
%
% gives z=int((1/sqrt(2*pi))*exp(-t^2/2),t=-infinity..x)
%
function x=phiinv(z)
if (z >= 0.5),
x=sqrt(2)*erfinv((z-0.5)/.5);
www.eeworm.com/read/161189/10439953
m phiinv.m
%
% Calculates the inverse normal distribution.
%
% x=phiinv(z)
%
% gives z=int((1/sqrt(2*pi))*exp(-t^2/2),t=-infinity..x)
%
function x=phiinv(z)
if (z >= 0.5),
x=sqrt(2)*erfinv((z-0.5)/.5);
www.eeworm.com/read/161189/10439965
m phiinv.m
%
% Calculates the inverse normal distribution.
%
% x=phiinv(z)
%
% gives z=int((1/sqrt(2*pi))*exp(-t^2/2),t=-infinity..x)
%
function x=phiinv(z)
if (z >= 0.5),
x=sqrt(2)*erfinv((z-0.5)/.5);
www.eeworm.com/read/423820/10531083
c a.c
/*
* File: tsp.c
* Description: 求解货郎担问题的分枝限界算法
* Branch-and-bound algorithm to solve
* the travelling salesman problem.
* Created: 2001/11/29
* Author: Justin
www.eeworm.com/read/351570/10639501
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/351570/10639546
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/349837/10797813
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/349837/10797839
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/418779/10904727
txt 2222.txt
Rule:
--
Sid:
2222
--
Summary:
This event is generated when an attempt is made to access nph-exploitscanget.cgi on an internal web server. This may indicate an attempt to exploit a cross-site scri