搜索资源列表
含并、交和差运算的集合类型试验报告
- 含并、交和差运算的集合类型试验报告，这个报告是做计算机试验的标准样式，分为了7个模块。-containing, intersection and poor computing pool type test report, the report is made to the standard computer test pattern, divided into seven modules.
集合的交并差运算
- 演示执行集合的并,交,差运算,是以有序链表表示集合.判定子集,求补运算也实现了.-demonstration and implementation of the pool, intersection, difference, computation, is set in an orderly Chain said. Convicted subset, seeking fill operation has been achieved.
jiaojibingji
- 使用顺序表实现的交集并集问题，其中使用了类模板和简单的线性表存储结构。-order to achieve the intersection of sets, which use a class template and a simple linear table storage structure.
duichengcha
- 求两个集合的对称差 ，用户给出输入 程序打印结果,是通过分别求并集，交集而得-for two pools symmetric difference, and give users the importation procedures Print results were seeking through and sets derived intersection
JIHE
- 数据结构的 用有序表实现集合的基本功能~交集 并集 插入 删除~界面美观~可操作性强-data structure using the table to achieve an orderly set of basic function-set intersection and inserted delete ~ ~ operable aesthetic interface strong
ADT
- 实现ADT,可以实现两个二叉树的几种逻辑关系来显示它们之间的联系.如:求两个二叉树是否是等价的.它们的交集并集是怎样的.等等.这样这些都是ADT要实现的方法.-achieve ADT, can achieve two binary tree several logical relationship to show the linkages between them. Such as : whether the binary tree for two are synonymous. The int
几何算法
- 一些常用的几何算法的C++实现,包括两点确定一条直线,两点间距离,点直线距离, 海伦公式求三角形面积,判断直线相交等-some common geometric algorithm C achieved, including two identified a straight line, the distance between two points, point straight distance Helen formula for triangle area, as judged strai
setoperation
- 用单链表实现集合的交、并、差运算，提供共用户选择操作的交互界面，使用命令提示的方式提示用户输入集合1和集合2，然后让用户选择运算方式（交、并、差）等，-Achieved with a single set of cross-linked, and, poor operation, providing a total operation of the user interface options, the way using the command prompt prompts the user
comparestring
- 给定两个集合A、B，集合内的任一元素x满足1 ≤ x ≤ 109，并且每个集合的元素个数不大于105。我们希望求出A、B之间的关系。 任 务 ：给定两个集合的描述，判断它们满足下列关系的哪一种： A是B的一个真子集，输出“A is a proper subset of B” B是A的一个真子集，输出“B is a proper subset of A” A和B是同一个集合，输出“A equals B” A和B的交集为空，输出“A and B are disjoint
SegmentsIntersection
- 计算几何的利用叉积判断线段是否相交的算法，这个算法算法导论上有详细的介绍-The use of computational geometry plot fork intersection to determine whether segments of the algorithm, this algorithm has a detailed introduction to algorithms introduction
set
- 实现了集合的并，交，差,希望大家能偶有帮助，如果能够跟大家共享我感到非常的高兴-achive intersection,union,difference of set
B1_Intersect
- 数据结构典型算法的代码: 关于两条直线是否相交-Data structure of a typical algorithm code: With regard to whether the intersection of two straight lines
DIJKSTRA
- Suppose you want to find the shortest path between two intersections on a map, a starting point and a destination. To accomplish this, you could highlight the streets (tracing the streets with a marker) in a certain order, until you have a route high
table_single
- 顺序表和单链表分别实现集合的并，交，差以及对称差运算-Order to achieve the table and set of single chain, respectively, intersection, difference and symmetric differential operators
intersection
- 这是一个简单的在VC6.0下两个数组求交集的程序-get the intersection of two number groups
shuju
- 单链表的交集，并集，插集，逆置，定位的实现-Single list of the intersection, and set, insert set, reverse home, location of implementation
GIStransportation
- 利用公 交线路路 口作 为顶 点，简化 了传统算 法对复 杂 网络拓扑 图的计 算；同时，利 用乘客 出行 偏好 ．引入 线 网密度来评 价乘客的 出行 方便程度 ，并提 出了一种最短路 径快速搜 索算法．实验证明 ，与传 统算法相比 ，该算法明显提 高了路径搜 索效率． -Intersection as the peak use of bus lines, simplified the traditional algorithm is the calculation of comp
Intersection
- 对于平面内给定的所有的水平或竖直线段，求其交点总数。运用线段树使程序在交点较少时能快于暴力算法-For a given plane, horizontal or vertical line of all, find the intersection number。
Intersection
- 三个数组求交集，先求前面两个数组的交集，在和第三个求交集。-Three arrays is seeking to set intersection, consideration is to seek the intersection of the front of the array, and then seek the intersection of the results and the back. This is the most basic method.
List-for-set-intersection-problem
- 已知两个单链表A与B分别表示两个集合，其元素类型为int且递增排列，其头结点指针分别为a,b。求出A与B的交集，要求C同样以元素值递增的单链表形式储存。-Known two single chain A and B denote two collections whose elements of type int and ascending, the head node pointers are a, b. Find the intersection of A and B, C similarl