Location:
Search - tree ms
Search list
Description: 图论算法库 C++ 语言实现
代码内容 图论算法库，包括以下算法：
单源最短路径 Dijkstra 算法
单源最短路径 Bellman-Ford 算法
最小生成树 Prim 算法
每对节点间最短路径 Flod-Warshall 算法
语言 C++
编译平台 VisualAge C++ 4.0
作者 starfish (starfish.h@china.com)
备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。
该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。 虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -graph algorithm for C language code content graph algorithm library, including the following algorithm : single-source shortest path algorithm Dijkstra single source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod - Warshall ALGOL C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, the VisualAge C 4.0 debugging through. The compressed file contains all Graph.h the library, the procedure call interface, see the Notes. Other documents algorithm is used to test the test procedures in VisualAge C compiler running under 4.0. The algorithm is for me to participate in ACM / Illinois prepared to contest the information, because the competition for high speed
Platform: |
Size: 10202 |
Author: 罗鹏魁 |
Hits:
Description: musicTree is a java application that allows you to view and play your MP3 files from a tree which sorts albums by artist. It allows you to easily navigate your music collection and play albums at random, to play all the songs by a specific artist etc.
-musicTree is a java application that allow s you to view and play your MP3 files from a tree wh ich sorts albums by artist. It allows you to Easi ly navigate your music collection and play Albu ms at random, to play all the songs by a specific artist etc.
Platform: |
Size: 142794 |
Author: 陆游 |
Hits:
Description: 一个模拟MS-DOS的程序，用一个txt文件模拟硬盘，实现分块，实现了
dir,edit,delete,cd,tree....等20余种类DOS命令-a simulation of MS-DOS program, a simulated document txt hard to achieve block, achieved dir, edit, delete, cd, tree .... more than 20 types of DOS command
Platform: |
Size: 32320 |
Author: swb |
Hits:
Description: 图论算法库 C++ 语言实现 代码内容 图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。 该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。 虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 - -graph theory is the C language code as graph theory algorithm library, including the following algorithm : single source Dijkstra shortest path algorithm for single-source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod - Warshall algorithm language C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, VisualAge C 4.0 debugging through. The compressed file contains Graph.h all library functions, procedures call interface see Notes. Other documents are used to test the algorithm testing procedures, the VisualAge C compiler running under 4.0. The algorithm is to participate in the ACM / ICPC contest and the preparation of information, because the competit
Platform: |
Size: 4275 |
Author: kelly |
Hits:
Description: 图论算法库 C++ 语言实现
代码内容 图论算法库，包括以下算法：
单源最短路径 Dijkstra 算法
单源最短路径 Bellman-Ford 算法
最小生成树 Prim 算法
每对节点间最短路径 Flod-Warshall 算法
语言 C++
编译平台 VisualAge C++ 4.0
作者 starfish (starfish.h@china.com)
备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。
该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。 虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -graph algorithm for C language code content graph algorithm library, including the following algorithm : single-source shortest path algorithm Dijkstra single source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall ALGOL C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, the VisualAge C 4.0 debugging through. The compressed file contains all Graph.h the library, the procedure call interface, see the Notes. Other documents algorithm is used to test the test procedures in VisualAge C compiler running under 4.0. The algorithm is for me to participate in ACM/Illinois prepared to contest the information, because the competition for high speed
Platform: |
Size: 10240 |
Author: 罗鹏魁 |
Hits:
Description: musicTree is a java application that allows you to view and play your MP3 files from a tree which sorts albums by artist. It allows you to easily navigate your music collection and play albums at random, to play all the songs by a specific artist etc.
-musicTree is a java application that allow s you to view and play your MP3 files from a tree wh ich sorts albums by artist. It allows you to Easi ly navigate your music collection and play Albu ms at random, to play all the songs by a specific artist etc.
Platform: |
Size: 142336 |
Author: 陆游 |
Hits:
Description: 一个模拟MS-DOS的程序，用一个txt文件模拟硬盘，实现分块，实现了
dir,edit,delete,cd,tree....等20余种类DOS命令-a simulation of MS-DOS program, a simulated document txt hard to achieve block, achieved dir, edit, delete, cd, tree .... more than 20 types of DOS command
Platform: |
Size: 31744 |
Author: swb |
Hits:
Description: 图论算法库 C++ 语言实现 代码内容 图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。 该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。 虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 - -graph theory is the C language code as graph theory algorithm library, including the following algorithm : single source Dijkstra shortest path algorithm for single-source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall algorithm language C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, VisualAge C 4.0 debugging through. The compressed file contains Graph.h all library functions, procedures call interface see Notes. Other documents are used to test the algorithm testing procedures, the VisualAge C compiler running under 4.0. The algorithm is to participate in the ACM/ICPC contest and the preparation of information, because the competit
Platform: |
Size: 4096 |
Author: |
Hits:
Description: 类似魔兽的游戏,类似魔兽的游戏 类似魔兽的游戏-Similar Warcraft game, similar to the game similar to Warcraft Warcraft Game
Platform: |
Size: 6284288 |
Author: 单宝波 |
Hits:
Description: 修改过的 MS 组件 可能通过点击目录树的文本打开目录树-Revised MS components may be by clicking on the text of the directory tree to open the directory tree
Platform: |
Size: 5120 |
Author: wangyao |
Hits:
Description: XML毕竟只是一种规范了格式的标记语言，如果没有程序对它进行处理的话，它只是一个保存了很多数据的、有一定格式的文本文件而已。为了能够让计算机“读”懂XML的内容并做出进一步工作，程序就要先分析XML文件的结构和各个数据之间的关系。MS XML Parser就是Microsoft开发的解析XML文件的一系列接口，借助于它的帮助，程序员可以方便地利用提供的接口来分析XML文件。-【Abstract】XML just one of marked language after all, if without processing by the programme, it is only a text file that preserving many data and having certain format by all means. For letting computer could read its content and do more work, we must analyze the structure and the relation between every data of XML document, MS XML Parse which opened out by Microsoft is a series of interfaces of resolving XML document. Recur to it, we can expediently analyze XML document with the help of these interfaces.
The XML DOM object of MS XML Parse offer a normative method to operate
the information stored in XML document, DOM let users looking XML document like a information tree with certain structure, but not a stream of text, DOM API is used as bridge between application and XML. Transferring DOM S API, we could deal with document very expediently.
【keywords】Markup Language, Parser Interface, Document Object Model(DOM),DOM Information Tree, DOM API, Visual
Platform: |
Size: 276480 |
Author: 朱华 |
Hits:
Description: This is a complete address book using Tree view control, MS flex Grid Control and Crystal Reports with Access DataBase from a college (visiting and permanent Teachers)
Platform: |
Size: 140288 |
Author: csbhattt |
Hits:
Description: 在WINDOWS中,用树形对话框显示并可以选择路径-Show tree path selection dialog in MS windows
Platform: |
Size: 27648 |
Author: dajunsi |
Hits:
Description: 遍历问题
(时间限制为：1000毫秒)
描述：
已知二叉树的中序和先序遍历可以唯一确定后序遍历、已知中序和后序遍历可以唯一确定先序遍历，但已知先序和后序，却不一定能唯一确定中序遍历。现要求根据输入的中序遍历结果及某一种遍历，要求输出另一种遍历。
输入：
输入包括若干个测试用例，第一行为一个自然数n，表示用例个数，接下来4n行，即每个用例占4行，其中第一行表示第一种遍历方式，第二行为第一种遍历结果，第三行为第二种遍历方式，第4行为第二种遍历结果。注明：先序遍历方式用“pre”表示，中序遍历方式用“in”表示，后序遍历方式用“post”表示。
输出：
对每个测试用例，输出相应的另一种遍历方式及结果。每个用例用一行输出，输出格式为先输出相应的遍历方式，然后一个冒号，再加一个空格，最后输出相应的遍历结果。
样例输入：
1
pre
ABDFCEG
in
BFDAEGC
样例输出：
post: FDBGECA
-Traversal problem
(Time limit: 1000 ms)
Description:
Known binary tree in preorder traversal sequence and uniquely determine the order of traversal, the known sequence and can be uniquely determined after traversing the first order traversal, it is known that the first order and the order, not necessarily the only determine the order of a traversal. Are required in accordance with the input sequence results and a certain traversal traversal traversal required a different output.
Input:
The input includes a number of test cases, the first act of a natural number n, that the number of use cases, followed by 4n lines, each use case, 4 lines, which traverse the first line means that the first and second acts of the first traversal results , the third act the second traversal methods, 4 the second traversal behavior results. State: first traversing way with "pre" said traversal methods in order to use "in" that way, after traversing with the "post", said.
Output:
Platform: |
Size: 1024 |
Author: zhoupenghua |
Hits:
Description: 二叉排序树的创建与使用
(时间限制为：1000毫秒)
描述：
二叉排序树的定义是：或者是一棵空树，或者是具有下列性质的二叉树：（1）若它的左子树不空，则左子树上所有的结点值均小于它的根结点的值；（2）若它的右子树不空，则右子树上所有结点的值均大于或等于它的根结点的值；（3）它的左右子树也分别为二叉排序树。现要求根据输入的元素值，构造一棵二叉排序树，并输出其先序遍历、中序遍历和后序遍历结果。
输入：
输入第一行为测试用例个数n，接下来为n个测试用例，每个测试用例占两行，其中第一行为元素个数m，第二行为m个需要构造成二叉排序树的元素值。
输出：
每个测试用例用三行输出，其中第一行输出先序遍历结果，第二行输出中序遍历结果，第三行输出后序遍历结果。各元素之间用一个空格隔开。
样例输入：
1
5
8 4 2 6 4
样例输出：
8 4 2 6 4
2 4 4 6 8
2 4 6 4 8
-Binary Sort Tree creation and use of
(Time limit: 1000 ms)
Description:
Binary sort tree is defined as: either an empty tree, or the nature of the binary tree with the following: (1) if its left subtree is not empty, then the left sub-tree of all nodes were less than the value of its root node (2) if it s the right subtree is not empty, then the right sub-tree of all nodes are greater than or equal to the value of its root node (3) around its sub- tree were binary sort tree. Are required elements of the input value, a binary sort tree structure, and the output of its first order traversal, inorder traversal and postorder traversal results.
Input:
Enter the number of the first acts of the test case n, then for the n test cases, accounting for two lines of each test case, where the first acts of the number of elements m, m a need to construct the second act into a binary sort tree of element values .
Output:
With three lines of output for each test case, wh
Platform: |
Size: 1024 |
Author: zhoupenghua |
Hits:
Description: 【poj】【2031】最小生成树堆优化~Accepted 760 KB 32 ms C++ 1720 B -Minimum spanning tree heap optimization poj2031
Platform: |
Size: 1024 |
Author: yyb |
Hits:
Description: C# DevTree演示代码，让ColorDevTree 显示不同颜色，因为觉得关于Tree的例子很少，做东西要用到Tree 不同行显示不同颜色，测试了下OK的。在窗体中输入状态数值：0 已处理,1 延迟处理,2 首次未处理, 3 再次未处理-C# código de demostración DevTree, así ColorDevTree mostrar diferentes colores, porque creo que muy pocos ejemplos en árbol, hagan algo para usar para mostrar las diferentes líneas de diferentes colores, la próxima prueba es en Aceptar. Introduzca el valor del estado en la forma: 0 procesado, un retraso en el tratamiento, dos primeros no se trata, una vez más sin procesar 3
Platform: |
Size: 11264 |
Author: ypudn90 |
Hits:
Description: Delphi动态数形菜单实例，树视图数据是从数据库读取出来后自动添加到树视图中，树形菜单中的每一项内容都是动态加载数据库的，比静态的树形菜单稍复杂些，但实用性大大增强了。本源码中附有MS SQLSERVER测试数据库。
-Delphi dynamic number of instances shaped menu, tree view after the data is read out from the database are automatically added to the tree view, each item in the menu tree is dynamically loaded content database, slightly more complex than some static tree menu, but practicality greatly enhanced. The source code with MS SQLSERVER test database.
Platform: |
Size: 428032 |
Author: P0V6PDK |
Hits:
Description: 微软面试 100 题系列
作者：July 结构之法算法之道 blog 之博主
本微软面试 100 题系列，共计 11 篇文章，300 多道面试题，截取本 blog 索引性文章：
程序员面试、算法研究、编程艺术、红黑树、数据挖掘 5 大系列集锦，中的第一部分编辑
而成。-Microsoft interview questions 100 series
Author: Road law blog Algorithms July structures blogger
The Microsoft interview questions 100 series, a total of 11 articles, over 300 questions pavement interception index this blog article:
Programmer interview, algorithm, programming art, red-black tree, data mining 5 series highlights, the first part of the editor
From.
Platform: |
Size: 3432448 |
Author: kele |
Hits: