代码搜索：Distance
找到约 8,736 项符合「Distance」的源代码
代码结果 8,736
www.eeworm.com/read/235612/14060851
m distpoint.m
function s=distpoint(x,y,xnot,ynot)
% s=distpoint(x,y,xnot,ynot)
%
% This function computes the distance between each pair of points represented
% by the vectors x and y and the single point xnot,yno
www.eeworm.com/read/101788/15815423
c explode.c
/*
Copyright (c) 1990-2002 Info-ZIP. All rights reserved.
See the accompanying file LICENSE, version 2000-Apr-09 or later
(the contents of which are also included in unzip.h) for terms of use.
www.eeworm.com/read/189078/8490784
txt 旅行推销员问题之c语言算.txt
旅行推销员问题之C语言算法[原创]
旅行推销员问题：一位旅行推销员想要访问n个城市中每个城市恰好一次，并且返回到出发点。应如何走才能使总距离最短？其实就是求带权完全无向图中访问每个顶点恰好一次并且返回出发点的总权数最小的回路，即总权数最小的哈密顿回路。
思路：把n个城市做全排列，并求出每种排列对应的总距离，然后选择最短的一个。
推论：把上面求出的最短哈密顿回路看作一个圆，求出最短哈 ...
www.eeworm.com/read/184151/9119666
cpp som_algorithm.cpp
#include
#include
#include
#include
#include
#define InputLayerNum 35
#define OutputLayerRow 8
#define OutputLayerColumn 12
#define to
www.eeworm.com/read/365029/9881395
h msadist.h
#ifndef MSADist_h
#define MSADist_h
#include
double GetScoreDist(const MSA &msa, unsigned SeqIndex1, unsigned SeqIndex2);
class MSADist
{
public:
MSADist(DISTANCE Distance)
www.eeworm.com/read/168039/9941286
cpp som_algorithm.cpp
#include
#include
#include
#include
#include
#define InputLayerNum 35
#define OutputLayerRow 8
#define OutputLayerColumn 12
#define to
www.eeworm.com/read/424747/10417820
m tourdist.m
function tour_distance = tourdist(tourvec, distance_matrix);
% This function is used with Tspsiman.m.
% 2D Euclidian Traveling Salesman Problem (TSP)
% Nearest Neighbor tour construction + 2-Opt lo
www.eeworm.com/read/416829/11012640
cpp radontransformer.cpp
// radontransformer.cpp: implementation of the RadonTransformer class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "RadonTransformer.h"
www.eeworm.com/read/409957/11305988
m tourdist.m
function tour_distance = tourdist(tourvec, distance_matrix);
n_cities = length(tourvec);
city = 1;
tour_distance = 0;
while city
www.eeworm.com/read/404035/11492308
m dijkstra.m
% Dijkstra最短路算法 %
% 作者: 杨建栋%
% 日期: 2009年1月11日%
function [path,short_distance]=Dijkstra(Input_weight,start,endpoint)
% 输入参数:
% Input_weight-------输入边权值矩阵!
% start--------起点;
% endpoint------终点;