搜索资源列表
chenattractor
- 用于生成陈吸引子的程序，可以生成三视图和一个三维吸引子图-used to produce Chen attractor procedures can generate three and a 3D View attract subgraph
subgraph_betweenness
- 复杂网络计算程序，获得subgraph betweenne-Get subgraph betweenness
dfsorigin
- DFS in Matlab, Depth First Search
subGraph
- 获得社会网络中各连通子网络,并对各子网络进行属性分析-get subgraph
03-021
- 基于向量机的次优化浮动顺序算法FFSM的应用-Efficient Mining of Frequent Subgraph in the Presence of Isomorphism
xilihuala
- 具有图形化界面的一个路由模拟程序。路由算法为Dijkstra算法。具有求出图中任意节点间所有最短路径以及最短路径子图的功能。-Graphical interface with a routing simulation program. Routing algorithm is Dijkstra algorithm. Find the figure with all the shortest path between any node and the shortest path subgraph
Minimum_spanning_tree
- 最小生成树是一个有 n 个结点的连通图的生成树是原图的极小连通子图，且包含原图中的所有 n 个结点，并且有保持图联通的最少的边。 本程序生成一个最小生成树-Minimum spanning tree is a n-node connected graph of the minimal spanning tree is the original connected subgraph, and contains all the n original nodes, and there are pl
AnAlgorithmForSubgraphIsomorphism
- ULLMANN关于子图同构算法的论文，是子图同构领域的核心文献-ULLMANN s paper of subgraph isomorphism algorithm
0518
- 这是一个实现数据结构中求解强连通子图的小程序，是实验课的产物，希望对学生朋友有帮助。-This is a data structure for solving strongly connected subgraph of small procedures, the product of the experimental class, the students want to help friends.
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
gaston-1.1.tar
- 频繁子图挖掘算法gaston的实现。通过这个算法可以迅速挖掘给定图数据库的频繁图挖掘算法。 这个2004年提出的算法，从目前实验来看，是优于广泛使用的gspan算法的，特别是在生物数据上，化学数据库上跟有效。-an algorithm for frequent subgraph discovery for gspan.It can be used to find frequent subgraph quickly
gSpan6.tar
- 频繁图挖掘实现算法gspan，用C++语言实现-an algorithm for subgraph discovery named gspan,it was first found by famous machine learning expert Jiawei Han
subgraph
- 复杂网络计算程序，获得subgraph中心度-Get subgraph
sub_centrality
- 复杂网络计算程序，获得网络的subgraph centrality-Get subgraph centrality
longdistanse
- 最短路径问题是图论研究中的一个经典算法问题， 旨在寻找图（由结点和路径组成的）中两结点之间的最短路径。 算法具体的形式包括： 确定起点的最短路径问题 - 即已知起始结点，求最短路径的问题。 确定终点的最短路径问题 - 与确定起点的问题相反，该问题是已知终结结点，求最短路径的问题。在无向图中该问题与确定起点的问题完全等同，在有向图中该问题等同于把所有路径方向反转的确定起点的问题。 确定起点终点的最短路径问题 - 即已知起点和终点，求两结点之间的最短路径- A spanning tr
jiong--erjinzhi
- 囧子图动画的设计以及二进制GUI界面的设计，很实用-囧 subgraph animation design and the design of binary GUI interface, very useful
2-sat
- 所为2-sat问题，就是2判断问题。该算法是用拆点的方式建图，用找强连通子图的方法推出矛盾，用以判断2-sat是否可行。经典实现，-2-sat, is a matter of judgment. The algorithm is used to find a demolition point built strongly connected subgraph launched contradictions, used to determine whether the 2-sat. Classic
gram
- 图的相关运算，包括图的遍历，深度遍历，广度遍历，最小联通子图寻找-FIG related operations, including graph traversal, deep traversal, breadth, traversal, minimum Unicom subgraph Search
minute-tree
- 在一个具有几个顶点的连通图G中，如果存在子图G 包含G中所有顶点和一部分边，且不形成回路，则称G 为图G的生成树，代价最小生成树则称为最小生成树-If there subgraph G ' contains all vertices in G, and part of the side, and does not form a loop, then G' in a few vertices connected graph G is the spanning tree of a gr
frequent-subgraph
- 用于图集上子图搜索的代码，gSpan和FFSM的源码，都是在linux下运行，其中gSpan包括直接可以用shell运行的二进制文件和一个C&matlab版本，FFSM是C&matlab版本-Atlas subgraph search for the code, gSpan and FFSM source, are run under linux, which can be used directly gSpan including binaries and shell to run a C &