[Data structs] union

Description: Program to find UNION, INTERSECTION of input SETs.
Platform: | Size: 1024 | Author: Nipun | Hits:

[Data structs] bellFord-(2)

Description: BellFord algorithm, find out the shortest path of figure and c++ code implementation
Platform: | Size: 1024 | Author: 小田 | Hits:

[Data structs] MSP_Num

Description: Calculate the minimum spanning tree number of the network , c++ source code to achieve
Platform: | Size: 3072 | Author: 小田 | Hits:

[Data structs] Polynomial

Description: Visual c++ implementation, has realized the real polynomial addition and subtraction, two methods used in the Vector and list
Platform: | Size: 14336 | Author: 宋富洪 | Hits:

[Data structs] sqlist

Description: Order table operation, display data (traverse linear meter), modify the data (position and provide new value), insert data (position and provide new value, delete data, read data (provide location), data inversion, seeki
Platform: | Size: 1240064 | Author: CBY | Hits:

[Data structs] Cpp1

Description: A diagram showing the adjacency table, rewriting Dijkstra algorithm, with the right to enter any directed graph, the output of each of its shortest path between the vertices
Platform: | Size: 2048 | Author: 梁超 | Hits:

[Data structs] QUDC

Description: Data structure to take fixed-length string
Platform: | Size: 2048 | Author: young | Hits:

[Data structs] Binary-Tree-Preorder-Traversal

Description: a problem in leetcode
Platform: | Size: 1851392 | Author: liu | Hits:

[Data structs] KuaiPai

Description: quick sort
Platform: | Size: 1024 | Author: Donal Zhang | Hits:

[Data structs] jiugong

Description: Rearrangement jiugong problem, solving and output the input to the target jiugong diagram of the solution
Platform: | Size: 1024 | Author: BOB | Hits:

[Data structs] biaodashiqiuzhi

Description: I have written a stack, single linked list implementation, and for expression uation (infix turn suffix, suffix uation)
Platform: | Size: 1937408 | Author: Yin | Hits:

[Data structs] Demo

Description: 建立二叉树；对其进行遍历，遍历过程中输出结点的值；求出该二叉树的高度；并查询二叉树中是否 存在值为x的结点。
Platform: | Size: 1024 | Author: 陈荣辉 | Hits: