Search - pairing

Search - pairing - List

[Data structs] code DL : 0: 一个效率还可以的配对堆 Fibonacci Heap太难写了配对堆可以有效替代Fibonacci Heap 附带了用它实现的Dijkstra 复杂度O(nlogn+e) -An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)
Date : 2025-12-19 Size : 3kb User : 武永基
[Data structs] SSP DL : 0: I implement Dijkstra s Single Source Shortest Path, say SSP, algorithm for directed graphs using a simple data structure, say simple scheme, Fibonacci heaps, say F-heap scheme, and Pairing heaps, say P-heap scheme, and measure the relative performance of the three implementations.
Date : 2025-12-19 Size : 205kb User : LA
[Data structs] shuju DL : 0: 书中使用主流的程序设计语言C++作为具体的实现语言。书的内容包括表、栈、队列、树、散列表、优先队列、排序、不相交集算法、图论算法、算法分析、算法设计、摊还分析、查找树算法、k-d树和配对堆等。 -Book using mainstream programming language C++ as a specific implementation language. The book includes tables, stacks, queues, trees, hash tables, priority queues, sorting, disjoint set algorithm, graph theory, algorithms, algorithm analysis, algorithm design, amortized analysis, search tree algorithms, kd trees and pairing heaps and so on.
Date : 2025-12-19 Size : 111kb User : 任鹏富
[Data structs] app0304 DL : 0: 实现舞会配对，队列的删除与排列，实现先来先找舞伴-Achieve ball pairing, delete the queue and order, to achieve the first to find someone to partner
Date : 2025-12-19 Size : 35kb User : sdjzlxl
[Data structs] parentheses-design DL : 0: 假设一个算数表达式中可包含三种括号：圆括号，方括号和花括号且这三种括号可以按任意次序嵌套使用。试利用栈的运算，编写判别表达式中所含括号是否正确配对出现的算法-Suppose an arithmetic expression can contain three brackets: parentheses, brackets and braces and three brackets can be nested in any order. The trial use of the computing stack, the preparation of the algorithm is correct pairing of the discriminant expression contained in parentheses appear
Date : 2025-12-19 Size : 2kb User : 陈磊
[Data structs] PairingHeap DL : 0: 配对堆数据结构与算法分析 in C 按照书中算法实现-Pairing heap Data Structure And Algorithm Analysis In C
Date : 2025-12-19 Size : 2kb User : aa
[Data structs] checkcharscorrect DL : 0: 2、设计算法判断一个算术表达式的圆括号是否正确配对。第一个式子： 1*(2+3*(4*(2-1)*(3+x)+5)-6) 能够正确匹配第二个式子： 1*(2+3*4*(2-1)*(3+x)+5)-6) 不能够正确匹配 -Design algorithm to determine an arithmetic expression in parentheses is correct pairing. The first equation: 1* (2+3* (4* (2-1)* (3+x)+5)-6) can correctly match the second equation: 1* (2+3* 4* (2-1)* (3+x)+5)-6) can not correctly match
Date : 2025-12-19 Size : 1kb User : 黄少杰
[Data structs] 1206 DL : 0: Description 对给定一个Pascal源文件，请检查其中 (1)begin与end (2)if,then,else 是否合法配对。-Description given a Pascal source file, check which (1) begin and end (2) if, then, else the legality of pairing.
Date : 2025-12-19 Size : 206kb User : zan
[Data structs] 3.2 DL : 0: 试写一个判别表达式中开、闭括号是否配对出现的算法。-Try to write a discriminant expression open and close parentheses appear if pairing algorithm.
Date : 2025-12-19 Size : 1kb User : hiccup
[Data structs] Data_Structure_Code DL : 0: 运用基本的数据结构操作，实现简单的功能。其中INVERSE代码实现了一组至多组整形数在单链表中的反序输出操作；mypoly代码实现了多项式在单链表的加减法输出；operation代码实现了利用穿拼接出最大的整形数；括号配对1代码实现了一组至多组括号字符的用顺序栈检查配对情况；身高排序插入代码实现单链表的插入操作。-Using the basic data structure operations to achieve some simple functions. INVERSE code sets up a group of integers reverse order output operations in a single linked list mypoly code displays polynomial subtraction output in a link list operation code through the use of stitching the largest number of combination 括号配对1 code sets up a set of parentheses characters with a sequence of stack checking pairing 身高排序插入 code conducts singly linked list insertion.
Date : 2025-12-19 Size : 3kb User : 杨光浦