搜索资源列表
有向无环图操作示例代码
- 有向无环图操作示例代码-a directed acyclic graph operation code examples
MySeg
- 最短路径法分词程序。将中文句子经过原子切分后生成一个有向无环图，然后使用Dijkstra算法求出由起点到终点的最短路径以实现中文分词。-shortest path method participle procedures. Chinese Sentence will be read after splitting atoms generated a directed acyclic graph. then use the Dijkstr
youxiangwuhuantu
- 此程序为有向无环的代码，主要用于判断给定的图是否为有向无环图。-procedure for non-looped code mainly used to judge whether the plan for directed acyclic graph.
ahb_system_generator.tar
- An AHB system is made of masters slaves and interconnections. A general approach to include all possible \"muxed\" implementation of multi layered AHB systems and arbitrated AHB ones can be thought as an acyclic graph wh
DawgKitFinal-Mar22-2008
- Directed Acyclic Word Graphs/Word Algorithms C#/C
有向无环图操作示例代码
- 有向无环图操作示例代码-a directed acyclic graph operation code examples
MySeg
- 最短路径法分词程序。将中文句子经过原子切分后生成一个有向无环图，然后使用Dijkstra算法求出由起点到终点的最短路径以实现中文分词。-shortest path method participle procedures. Chinese Sentence will be read after splitting atoms generated a directed acyclic graph. then use the Dijkstr
youxiangwuhuantu
- 此程序为有向无环的代码，主要用于判断给定的图是否为有向无环图。-procedure for non-looped code mainly used to judge whether the plan for directed acyclic graph.
ahb_system_generator.tar
- An AHB system is made of masters slaves and interconnections. A general approach to include all possible "muxed" implementation of multi layered AHB systems and arbitrated AHB ones can be thought as an acyclic graph wher
@dagsvm
- 有向无环图支持向量(DAG-SVMS)多类分类方法,是一种新的多类分类方法。该方法采用了最小超球体类包含作为层次分类依据。试验结果表明,采用该方法进行多类分类,跟已有的分类方法相比有更高的分类精度。 -Directed acyclic graph support vector (DAG-SVMS) multi-category classification methods, is a new multi-category class
DawgKitFinal-Mar22-2008
- Directed Acyclic Word Graphs/Word Algorithms C#/C -Directed Acyclic Word Graphs/Word Algorithms C#/C
cDAGlab6
- 自己写的一个图的转换CMD 程序 nodag.txt是一个有环图演示输入文件. dag.txt是一个无环图演示输入文件. g.c 为主程序文件 stackar.c 为堆栈定义和调用文件 run.exe 为已编译好的可执行文件 我编写了一个MAKEFILE文件.如果不使用MAKEFILE 请在g.c文件的头部添加 #include "stackar.c" 然后再直接编译g.c. 使用了
PrefixSpan
- C++编写的代码，主要用模板实现prefixspan的投影数据库架构及模式生长功能-C++ The preparation of the code, the main projection PrefixSpan realize template database structure and mode of growth function
algraph_binary_tree_huffmantree
- 创建静态，动态的三叉霍夫曼树和编码，有向无环图的创建及拓扑排序，双向循环链表，表达式求值，单链表，集合在一起-Create static and dynamic Huffman tree of the trigeminal and coding, directed acyclic graph creation and topological sort, two-way circulation list, expression evalu
redundantpaths
- c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as
Map22
- 有向无环图是描述一项工程进行过程的有效工具,主要进行拓扑排序和关键路径的操作。构建了有向无环图的一系列操作的实现.-Directed acyclic graph to describe the process of a project carried out an effective tool, mainly for topological sort and the operation of the critical path. Con
theshortest
- 最短路径法分词程序.将中文句子经过原子切分后生成一个有向无环图,然后使用Dijkstra算法求出由起点到终点的-The shortest path segmentation process. After the Chinese sentence after splitting atoms to generate a directed acyclic graph, and then use the Dijkstra algorithm d
TopoSort
- 实现拓扑排序：一个有向无环图，表述为一个邻接矩阵graph[n][n]，其中graph[i][0]为顶点i的入度，其余为其后继结点。-The realization of topological sort: a directed acyclic graph, expressed as an adjacency matrix graph [n] [n], which graph [i] [0] for the vertex i of in
Svmtool-DAG
- direct acyclic graphic(DAG)approach for multiclassification in libsvm
ALWAYS-ACYCLIC-DISTRIBUTED-PATH-COMPUTATION
- ALWAYS ACYCLIC DISTRIBUTED PATH COMPUTATION source code,documentation and basepaper