代码搜索结果
找到约 10,000 项符合
Algorithm 的代码
2236099_wa.cc
//Graham scan algorithm
//O(nlgn)
# include
# include
# include
# define MAX 1001
using namespace std;
struct node
{
int x, y;
}Q[MAX];
int n, low;
in
2236115_wa.cc
//Graham scan algorithm
//O(nlgn)
# include
# include
# include
# define MAX 1001
using namespace std;
struct node
{
int x, y;
}Q[MAX];
int n, low;
in
2236069_wa.cc
//Graham scan algorithm
//O(nlgn)
# include
# include
# include
# define MAX 50001
using namespace std;
typedef int stack;
struct node
{
int x, y;
}Q[MAX
polyfact.c
/*
Author: Pate Williams (c) 1997
Berlekamp's Q-matrix algorithm. See "Handbook
of Applied Cryptography" by Alfred J. Menezes
et al 3.11.2 Section 3.111 Algorithm page 124.
Also see
neuron.java
package org.scut.DataMining.Algorithm.NeuralNetwork.Core;
import java.util.ArrayList;
import java.util.Date;
import java.util.Iterator;
import org.scut.DataMining.Algorithm.NeuralNetwork.Core.
fig20_26.cpp
// Fig. 20.26: fig20_26.cpp
// Standard Library algorithms fill, fill_n, generate and generate_n.
#include
using std::cout;
using std::endl;
#include // algorithm definit
http:^^www.cs.wisc.edu^dienst^ui^2.0^describe^ncstrl.uwmadison%2fcs-tr-90-947
Server: Dienst V4-1-1
MIME-version: 1.0
Content-type: text/html
Correctness of an Algorithm for Reconstituting a Program from a Dependence Graph
Correctness of an Algorithm for R
fig23_26.cpp
// Fig. 23.26: Fig23_26.cpp
// Standard Library algorithms fill, fill_n, generate and generate_n.
#include
using std::cout;
using std::endl;
#include // algorithm definit
dbg3ax_1.mnu
CONV3AX#PREF
#
Use#Old#Alg
Toggle whether to use old algorithm always or as a backup.
#
Connect
If disabled, algorithm will only be producing "original" curves.
#
Return#Error
If enabled, the very la
ex6_clusterdistance
#!/usr/perl/perl580/bin/perl
use Algorithm::Cluster;
$^W = 1;
use strict;
use warnings "Algorithm::Cluster";
my $weight = [ 1,1 ];
my $data = [
[ 1.1, 1.2 ],
[ 1.4, 1.3 ],
[ 1.1, 1.5 ],
[