搜索资源列表
Kruskal.cpp
- 在权值不同的图中寻找一个最小生成树的问题-different weights in the map to find a minimum spanning tree problem
gfloyd
- 本源程序为matlab文件，实现最小生成树和关键路径的查找。-the source document for Matlab and achieve minimum spanning tree and find the critical path.
minimum-cost-maximum-flow
- 用于求解网络的最小费用最大流问题，求一个网络中的最大流-Network for solving the minimum cost maximum flow problem, find the maximum flow in a network
Find
- 北邮复试上机题（两种方法）： Descr iption 在平面上的n个点中找出横坐标最小的点。 Input 第一行是一个正整数n（1<=n<=1000），表示一共有n个点。 接下来n行，每行2个整数，分别表示每个点的横坐标和纵坐标。 Output 输出横坐标最小的那个点的横坐标和纵坐标，如果横坐标最小的点有多个，则只输出其中纵坐标最小的那个点。 Sample Input 5 5 2 2 3 2 4 3 2 4 1 Sampl
Find-the-even-minimum-value
- 用汇编实现寻找偶数中最小值，程序中事先给定偶数序列-Assembly language even find the lowest value in, program given a array for even
localnormalizematlab
- Stretches contrast on the image and normalize image from 0 to 1 The main difference of this function to the standard streching functions is that standard function finds global minimum and maximum on the image, then uses some low and high
Minimum-Path-Algorithm
- 算法名称：Dijkstra最短路算法。 算法功能：在存在障碍物的场景下，寻找两点之间的最短路径-Algorithm name: Advanced Dijkstra s Minimum Path Algorithm. Algorithm function: find the minimum path between two points under obstacle scenarios
minimum
- 使用vb编写的超找最小数的代码，非常适合vb初学者学习-a program to find the minimum during numbers
DG-using-PGSA
- plant growth simulation algorithm to find minimum power loss values
diophantine
- use to find minimum variance
101522103_hw1_v3
- The code is to find minimum value by using interval-halving method.
find-the-posotion-of-elements
- 随机产生100个3位数以内的数，存放在一组数组中，并查找最大元素和最小元素的位置。-100 three-digit randomly generated number within, stored in a set of array and find the maximum and minimum elements of the position of elements.
Minimum-Cost-Flow
- 最小费用最大流问题是经济学和管理学中的一类典型问题。在一个网络中每段路径都有“容量”和“费用”两个限制的条件下，此类问题的研究试图寻找出：流量从A到B，如何选择路径、分配经过路径的流量，可以达到所用的费用最小的要求。-Minimum cost maximum flow problem is economics and management in a class of typical problems. Each path in a network has the " capacity&q
MDS_Project
- A combining breadth-first search (BFS) or depth-first search (DFS) with aware range to find minimum connected dominating set A backbone in a Wireless Sensor Network (WSN) reduces the communication overhead, increases the bandwidth efficiency, de
Find-Max-Min
- 生成随机数字点击查询后自动查找最大值最小值-Automatically find the maximum value of the minimum random number generated after clicking Query
minimum
- 使用vb编写的超找最小数的代码，非常适合vb初学者学习-a program to find the minimum during numbers
Tower_of_hanoi_solver
- programme to find minimum step to solve multi pegs towers of hanoi
tsp_code
- c code for tsp to find minimum cost for travelling
Binary-Search-Tree
- 实现了二叉查找树的各种操作：插入结点、构造二叉树、删除结点、查找、 查找最大值、查找最小值、查找指定结点的前驱和后继-Achieve a binary search tree of various operations: Insert node binary tree structure, delete nodes, find, find maximum, find minimum, look for the specified node predecessor and successor
8.7-8.9 MattoList Prim Dijkstra
- 采用prim算法和kruskal算法求最小生成树 采用dijkstra算法求从顶点到其他顶点的最短路径和最短路径长度。(Using prim algorithm and Kruskal algorithm to find minimum spanning tree Dijkstra algorithm is used to find the shortest path and the shortest path length from vertex to other ver