Location:
Search - DiGraphs
Search list
Description: 有向图的强连通分支查找，使用java实现，代码经过调试，绝对高效率，正确和可靠-a map to digraphs to find, use java achieved through debugging code, the absolute high efficiency, the correct and reliable
Platform: |
Size: 1840 |
Author: weide |
Hits:
Description: 一个画有向图的程序。里面含有力导引画图算法等多个经典算法。
Platform: |
Size: 1769133 |
Author: 张清国 |
Hits:
Description: 有向图的强连通分支查找，使用java实现，代码经过调试，绝对高效率，正确和可靠-a map to digraphs to find, use java achieved through debugging code, the absolute high efficiency, the correct and reliable
Platform: |
Size: 2048 |
Author: weide |
Hits:
Description: 一个画有向图的程序。里面含有力导引画图算法等多个经典算法。-Directed graph of a painting process. Which contains a force-guided drawing algorithm, such as the classic algorithm.
Platform: |
Size: 1768448 |
Author: 张清国 |
Hits:
Description: 复杂网络研究与建模
总起来说这是一个关于矩阵的运算，用到了c语言里面的东西，实现一个矩阵的逆运算和矩阵的转置等，最终实现的是一个初始节点为4个节点的有向图，随即扩展为一个10000*10000的巨型矩阵，得到该有向图的图形，
与计算机图形学类似，该程序是在构建了一个算法后，用MATLAB实现了一个无标度网络的图形中的各个节点的概率密度，并根据各个节点的概率密度绘出该图
-将中文译成英语
And modeling complex networks
Collectively this is a computation on the matrix, use the stuff inside c language to realize the inverse of a matrix and a matrix, etc., and ultimately is an initial node to four nodes directed graph, then Expands to a huge matrix 10000* 10000, by the digraphs graphics,
And similar computer graphics, the program is built upon an algorithm, using MATLAB to achieve a scale-free network each node in the graph the probability density and probability density according to each node in the graph drawn
Platform: |
Size: 1024 |
Author: ymtian |
Hits:
Description: java开发的数据结构，包括链表，树，图。-in java data structure, including lists, trees, graphs.
Platform: |
Size: 121856 |
Author: 何河 |
Hits:
Description: TSimpleGraph is a visual component, which provides a simple user interface for drawing simple graphs/digraphs. User can draw nodes (vertices) on the control s client area and link them together (graph s edges or arcs) by either keyboard or mouse. Currently the component supports three different shapes for the nodes, however the new shapes can be added. The component is fully customizable and has methods for supporting Delphi s clipboard and printer objects.
Platform: |
Size: 659456 |
Author: dispel5 |
Hits:
Description: A graph G = (V, E) consists of
a set of vertices, V, and
a set of edges, E, where each edge is a pair (v,w) s.t. v,w V
Vertices are sometimes called nodes, edges are sometimes called arcs.
If the edge pair is ordered then the graph is called a directed graph (also called digraphs) .
We also call a normal graph (which is not a directed graph) an undirected graph.
When we say graph we mean that it is an undirected graph.
-A graph G = (V, E) consists of
a set of vertices, V, and
a set of edges, E, where each edge is a pair (v,w) s.t. v,w V
Vertices are sometimes called nodes, edges are sometimes called arcs.
If the edge pair is ordered then the graph is called a directed graph (also called digraphs) .
We also call a normal graph (which is not a directed graph) an undirected graph.
When we say graph we mean that it is an undirected graph.
Platform: |
Size: 1190912 |
Author: ashlafir |
Hits: