相 關(guān) 資 源

• calculates the shortest path and distance between two nodes on a map免費(fèi)下載

  資源簡(jiǎn)介：calculates the shortest path and distance between two nodes on a map

  標(biāo)簽： calculates shortest distance between

  上傳時(shí)間： 2014-06-14

  上傳用戶：372825274

• In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights o免費(fèi)下載

  資源簡(jiǎn)介：In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen...

  標(biāo)簽： optimizing different the shortest

  上傳時(shí)間： 2014-10-25

  上傳用戶：1159797854

• This code implements the shortest path algorithm via the simple scheme and fibonacci heap data struc免費(fèi)下載

  資源簡(jiǎn)介：This code implements the shortest path algorithm via the simple scheme and fibonacci heap data structure. It has 3 kinds of testing data input method : random input by computer, reading from the file, reading from the key board.

  標(biāo)簽： implements algorithm fibonacci the

  上傳時(shí)間： 2013-12-23

  上傳用戶：ynzfm

• Floyd-wharshall algoritm for the shortest path problem. I wrote this in C. It s easy to compile and免費(fèi)下載

  資源簡(jiǎn)介：Floyd-wharshall algoritm for the shortest path problem. I wrote this in C. It s easy to compile and work in all *nix like systems.

  標(biāo)簽： C. Floyd-wharshall algoritm shortest

  上傳時(shí)間： 2017-04-12

  上傳用戶：123456wh

• this process is about how to get the shortest path, this process write by VC++.免費(fèi)下載

  資源簡(jiǎn)介：this process is about how to get the shortest path, this process write by VC++.

  標(biāo)簽： process this shortest about

  上傳時(shí)間： 2014-01-07

  上傳用戶：上善若水

• Dijkstra for the shortest path algorithm免費(fèi)下載

  資源簡(jiǎn)介：Dijkstra for the shortest path algorithm

  標(biāo)簽： algorithm Dijkstra shortest path

  上傳時(shí)間： 2013-12-23

  上傳用戶：13188549192

• This will calculate the shortest path of a graph免費(fèi)下載

  資源簡(jiǎn)介：This will calculate the shortest path of a graph

  標(biāo)簽： calculate shortest graph This

  上傳時(shí)間： 2017-03-11

  上傳用戶：nanshan

• program for astar algoritham to find cheapest path between two nodes免費(fèi)下載

  資源簡(jiǎn)介：program for astar algoritham to find cheapest path between two nodes

  標(biāo)簽： algoritham cheapest program between

  上傳時(shí)間： 2017-06-01

  上傳用戶：蟲蟲蟲蟲蟲蟲

• compute Bhattacharyya distance between two Gaussian classes免費(fèi)下載

  資源簡(jiǎn)介：compute Bhattacharyya distance between two Gaussian classes

  標(biāo)簽： Bhattacharyya Gaussian distance compute

  上傳時(shí)間： 2017-06-18

  上傳用戶：caiiicc

• 最短路徑方法The shortest path method免費(fèi)下載

  資源簡(jiǎn)介：最短路徑方法The shortest path method

  標(biāo)簽： shortest method path The

  上傳時(shí)間： 2013-12-15

  上傳用戶：米卡

• Dijkstra by C is so great for solving algorithm find the shortest path with weigth!免費(fèi)下載

  資源簡(jiǎn)介：Dijkstra by C is so great for solving algorithm find the shortest path with weigth!

  標(biāo)簽： algorithm Dijkstra shortest solving

  上傳時(shí)間： 2013-12-09

  上傳用戶：tedo811

• adhoc in c & c++ it hepls finding the shortest path among adhoc network . it provides advance protoc免費(fèi)下載

  資源簡(jiǎn)介：adhoc in c & c++ it hepls finding the shortest path among adhoc network . it provides advance protocols to find distence vector

  標(biāo)簽： adhoc shortest provides finding

  上傳時(shí)間： 2013-12-14

  上傳用戶：rocketrevenge

• Sample Source to select and Connect to SQL servers on a network.免費(fèi)下載

  資源簡(jiǎn)介：Sample Source to select and Connect to SQL servers on a network.

  標(biāo)簽： Connect network servers Sample

  上傳時(shí)間： 2014-12-20

  上傳用戶：

• this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up免費(fèi)下載

  資源簡(jiǎn)介：this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input erro...

  標(biāo)簽： Traveling Salesman solution Problem

  上傳時(shí)間： 2013-12-22

  上傳用戶：ruixue198909

• Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algo免費(fèi)下載

  資源簡(jiǎn)介：Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)

  標(biāo)簽： Traveling Salesman solution Problem

  上傳時(shí)間： 2013-12-04

  上傳用戶：從此走出陰霾

• shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a免費(fèi)下載

  資源簡(jiǎn)介：shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negati...

  標(biāo)簽： Multiplicative undirected shortest measured

  上傳時(shí)間： 2017-04-08

  上傳用戶：邶刖

