搜索资源列表
dag-svm
- 有向无环图程序，程序较为简洁，包含代码和简要说明。-Directed acyclic graph procedure is relatively simple, containing code and a brief descr iption.
daq-2.0.1.tar
- Dag snort 开发软件， 是网上资料获得方法-Dag snort development recent data, network getting data
TopSort
- c++拓扑排序。对一个有向无环图G进行拓扑排序 -C++ topological sort, using vc2008 MFC framework implementations. In a Directed Acyclic Graph (Directed Acyclic Graph DAG) G for topological sort
tuopupaixu
- 输出一个有向无环图（DAG）的拓扑排序。通过计算各顶点的入度数，删除入度为零的顶点，同时将该顶点指向的点的入度减一。重复此操作直到所有点都被输出。-Output a directed acyclic graph (DAG) topological sort. Through calculating the degree of each vertex deleting zero vertices into degrees, at the same time the vertex point to
bnt_sick
- 贝叶斯网络经典入门，建立一个简单的贝叶斯网络，并输入边缘概率，输入draw_graph（dag）可查看网络图。-a brief introduction of bayesian network
heft
- DAG调度HEFT算法实现 DAG analog multi-machine scheduling, HEFT algorithm VC6 achieved-DAG analog multi-machine scheduling, HEFT algorithm VC6 achieved
DAGKEY
- 给定DAG图，用Java求其关键路径,DAG图的输入接口还不带完善，目前需要手工在main函数中改，可以通过界面输入。-this applet can give out the key path of a DAG graph, but the interface of inputing is not quite good.
project3
- 通过读入的输入文件来判断开始点到终止点之间的最短路以及此图是否为有向无环图-You will read the standard input a descr iption of a graph and then report two things on that graph: 1. The shortest path between a source node and a destination node specified in the input. 2. Whether the g
SIISelLowering
- \brief SI DAG Lowering interface definition.
catch3
- We cannot catch an ambiguous base class. Check with a non-virtual public DAG.
ImageFilterDAGBench
- Exercise a blur filter connected to 5 inputs of the same merge filter. This bench shows an improvement in performance once cacheing of re-used nodes is implemented, since the DAG is no longer flattened to a tree.
is_move_assignable
- \file \brief Custom DAG lowering for R600. -\file \brief Custom DAG lowering for R600.
DAG
- 判断一个无向图是否存在圈，如果存在则输出一个圈-Determine whether there is a non-circle to the graph, if there is a loop output
version
- lpfx - read lint1 output, sort and format for dag.
shortest-path-of-N
- N最短路径是K最短路径（KSP）的变种，KSP指的是DAG中单源路径中前K条最短的路径- N shortest path is the shortest path (KSP) of K, KSP refers to the DAG in the single source path of the shortest path in the former K
DSP2833x_common
- dDSP2833x,试用教程，有大量的下载资料欢迎大家下载。都是基本资料勿喷！谢谢！(DSP sda fdgh ghghw dag)
Naamloos_bericht (1)
- mooie dag vandaag, bla bla bla bla bla
DAG
- 实现一个有向无环图的拓扑排序并且把它输出来(Implement a topological sort that has an acyclic graph and lose it)
heft-master
- DAG调度HEFT算法实现 DAG analog multi-machine scheduling, HEFT algorithm VC6 achieved (DAG analog multi-machine scheduling, HEFT algorithm VC6 achieved)(DAG analog multi-machine scheduling, HEFT algorithm VC6 achieved (DAG analog multi-machine scheduling,
有向图邻接表的建立，深度广度搜索及拓扑排序
- 拓扑排序 对一个有向无环图(Directed Acyclic Graph简称DAG)G进行拓扑排序，是将G中所有顶点排成一个线性序列，使得图中任意一对顶点u和v，若边(u,v)∈E(G)，则u在线性序列中出现在v之前。通常，这样的线性序列称为满足拓扑次序(Topological Order)的序列，简称拓扑序列。简单的说，由某个集合上的一个偏序得到该集合上的一个全序，这个操作称之为拓扑排序(Topological sort A topological sort for a Directed