Search - PIPE - CodeBus

Search - PIPE - 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-24 Size : 1kb User : lyh
[Data structs] Pipe DL : 0: Pipe yuyin voice pipe smart-Pipe
Date : 2025-12-24 Size : 1kb User : deepin
[Data structs] SA DL : 0: 压缩包中的工程包含了三种风格。adtstyle文件夹对应的是抽象数据风格，invretstyle文件夹对应的是调用返回风格，pipestyle文件夹对应的是管道过滤器风格。源代码是用MyEclipse 6.5写的。可直接将工程导入MyEclipse中即可运行，也可以运行SA文件夹里面的start.bat选择某个风格运行。抽象数据风格的按字母排序算法用的是快速排序算法，代码位于SA\src\adtstyle\impl.AlphabetizerImpl.java，调用返回风格用的是插入排序算法，代码位于SA\src\invretstyle\Alphabetizer.java，管道过滤器风格用的是堆排序算法，代码位于SA\src\pipestyle\Alphabetizer.java。三种风格都对一些噪音词汇进行过滤，private static final String ignore = "a#$an#$and#$as#$is#$the#$of#$"，上面语句中由"#$"间隔开的就是噪音词汇。SA\input.txt是输入文件，可对其进行配置来解析不同的文本。-The compression works package includes three different styles. adtstyle folder corresponding abstract data style, invretstyle folder corresponding to the call returns the style, pipestyle folder corresponding to the pipe filter style. The source code is written using MyEclipse 6.5. Directly to the project into MyEclipse to run can run SA folder inside the start.bat select a style run. Abstract data-style alphabetical sorting algorithm is quick sort algorithm, the code is located in SA, \ src \ adtstyle \ impl.AlphabetizerImpl.java, call return style is the insertion sort algorithm, the code in SA \ src \ invretstyle \ Alphabetizer.java pipe filter style using a heap sort algorithm, the code is located in SA, \ the src the \ pipestyle \ Alphabetizer.java. Three styles of some noise words filter private static final String ignore = " a# $ an# $ and# $ as# $ is# $# $ of# $" , " # $" in the above statement spaced noise words. SA, \ input.txt yes the input file can be confi
Date : 2025-12-24 Size : 38kb User : 杨诗听
[Data structs] aguasprofundas2 DL : 0: Forces and strress in an oil drilling pipe
Date : 2025-12-24 Size : 1kb User : avitua
[Data structs] 自来水管道架设问题 DL : 0: 自来水管道架设问题【问题描述】若要在八个居民区（A区、B区、C区、D区、E区、F区、G区、H区）之间架设自来水管道，如何以最低的经济代价架设这个自来水管道。【基本要求】利用二种方法Prim算法和克鲁斯卡尔Kruskal算法生成自来水管道的架设方案(Two methods, Prim algorithm and Cruise Carle Kruskal algorithm are used to generate the water pipe erection scheme)
Date : 2025-12-24 Size : 2kb User : ls291730
[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-24 Size : 592kb User : 鲸鱼和机遇