Search - Path in Tree

Search - Path in Tree - List

[Data structs] Prim_gao DL : 0: Prim 算法寻找最小生成树，用C语言实现，有完整的注释！-Prim algorithm to find the minimum spanning tree, using C language, a complete Notes!
Update : 2025-03-14 Size : 1kb Publisher : gao
[Data structs] BoundAndBranch DL : 1: 我的算法作业，求一个在总花费小于1500的条件下从源结点到目的结点的最短路径，源代码Tree.cpp（C++语言编写，VC++6.0 IDE下调试通过），利用的是分支定界算法。可执行文件Tree.exe说明在ReadMeFirst请按照说明使用。-algorithm operations, for a total cost of less than 1,500 from the source node to node purpose of the shortest path, Tree.cpp source code (written in C, Visual C++ 6.0 IDE debug through), use of the branch-and-bound algorithm. Note executable file Tree.exe in ReadMeFirst follow the instructions to use.
Update : 2025-03-14 Size : 30kb Publisher :
[JSP/Java] grapher DL : 0: 用图形用户界面表示的图，数据结构基本应用，最小生成树算法，最短路径，广度、深度优先搜索-graphical user interface with the plan said, the basic data structure application, the minimum spanning tree algorithm, the shortest path, breadth, depth-first search
Update : 2025-03-14 Size : 60kb Publisher : 张旭
[Data structs] 1 DL : 0: 哈夫曼树和哈夫曼编码：从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/ -Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Print the tree in order*/④ void printcode (HTree* t)/* output of the Huffman coding characters* /
Update : 2025-03-14 Size : 1kb Publisher : 秋
[matlab] matlab_tools DL : 1: MALAB程序，包括顶点覆盖近似算法,哈密尔顿回路,画等温线,模拟退火应用,生成全排列矩阵,最小生成树Prim算法,最短路径等-MALAB procedures, including vertex cover approximation algorithm, Hamilton circuit, painting isotherms, simulated annealing applications, to generate full-rank matrix, Prim minimum spanning tree algorithm, the shortest path, etc.
Update : 2025-03-14 Size : 44kb Publisher : john duan
[Data structs] path DL : 0: 找出（二叉树中）从根结点到任一给定的结点的路径（非递归实现）-To find (in Binary Tree) from the root node to any given node of the path (non-recursive implementation)
Update : 2025-03-14 Size : 598kb Publisher : weixiaoguoke
[matlab] mathmodelMATLABcode DL : 1: 数学建模各种模型的MATLAB源码,包括灰色模型、回归模型及回归检验、最小生成树、最短路径等-Mathematical Modeling of the MATLAB source models, including the gray model, regression model and regression testing, minimum spanning tree, shortest path, etc.
Update : 2025-03-14 Size : 5.29mb Publisher : weizhilan
[JSP/Java] DtreeTest DL : 0: 生成动态树，可以添加节点，删除节点，数据库是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 directly in myeclipse
Update : 2025-03-14 Size : 833kb Publisher : lxy
[Data structs] tree DL : 0: 确定二叉树的特征。如：每个节点的层次，从根到该节点的枝长（路径长度），子孙的个数及祖先的个数。每个节点在前序、中序、后序中的访问的序号。-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 and the number of ancestors. Each node in the first sequence, the sequence, the order of the access number.
Update : 2025-03-14 Size : 383kb Publisher : 茹嫣
[Data structs] graph DL : 0: 数据结构——图的基本结构求给定图中的边（或弧）的数目。求解出从给定顶点到所有顶点的最短路径（以边数计算）。判断一个有向图g是否是一棵有向树。（任意一个顶点可能是根）对给定的图G及出发点，设计算法从出发深度遍历图G，并构造出相应的生成树。 -Data structure- that the basic structure of the given graph edge (or arc) number. Solving out from a given vertex to all vertices of the shortest path (in order to calculate the number of edges). Determine whether a directed graph g is a directed tree. (Any one vertex may be the root) of the given graph G and the starting point, the depth of the design algorithm traverses from the starting graph G, and construct the corresponding spanning tree.
Update : 2025-03-14 Size : 4kb Publisher :
[SCM] book2 DL : 0: 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. While some of these as e.g. the Shortest Path problem and the Minimum Spanning Tree problem have polynomial algo- ritms, the majority of the problems in addition share the property that no polynomial method for their solution is known.
Update : 2025-03-14 Size : 973kb Publisher : mehdi khanlo
[Data structs] exp6 DL : 0: 合肥工业大学数据结构试验六图结构试验包括完整的实验要求、实验预习报告、实验最终报告实验要求： <1>求给定图中的边（或弧）的数目。 <2>求解出从给定顶点到所有顶点的最短路径（以边数计算）。 <3>判断一个有向图g是否是一棵有向树。（任意一个顶点可能是根） <4>对给定的图G及出发点v0，设计算法从V0出发深度遍历图G，并构造出相应的生成树。 -Hefei University of testing six graph data structure, including a complete experimental test requirements, test prep report, final report experimental test requirements: " 1> find edges in a given graph (or arc) number. < 2> solved from a given vertex to all vertices of the shortest path (in order to calculate the number of edges). < 3> to determine whether a directed graph g is a directed tree. (Any vertex may be the root) < 4> on a given graph G and the starting point v0, design algorithm starting from the depth of traversal graph V0 G, and construct the corresponding spanning tree.
Update : 2025-03-14 Size : 651kb Publisher : 石帆
[AI-NN-PR] MINIMALpATH DL : 0: 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 and some vertex v (i.e. a cycle), we can delete the last edge of the longer path without increasing the distance from the root node to any node in the subgraph. If every pair of nodes in the graph has a unique shortest path between them, then the shortest path tree is unique. This is because if a particular path from the root to some vertex is minimal, then any part of that path (from node u to node v) is a minimal path between these two nodes. In graphs with no negative distances, Dijkstra s algorithm computes the shortest path tree, from a given vertex. In graphs with possibly negative distances, the Bellman-Ford algorithm can be used instead.
Update : 2025-03-14 Size : 7kb Publisher : darulor
[Mathimatics-Numerical algorithms] a-binary-tree-search-algorithm DL : 0: 在对二叉树存储结构进行分析的基础上，介绍二叉树遍历算法的一种应用，即基于求解二叉树深度算法设计实现的搜索二叉树中最长路径的算法。这里详细介绍了搜索二叉树中最长路径问题的分析解决思路，在对可能的预期结果进行分析的基础上，给出了算法的设计方案，同时给出了具体的C语言算法描述。-By analyzing the storage structure of binary tree，a kind of application of binary tree traversal algorithm，that is，the algorithm of searching the longest path in binary tree，which is realized by solving the depth of binary tree，is intro— duced．The solution ideas of searching the longest path in binary tree are proposed in detail．The design scheme of the algorithm is given by analysing the expected results．The algorithm description in C language is presented．
Update : 2025-03-14 Size : 256kb Publisher : 陈晓娟
[Data structs] a-binary-tree DL : 0: 在采用链式存储结构的二叉树上，以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 path between nodes. Mainly on the binary tree structure and stored in the binary tree list to deepen understanding of various operations.
Update : 2025-03-14 Size : 40kb Publisher : as
[matlab] dijkstra DL : 0: 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 the adjacency matrix D need to enter d for the s points in the shortest path to other pre recorded the length of the shortest path spanning tree
Update : 2025-03-14 Size : 1kb Publisher : 柳一航
[Data structs] Binary-tree DL : 0: 建立二叉树存储结构,求二叉树的前序中序后序遍历,以及求指定节点的路径-The establishment of binary storage structure, seeking pre-order binary tree traversal in order after the order, and find the path specified node
Update : 2025-03-14 Size : 2kb Publisher : nikita
[Data structs] tree DL : 0: 二叉树的基本运算，遍历，从根节点到子节点的路径和中序线索化。还有用遍历构造二叉树和用二叉树来表示代数表达式。-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 expressions.
Update : 2025-03-14 Size : 8kb Publisher : 卡卡
[Data structs] Map DL : 0: 对图的各种操作，包括深度遍历，广度遍历，最小生成树，最短路径的各中算法，而且有递归和非递归方式，对学习数据结构有很大的帮助。代码全是自己根据理解自己写的，思路很符合初学者。-Various operations on the map, including the traverse depth, breadth traversal, minimum spanning tree, shortest path in the algorithm, and recursive and non recursive way, great help for learning data structures. Code all their own understanding of their own to write, the idea is consistent with the beginners.
Update : 2025-03-14 Size : 779kb Publisher : wafer
[Other] path-menu DL : 0: 层次,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 in a tree-view.
Update : 2025-03-14 Size : 37kb Publisher : sadfas

« 12 3 4 5 6 7 8 »