Search - COST 2

Search - COST 2 - List

[Data structs] 4th_AOE DL : 0: 数据结构算法，aoe ，图的最小代价路径检索。-data structure algorithms, aoe, for the minimal cost path retrieval.
Date : 2025-12-25 Size : 37kb User : 王回
[Data structs] ddt DL : 0: 算法设计于分析中的多段图问题，用VC编写应用动态规划的算法设计方法，利用最优性原理以及所获得的递推关系式求取最优决策序列，通过多段图的定义，找到由源点s到汇点t的最小成本路径，进而可以灵活解决可以用多段图描述的许多实际问题.-algorithm design in the analysis of many of the map, prepared with VC dynamic programming algorithm design, the optimum principle as well as the recursive relation to strike the optimal sequence of decision-making through more of the map defined by the source to find s t point to the Department of the minimum cost paths and further a flexible solution could spend more of the map describes the many practical problems.
Date : 2025-12-25 Size : 1kb User : 范铮
[Data structs] BoundAndBranch DL : 1: 我的算法作业，求一个在总花费小于1500的条件下从源结点到目的结点的最短路径，源代码Tree.cpp（C++语言编写，VC++6.0 IDE下调试通过），利用的是分支定界算法。可执行文件Tree.exe说明在ReadMeFirst请按照说明使用。-algorithm operations, for a total cost of less than 1,500 from the source node to node purpose of the shortest path, Tree.cpp source code (written in C, Visual C++ 6.0 IDE debug through), use of the branch-and-bound algorithm. Note executable file Tree.exe in ReadMeFirst follow the instructions to use.
Date : 2025-12-25 Size : 30kb User :
[Data structs] quanguojiaotongzixun DL : 0: 用最短路径解决. 提供三种最优决策:最快到达,最少费用,最少中转站.-solution with the shortest path. For three optimal decision : fastest to reach at least cost, at least transfer stations.
Date : 2025-12-25 Size : 2kb User : 杨婕
[Data structs] kthtree DL : 0: kthtree问题给定一棵有向树T，树T 中每个顶点u都有一个权w(u)；树的每条边(u,v)也都有一个非负边长d(u,v)。有向树T的每个顶点u 可以看作客户，其服务需求量为w(u)。每条边(u,v)的边长d(u,v) 可以看作运输费用。如果在顶点u 处未设置服务机构，则将顶点u 处的服务需求沿有向树的边(u,v)转移到顶点v 处服务机构需付出的服务转移费用为w(u)*d(u,v)。树根处已设置了服务机构，现在要在树T中增设k处服务机构，使得整棵树T 的服务转移费用最小-kthtree problems to be fixed to a tree T, T trees each vertex u have a right to w (u); Tree edges (u, v) also have a non-negative side length d (u, v). T to a tree each vertex u can be seen as customers, the demand for its services w (u). Edges (u, v) of length d (u, v) can be considered as transportation costs. If the vertex u Department had not set up the service agencies, will be the culmination u demand for services to a tree along the edge (u, v) v transferred to Vertex's services agencies are required to pay a service fee for the transfer of w (u)* d (u, v). Christopher has set up a service sector, is now in the tree to add k T's services agencies, T entire tree makes the shift to the smallest cost
Date : 2025-12-25 Size : 213kb User : wu
[Data structs] zuixiaoshengchengshu DL : 0: 最小生成树问题若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。（1）利用克鲁斯卡尔算法求网的最小生成树。（2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。（3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.
Date : 2025-12-25 Size : 1kb User : wangjian
[Data structs] 8queen_sc DL : 0: #if !defined(AFX_GAQUEEN_H__C26AE0A3_F9B4_426F_A324_B460CC7946CB__INCLUDED_) #define AFX_GAQUEEN_H__C26AE0A3_F9B4_426F_A324_B460CC7946CB__INCLUDED_ #if _MSC_VER > 1000 #pragma once #endif // _MSC_VER > 1000 class CGAQueen { public: CGAQueen(int nPopulation,int nIteration,float Mutation,int mChBoard) virtual ~CGAQueen() void Clear() // to clear chess board with 0 value void InitialPopulation() // to create the first and initial randompopulation void FillArea(int index) // to fill chess board with desired chromosome int CostFunc(int index) // determine the cost of matrix[index][index] void PopulationSort() // to sort population from the best to the worst void GenerateCrossOverMatrix() // a way to create children from parent is CcrossOver void Mating() // to create children from parents void Ap
Date : 2025-12-25 Size : 2kb User :
[Data structs] prim DL : 0: 掌握Prim算法的特点，学会用Prim算法构造最小生成树如果无向连通图是一个网，那么它的所有生成树中必有一棵树的边的权值总和为最小，我们称这棵生成树为最小生成树。在Prim算法中，在图G=(V,E)（V表示顶点，E表示边）中任选一点V0，令集合U={V0}为初态，从V0出发寻找与U中顶点相邻（另一顶点在V中）且代价最小的边的另一顶点V1，并使V1加入U，即U={V0，V1}，同时（V0，V1）边加入集合T中（T的初态为空），这样不断地扩大U,直到U=V，则T中即为最小生成树的边。 -Grasp the characteristics of Prim algorithm, learning algorithm constructed by Prim minimum spanning tree if the undirected connected graph is a network, then it must be all the spanning tree in the side of a tree weight value sum for the smallest, spanning tree, we called for minimum spanning tree. In the Prim algorithm, in Figure G = (V, E) (V said vertex, E said that edges) in one point V0, the collection U = (V0) for the initial state, starting from V0 to find the adjacent vertex of U (another vertex in V in) and the cost of the other side of the smallest vertex V1, and V1 to join U, namely U = (V0, V1), at the same time (V0, V1) to include in the collection side of T in (T of the initial state is empty), this continues to expand U, until U = V, then T is the minimum spanning tree in the side.
Date : 2025-12-25 Size : 1kb User : 燕
[Data structs] jiaotong DL : 0: 交通系统的模拟程序，主要有最短路径和最少花费-Transport system simulation program, there are the shortest path and minimum cost
Date : 2025-12-25 Size : 657kb User : 碧波
[Data structs] kmt DL : 0: 　给定一棵有向树Ｔ，树Ｔ中每个顶点u都有一个权w[u]，树的每条边[u,v]也都有一个非负边长d[u,v]。有向树Ｔ的每个顶点u可以看做客户，其服务需求量为w[u]。每条边[u,v]的边长d[u,v]可以看做是运输费用。如果在顶点u处未设置服务机构，则将顶点u处的服务需求沿有向树的边（u,v]转移到顶点v处服务机构，则需付出的服务转移费用为w[u]*d[u,v]。树根处已设置了服务机构，现在要在树Ｔ中增设k处服务机构，使得整棵树Ｔ的服务转移费用最小。该算法对于给定的有向树Ｔ，计算在树Ｔ中增设k处服务机构的最小服务转移费用。 -Given to have a tree T, the tree T for each vertex u has a right to w [u], each tree edge [u, v] also has a non-negative edge length d [u, v]. Tree T has to each vertex u can be seen as customers, demand for their services w [u]. Each edge [u, v] of side length d [u, v] can be seen as are transportation costs. If vertex u Department is not set service agencies will be vertex u Services Department needs to have trees along the edge [u, v] transferred to the vertex v Department service agencies, it would take to pay the service fee for the transfer of w [u]* d [u, v]. Shugen Services Department has set up institutions, now in the tree T and a new k Department service agencies, making整棵Transfer Service tree T of minimum cost. The algorithm for a given directed tree T, calculated in the tree T and a new k services agencies transfer the cost of the smallest services.
Date : 2025-12-25 Size : 1kb User : yxd
[Data structs] ACM_template DL : 0: 本人参加ACM竞赛使用的一些算法模板，包括二分图匹配，欧拉回路的构造以及网络流中的最大流与最小费用最大流等，可以说实战性非常强。-ACM competitions I take part in a number of algorithms used in templates, including two sub-graph matching, Euler circuit, as well as network flow structure of the maximum flow and minimum cost maximum flow, etc., it can be said of very strong combat.
Date : 2025-12-25 Size : 14kb User : 诗苇
[Data structs] MinimumSpanningTree DL : 0: 在图形中若于个边(edge)上加上一些值，此数值称为比重( weight ) 。而此图形称为比重图形(Weight Graph ) ，若weight是成本( cost )或距离( distance ) ，则称此图形为网路( Network )。根据Spanning Tree的定义，知一个图形可有许多不同spanning tree ，在network中找出一个具有最小成本( Cost )的Spanning tree ，则此Spanning tree称为最小成本生成树。-If in the graph in a side (edge) to add some value, this value as the proportion (weight). This graph is called the proportion of graphics (Weight Graph), if the weight is the cost (cost) or distance (distance), said the graphics for the network (Network). Spanning Tree in accordance with the definition of a graph to know there are many different spanning tree, in the network to find a minimum cost (Cost) of the Spanning tree, then the minimum cost Spanning tree known as the spanning tree.
Date : 2025-12-25 Size : 3kb User : lll
[Data structs] Kruskal DL : 0: 本文件是数据结构中很重要的一个图的Kruskal算法。Kruskal算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。将文件编译，可完成Kruskal算法-This document is a very important data structure of a graph algorithm of Kruskal. Kruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left side will not have to select a loop with the smallest cost of the edge of the edge has been selected to join the collection. Documents compiled, to be completed by Kruskal Algorithm
Date : 2025-12-25 Size : 4kb User : 吉铭
[Data structs] railroad DL : 0: 在n个城市之间修建高速公路，使任意两个城市之间都有城市相连，且费用最少-Build roads between some cities, make sure that you can get anywhere from everywhere,besides, the cost is least
Date : 2025-12-25 Size : 1kb User : hitzhc
[Data structs] Prim DL : 0: 普利姆算法的C++实例演示。用于求无向网的最小代价生成树-Pliem algorithm C++ instance of the presentation. Undirected network for minimum cost Spanning Tree ... ... ... ...
Date : 2025-12-25 Size : 1kb User : Lay one
[Data structs] applicationoftheshortestpathalgorithm DL : 0: 本代码是对地杰克斯最短路径算法的应用，用于求解铁路旅游的费用最优解。-This code is the shortest path algorithm to the application of Jack, used to solve the optimal solution cost of rail travel.
Date : 2025-12-25 Size : 4kb User : 陈飞
[Data structs] Europe_travel DL : 0: 利用dijkstra算法实现城市间的最短路径和最小花费，利用stl模版类map实现-Dijkstra algorithm using the shortest path between cities and the smallest cost, the use of stl map implementation template class
Date : 2025-12-25 Size : 4kb User : 昊
[Data structs] mincostflow DL : 0: 实现的是最小费用最大流问题，在残量网络中找s-t最短路，运用bellman-ford算法。-To achieve the minimum cost maximum flow problem, in the residual network, find the shortest st, the use of bellman-ford algorithm.
Date : 2025-12-25 Size : 1kb User : 张佳静
[Data structs] stone DL : 0: 动态规划-最小代价子母树源码，主要提供参考。-Dynamic Programming- PIP minimum cost tree source, the main reference.
Date : 2025-12-25 Size : 1kb User : gyh
[Data structs] Minimum-spanning-tree DL : 0: Kruskal算法和Prim算法任何只由G的边构成,并包含G的所有顶点的树称为G的生成树(G连通). 加权无向图G的生成树的代价是该生成树的所有边的代码(权)的和. 最小代价生成树是其所有生成树中代价最小的生成树.-Kruskal algorithm and Prim algorithm Any edge of only by G, is composed of all the vertices containing G tree called G of the spanning tree (G connected). The weighted no directed graph G is the price of spanning tree all the spanning tree right on the edge of the code () and. The lowest cost spanning tree is in all its spanning tree minimum cost of the spanning tree.
Date : 2025-12-25 Size : 1kb User : 江洋

« 12 3 »