• Small utility which calculates the difference in hours and seconds between a starting time and finis免費(fèi)下載

  資源簡(jiǎn)介：Small utility which calculates the difference in hours and seconds between a starting time and finish time. Useful for calculating payroll hours, overtime, etc. with C source code. Freeware.

  標(biāo)簽： calculates difference and starting

  上傳時(shí)間： 2015-02-07

  上傳用戶：jing911003

• A language monitor provides a full duplex communications path between the print spooler and bi-direc免費(fèi)下載

  資源簡(jiǎn)介：A language monitor provides a full duplex communications path between the print spooler and bi-directional printers that are capable of providing software-accessible status information and adds printer control information, such as commands ...

  標(biāo)簽： communications language bi-direc provides

  上傳時(shí)間： 2015-03-29

  上傳用戶：comua

• It will find the minimum distance between the two points input by the user免費(fèi)下載

  資源簡(jiǎn)介：It will find the minimum distance between the two points input by the user

  標(biāo)簽： the distance between minimum

  上傳時(shí)間： 2017-05-15

  上傳用戶：kikye

• Computes the distance between kevin bacon and other actors (six degrees of seperation).免費(fèi)下載

  資源簡(jiǎn)介：Computes the distance between kevin bacon and other actors (six degrees of seperation).

  標(biāo)簽： seperation Computes distance between

  上傳時(shí)間： 2017-08-07

  上傳用戶：zhaoq123

• Cnnects two computers using the very SIMPLE and SMALL visual basic code.免費(fèi)下載

  資源簡(jiǎn)介：Cnnects two computers using the very SIMPLE and SMALL visual basic code.

  標(biāo)簽： computers Cnnects SIMPLE visual

  上傳時(shí)間： 2013-12-18

  上傳用戶：jkhjkh1982

• This project aim was to build wireless software modem for data communication between two computers免費(fèi)下載

  資源簡(jiǎn)介：This project aim was to build wireless software modem for data communication between two computers using an acoustic interface in the voice frequency range (20Hz– 20,000Hz). The transmitting antenna is a speaker (frequency response of: 9...

  標(biāo)簽： communication computers software wireless

  上傳時(shí)間： 2014-05-29

  上傳用戶：wangdean1101

• java Labyrinth game；Provides two kinds to produce map s way stochastically: The stochastic distribut免費(fèi)下載

  資源簡(jiǎn)介：java Labyrinth game；Provides two kinds to produce map s way stochastically: The stochastic distribution point method and the chart depth first traversal the law two kinds.It can searches the shortest way to demonstrate automatically

  標(biāo)簽： stochastically stochastic Labyrinth distribut

  上傳時(shí)間： 2016-06-13

  上傳用戶：qilin

• Algoritm branch and bound and shortest path in C免費(fèi)下載

  資源簡(jiǎn)介：Algoritm branch and bound and shortest path in C

  標(biāo)簽： and Algoritm shortest branch

  上傳時(shí)間： 2013-12-27

  上傳用戶：z1191176801

• This function calculates the ergodic and outage capacity of a MIMO Rayleigh channel considering免費(fèi)下載

  資源簡(jiǎn)介：This function calculates the ergodic and outage capacity of a MIMO Rayleigh channel considering no CSIT (equal power allocation) and perfect CSIT (waterfilling power allocation). In both cases perfect CSIR is assumed. The channel ...

  標(biāo)簽： considering calculates Rayleigh function

  上傳時(shí)間： 2014-12-02

  上傳用戶：pompey

• Function that calculate the PSNR and WSNR of two imagines免費(fèi)下載

  資源簡(jiǎn)介：Function that calculate the PSNR and WSNR of two imagines

  標(biāo)簽： calculate Function imagines that

  上傳時(shí)間： 2013-12-24

  上傳用戶：253189838

• calculates the FFT of any sequence and its written in C language免費(fèi)下載

  資源簡(jiǎn)介：calculates the FFT of any sequence and its written in C language

  標(biāo)簽： calculates language sequence written

  上傳時(shí)間： 2014-08-27

  上傳用戶：cx111111

• This program can caculate the distance of two city免費(fèi)下載

  資源簡(jiǎn)介：This program can caculate the distance of two city

  標(biāo)簽： caculate distance program This

  上傳時(shí)間： 2017-06-29

  上傳用戶：zhoujunzhen

• This program is used to find the union, intersection and exclusive OR for given two sorted arrays.免費(fèi)下載

  資源簡(jiǎn)介：This program is used to find the union, intersection and exclusive OR for given two sorted arrays.

  標(biāo)簽： intersection exclusive program arrays

  上傳時(shí)間： 2014-12-07

  上傳用戶：wang5829

• Ambiguity between two signal, correlation and error calculate免費(fèi)下載

  資源簡(jiǎn)介：Ambiguity between two signal, correlation and error calculate

  標(biāo)簽： correlation Ambiguity calculate between

  上傳時(shí)間： 2013-12-27

  上傳用戶：skhlm