Search - pipeline

Search - pipeline - List

[Data structs] pipe DL : 0: 输油管道，该管道要穿过n口井，每口井与主管道相连，且为最短路径-Oil pipeline, the pipeline to pass through n wells, each well connected with the director of Road, and for the shortest path
Date : 2025-12-21 Size : 1kb User : lyh
[Data structs] guandao DL : 0: 某石油公司计划建造一条由东向西的主输油管道，这条管道要穿过n口油井的油田，每口油井通过一条次管道沿最短路径（或南或北）直接与主管道相连。就n口油井分布的一般位置，试确定主管道位置，使得各油井到主管道的输油管道长度总和达到最小。并验证可在线性时间内确定主管道的最优位置。-An oil company plans to build a from east to west of the main oil pipeline, this pipeline to pass through n wells of oil fields, oil wells in every through a second pipeline along the shortest path (or South or North) directly connected with the competent Road. Wells on the n distribution of the general location, test to determine the competent Road location, making the well-to-charge of Road to minimize the sum of the length of pipeline. And verify that the linear time can be in charge of Road to determine the optimal location.
Date : 2025-12-21 Size : 1kb User : me
[Data structs] pipeline DL : 0: 实现对最佳路径的选择，算法，通俗的讲就是对石油管道的路径选择-The best path to achieve the choice of algorithm, popular speakers is to choose the path of oil pipeline
Date : 2025-12-21 Size : 44kb User : song
[Data structs] shuyouguandao DL : 0: 问题描述：某石油公司计划建造一条由东向西的主输油管道。该管道要穿过一个有n 口油井的油田。从每口油井都要有一条输油管道沿最短路经(或南或北)与主管道相连。如果给定n口油井的位置,即它们的x 坐标（东西向）和y 坐标（南北向）,应如何确定主管道的最优位置,即使各油井到主管道之间的输油管道长度总和最小的位置? 编程任务：给定n 口油井的位置,编程计算各油井到主管道之间的输油管道最小长度总和。-Problem Description: A oil company plans to build a main oil pipeline from east to west. The pipeline must pass through a n wells in oil fields. From each of wells must have an oil pipeline along the Shortest Path (or the South or North) and the director of Road connected. If for a given n the location of wells, that is, their x coordinates (east-west) and y coordinates (north-south), should be how to determine the optimal position in charge of Road, even though the well-to-head Road, the length of the pipeline between the sum of the minimum position? programming tasks: Given the location of wells n, programming calculate their well-to-head Road, the minimum length of the pipeline between the sum of.
Date : 2025-12-21 Size : 7kb User : 李东
[Data structs] HomeworkControl DL : 0: 一个用C++语言描述的流水线调度的最短的调度算法。-One with C++ language to describe the shortest pipeline scheduling scheduling algorithm.
Date : 2025-12-21 Size : 345kb User : 天涯沦落人
[Data structs] urban-pipeline DL : 0: 数据结构练习。C语言解决城市管道铺设问题。某有若干区域，在一些中心区之间存在道路相连，这些道路的长度已知。现在你接到了在城市中铺设管线的任务，假设管线只能够在已有的道路下方埋设，要求管线能够到达城市的所有区域，请你提供一套铺设方案，使管线总长度最短。-Data structure exercises. C language to solve urban pipeline problems. There are a number of areas, in some way connected between the central area, the length of these roads are known. Now that you received in the city, the task of laying the pipeline, the pipeline can only assume that the road has been laid under, requiring pipelines to reach all areas of the city, please provide a paving program, so that the total length of the shortest line.
Date : 2025-12-21 Size : 741kb User : 靳舒馨
[Data structs] median DL : 0: 本程序采用寻找中位数的方法来解决现实中遇到的寻找最佳输油管道问题。通过编译链接和运行，可以获得理想的结果。-This program uses the median to find ways to solve real problems encountered in finding the best pipeline. Compile and run through the links, you can get a good result.
Date : 2025-12-21 Size : 178kb User : 胡锦龙
[Data structs] fifo_read DL : 0: fifo_read管道读取信息，和管道写信息配合使用-fifo_read read the information pipeline, and pipelines used in conjunction with written information
Date : 2025-12-21 Size : 1kb User : yy
[Data structs] Pipeline-problem DL : 0: 使用C++语言实现了分治和递归的算法，有一定的帮助。-C++ language using a divide and conquer and recursive algorithms, have some help.
Date : 2025-12-21 Size : 1kb User : rucy
[Data structs] City-Shop-pipeline-problem DL : 0: 需要在某个城市n个居民小区之间铺设煤气管道，则在这n个居民小区之间只需要铺设n-1条管道即可。假设任意两个小区之间都可以铺设管道，但由于地理环境不同，所需要的费用也不尽相同。选择最优的方案能使总投资尽可能小，这个问题即为求无向网的最小生成树。-Needs in a residential area between the n cities laying gas pipelines, in the residential area between the n n-1 only the laying of the pipeline can be. Assumed between any two communities can lay the pipeline, but because of different geographical environment, the required fees are not the same. Choose the best solution to make a total investment of as small as possible, the problem is they try to net a minimum spanning tree.
Date : 2025-12-21 Size : 22kb User : 冯柳鑫
[Data structs] guandao DL : 0: 输油管道问题算法设计语言C语言编写输油管道问题算法设计语言C语言编写-Pipeline problem algorithms written in C language algorithm pipeline issue is written in C language
Date : 2025-12-21 Size : 1.09mb User : cc
[Data structs] pipeline DL : 0: 某石油公司计划建造一条由东向西的主输油管道。该管道要穿过一个有n 口油井的油田。从每口油井都要有一条输油管道沿最短路经(或南或北)与主管道相连。如果给定n口油井的位置,即它们的x 坐标（东西向）和y 坐标（南北向）,应如何确定主管道的最优位置,即使各油井到主管道之间的输油管道长度总和最小的位置?证明可在线性时间内确定主管道的最优位置。给定n 口油井的位置,编程计算各油井到主管道之间的输油管道最小长度总和。-Oil pipeline Problem iadhf djsfhl sdhnfkj sldf dsfdkgs
Date : 2025-12-21 Size : 2kb User : 谢天喜
[Data structs] shuyouguandao DL : 0: 使用递归算法实现输油管道问题，并设计出管道的解决方案-Use recursion algorithm to realize the oil pipeline, and designed a pipeline solutions
Date : 2025-12-21 Size : 1kb User : 欧阳
[Data structs] shuYouguandao DL : 0: 输油管道问题，从文件读取站点位置求到所有站点距离最短的管道位置-The pipeline problems from the location of the file to read the site and to all the sites the shortest distance pipeline location
Date : 2025-12-21 Size : 500kb User : 高洁
[Data structs] 3 DL : 0: 根据题目可分析：假设主管道位于所有管道的东侧（或是西侧），则测得个油井到主管道之间的输油管道总长度为sum1，若主管道的位置位于所有管道纵坐标的中位值，其输油管道总长度为sum2。由此可推算出sum1>=sum2。因此我采用第二个思路，进而将问题转化为求n个数中第k大数是什么的问题。总的输油管道长度可通过每个输油管道的纵坐标减中位值得到，最后即可解决问题。根据题目要求，需在线性时间内确定主管道的最优位置。在排序算法中，最优的便是快速排序，而根据题目要求，我们又不需要将所有n个数进行排序，因此可以采用快速排序的思想，达到目的。(According to the subject analysis, it is assumed that the chief pipeline is located on the east side of all pipes (or the west side), the total length of the oil pipeline between the oil well and the main pipe is sum1. If the position of the main pipe is located in the middle of all the longitudinal coordinates of the pipe, the total length of the pipeline is sum2. Thus, sum1>=sum2 can be calculated. So I use second ideas to transform the problem into the problem of finding K number in N numbers. The length of the total oil pipeline can be obtained by reducing the median value of each oil pipeline, and finally, it can solve the problem. According to the requirements of the subject, we need to determine the optimal location of the main pipeline in a linear time. In the sorting algorithm, the best is the fast sorting, and according to the title, we do not need to sort all the N numbers, so we can use the idea of fast sorting to achieve the goal.)
Date : 2025-12-21 Size : 592kb User : 鲸鱼和机遇