搜索资源列表
chenattractor
- 用于生成陈吸引子的程序，可以生成三视图和一个三维吸引子图-used to produce Chen attractor procedures can generate three and a 3D View attract subgraph
integral_imaging.rar
- 该程序基于三维显示中的全景图象原理。可以生成许多子图,The program based on the three-dimensional display of the panoramic image principle. Can generate many subgraph
subgraph_betweenness
- 复杂网络计算程序，获得subgraph betweenne-Get subgraph betweenness
Graphbase
- 利用mfc编的一个简单的子图库，其中包含圆、矩形等基本子图-Mfc made use of a simple sub-library, which includes a round, rectangular and other basic subgraph
CMapSystem
- 1、用对话框形式显示用户对输入子图的选择，包括选择子图类型（子图库），子图线颜色以及子图区域填充颜色（颜色表）。 2、实现绘图区各图形的颜色属性的更改，具体是单击图形操作菜单项，在单击编辑区域参数，或编辑线参数。然后就可以对绘图区的各种类型的图形进行相应的参数编辑。具体是以上操作完成后，右击你所要编辑的图形，然后就弹出对话框（颜色表），对颜色进行编辑。同时颜色表对话框中各颜色可通过双击对应颜色项进行编辑。 3、可以在图上实施放大、缩小、移动。放大缩小是通过鼠标操作的。将你的鼠标位置置于所
smbo2txt
- 地理信息系统(GIS)相关.子图符号转成文字描述的功能.-Geographic Information System (GIS) related. Subgraph symbols into a text descr iption of the function.
autoINDEX
- 地理信息系统(GIS)相关.子图符号顺延.-Geographic Information System (GIS) related. Subgraph extended symbols.
Minimum_Spanning_Tree
- Minimum spanning tree.cpp If You have a connected, undirected graph, a spanning tree of that graph is a subgraph which is a tree and connects all the vertices together. Here You can do it with in C++ Language.
Connectgraphgenerate
- 生成一个连通子图，适合图论学习，ACM竞赛以及网络学习-Generate a connected subgraph, graph theory is suitable to study, ACM contests, as well as e-learning
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
mintree
- 一个有 n 个结点的连通图的生成树是原图的极小连通子图，且包含原图中的所有 n 个结点，并且有保持图联通的最少的边。-An n-node connected graph of the minimal spanning tree is the original connected subgraph, and contains all the n original nodes, and there are plans to maintain at least the edge of Unicom.
subgraph
- 复杂网络计算程序，获得subgraph中心度-Get subgraph
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 &