搜索资源列表
matlab_tools
- MALAB程序，包括顶点覆盖近似算法,哈密尔顿回路,画等温线,模拟退火应用,生成全排列矩阵,最小生成树Prim算法,最短路径等-MALAB procedures, including vertex cover approximation algorithm, Hamilton circuit, painting isotherms, simulated annealing applications, to generate full-rank matrix, Prim minimum spann
path
- 找出（二叉树中）从根结点到任一给定的结点的路径（非递归实现）-To find (in Binary Tree) from the root node to any given node of the path (non-recursive implementation)
mathmodelMATLABcode
- 数学建模各种模型的MATLAB源码,包括灰色模型、回归模型及回归检验、最小生成树、最短路径等-Mathematical Modeling of the MATLAB source models, including the gray model, regression model and regression testing, minimum spanning tree, shortest path, etc.
DtreeTest
- 生成动态树，可以添加节点，删除节点，数据库是mysql，sql文件在应用路径下文件名为tree_table.sql。解压后可直接放在myeclipse里-Generate dynamic tree, you can add nodes, delete nodes, the database is mysql, sql file path in the application file name is tree_table.sql. Decompression can be placed dire
tree
- 确定二叉树的特征。如：每个节点的层次，从根到该节点的枝长（路径长度），子孙的个数及祖先的个数。每个节点在前序、中序、后序中的访问的序号。-To determine the characteristics of a binary tree. Such as: the level of each node from the root to the node branch length (path length), the number of children and grandchildren an
graph
- 数据结构——图的基本结构 求给定图中的边（或弧）的数目。 求解出从给定顶点到所有顶点的最短路径（以边数计算）。 判断一个有向图g是否是一棵有向树。（任意一个顶点可能是根） 对给定的图G及出发点，设计算法从出发深度遍历图G，并构造出相应的生成树。 -Data structure- that the basic structure of the given graph edge (or arc) number. Solving out from a given vertex to a
book2
- A large number of real-world planning problems called combinatorial optimization problems share the following properties: They are optimiza- tion problems, are easy to state, and have a nite but usually very large number of feasible solutions.
exp6
- 合肥工业大学数据结构试验六图结构试验 包括完整的实验要求、实验预习报告、实验最终报告 实验要求： <1>求给定图中的边（或弧）的数目。 <2>求解出从给定顶点到所有顶点的最短路径（以边数计算）。 <3>判断一个有向图g是否是一棵有向树。（任意一个顶点可能是根） <4>对给定的图G及出发点v0，设计算法从V0出发深度遍历图G，并构造出相应的生成树。 -Hefei University of testing six graph
MINIMALpATH
- A shortest path tree, in graph theory, is a subgraph of a given (possibly weighted) graph constructed so that the distance between a selected root node and all other nodes is minimal. It is a tree because if there are two paths between the root node
a-binary-tree-search-algorithm
- 在对二叉树存储结构进行分析的基础上，介绍二叉树遍历算法的一种应用，即基于求解二叉树深度算法设计实 现的搜索二叉树中最长路径的算法。这里详细介绍了搜索二叉树中最长路径问题的分析解决思路，在对可能的预期结果进 行分析的基础上，给出了算法的设计方案，同时给出了具体的C语言算法描述。-By analyzing the storage structure of binary tree，a kind of application of binary tree traversal algorithm，
a-binary-tree
- 在采用链式存储结构的二叉树上，以bt指向根结点，p指向任一给定的结点，编程实现求出从根结点到给定结点之间的路径。主要是对二叉树的存储结构及其在二叉链表树上的各种操作加深理解。-The introduction of chain stores on the binary tree structure to point to the root bt, p point to any given node, programming derived from the root to the given p
dijkstra
- Dijkstra最短路算法Matlab程序,用于求从起始点s到其它各点的最短路 D为赋权邻接矩阵需要输入 d为s到其它各点最短路径的长度 pre记载了最短路径生成树-Dijkstra shortest path algorithm Matlab procedures for the request from the starting point s to the other points for the empowerment of the most short-circuit th
Binary-tree
- 建立二叉树存储结构,求二叉树的前序中序后序遍历,以及求指定节点的路径-The establishment of binary storage structure, seeking pre-order binary tree traversal in order after the order, and find the path specified node
tree
- 二叉树的基本运算，遍历，从根节点到子节点的路径和中序线索化。还有用遍历构造二叉树和用二叉树来表示代数表达式。-The basic operations of binary tree traversal path from the root node to child node in the sequence threaded. There traverse the constructed binary tree and binary tree to represent algebraic exp
Map
- 对图的各种操作，包括深度遍历，广度遍历，最小生成树，最短路径的各中算法，而且有递归和非递归方式，对学习数据结构有很大的帮助。 代码全是自己根据理解自己写的，思路很符合初学者。-Various operations on the map, including the traverse depth, breadth traversal, minimum spanning tree, shortest path in the algorithm, and recursive and non rec
path-menu
- 层次,wrappable(当容器宽度比长度变小的菜单),鼠标悬停和tab键驱动的菜单栏。最初创建代表选中项的路径在树形视图。 -Hierarchical, wrappable (when container width gets smaller than the menu length), mouse-hover and Tab-key driven menu bar. Originally created to represent a path to the selected item i
triangle-in-the-tree
- 有一棵树，树上有只毛毛虫。它在这棵树上生活了很久，对它的构造了如指掌。所以它在树上从来都是走最短路，不会绕路。它还还特别喜欢三角形，所以当它在树上爬来爬去的时候总会在想，如果把刚才爬过的那几根树枝/树干锯下来，能不能从中选三根出来拼成一个三角形呢？-A tree, a tree caterpillar. It in the tree of life for a long time, it constructed well aware. In the trees, it has always be
XML_Pathfi
- 本文论述了建设一个简单的工具,它可以用来确定和评估路径在一个XML文档,测试查询这些路径。该应用程序允许用户打开一个XML文档转换成一个树状视图控件,以便查看结构 用户可以右键单击任何节点在树状视图来公开一个上下文菜单,将允许用户复制当前路径,节点。用户可以打开一个测试窗口并粘贴复制路径进入一个表达式文本框。一旦路径被粘贴到文本框,用户可以直接测试路径,或者可能编辑路径和测试编辑。-This paper discusses the construction of a simple tool th
Q4.8
- // You are given a binary tree in which each node contains a value. Design a lgorithm to print all paths which sum up to that value. Note that it can be any path in the tree - it does not have to start at the root. // 给定一棵二叉树，每个结点包含一个值。打印出所有满足以下
flower-tree
- 所谓的带花树算法就是，把整个圈缩成一个点，Edmonds称这个超级点为“花”，就是说，原圈里的所有点都作为外点，然后继续搜索。再之后的过程中，已经被缩的点还可能被嵌套地收缩。 当我们找到一条增广路之后，还要把路上的“花”展开。 总之，带花树的算法思想就是缩点-继续找增广路-找到之后把花展开。 这个算法的思想并不难理解、难的是实现。 -The algorithm is called with trees and flowers, the whole circle shrunk t