Graph-tool简介 - wiki
graph-tool is a Python module for manipulation and statistical analysis of graphs[disambiguation needed] (a.k.a. networks).
graph-tool是一个操作和统计分析图表的Python模块。
The core data structures and algorithms of graph-tool are implemented in C++, making extensive use of metaprogramming, based heavily on the Boost Graph Library.
graph-tool核心的数据结构和算法是用c++实现的,其大量使用元编程,依赖于Boost Graph库。
This type of approach can confer a level of performance which is comparable (both in memory usage and computation time) to that of a pure C++ library, which can be several orders of magnitude better than pure Python.[1]
这种方法会带来一定程度的性能优势,甚至能与纯c++库相匹敌(在内存使用和计算时间上),这可以比单纯使用Python好几个数量级。
Furthermore, many algorithms are implemented in parallel using OpenMP, which provides increased performance on multi-core architectures.
此外,许多算法由并行使用OpenMP实现,这使得其在多核体系结构机器上的性能有显著提升。
内容
- 特征
- 适用性
- 参考文献
- 外部链接
1.特征
Creation and manipulation of directed or undirected graphs.
- 直接或间接地创建和操纵图表。
Association of arbitrary information to the vertices, edges or even the graph itself, by means of property maps.
- 通过属性映射,将任意的信息与顶点、边甚至是图本身相关联起来。
Filter vertices and/or edges "on the fly", such that they appear to have been removed.
- “动态”地过滤顶点和/或边,这样它们看起来似乎已经被移除。
Support for dot, Graph Modelling Language and GraphML formats.
- 支持点,图形建模语言和GraphML格式。
Convenient and powerful graph drawing based on cairo or Graphviz.
- 便捷和强大的图形绘制能力(基于cairo和Graphviz)。
Support for typical statistical measurements: degree/property histogram, combined degree/property histogram, vertex-vertex correlations, assortativity, average vertex-vertex shortest path, etc.
- 支持典型的统计指标:degree/property直方图,combined degree/property直方图,vertex-vertex相关性,assortativity vertex-vertex平均最短路径等。
Support for several graph-theoretical algorithms: such as graph isomorphism, subgraph isomormism, minimum spanning tree, connected components, dominator tree, maximum flow, etc.
- 支持几个图形理论算法:例如,图同构,子图同构,最小生成树,连接组件,支配树,最大流法。
Support for several centrality measures.
- 支持多种中心性。
Support for clustering coefficients, as well as network motif statistics and community structure detection.
- 支持集群系数,以及网络motif统计和群体结构检测。
Generation of random graphs, with arbitrary degree distribution and correlations.
- 具有任意分布度和相关性的随机图的生成,。
Support for well-established network models: Price, Barabási-Albert, Geometric Networks, Multidimensional lattice graph, etc.
- 支持已经建立的网络模型:如,Price、Barabasi-Albert、几何网络多维网格图等。
2.适用性
Graph-tool can be used to work with very large graphs in a variety of contexts, including
Graph-tool可以用来处理各种情况下非常大的图,包括
simulation of cellular tissue
模拟细胞组织
data mining
数据挖掘
analysis of social networks
社交网络分析
analysis of P2P systems,[7]
P2P系统分析
large-scale modeling of agent-based systems,[8]
大规模的基于主体系统的建模
study of academic Genealogy trees,[9]
研究学术家谱树
theoretical assessment
理论评估
and modeling of network clustering,[10]
网络聚类和建模
large-scale call graph analysis,[11][12]
大规模的调用图分析
and analysis of the brain's Connectome.[13]
分析大脑的连接体
3.参考文献
参见原链接
4.外部链接
来源网址:Graph-tool - From Wikipedia, the free encyclopedia
Graph-tool简介 - wiki的更多相关文章
- Graph Cut 简介
转:http://www.cnblogs.com/longdouhzt/archive/2012/05/11/2496373.html [简介] Graph Cuts 不等于 graph cut(如 ...
- Retrofit 简介 wiki 文档
简介 Type-safe HTTP client for Android and Java by Square, Inc. GitHub主页:https://github.com/square/ret ...
- Tiny C Compiler简介-wiki
Tiny C Compiler(缩写为TCC.tCc或TinyCC)是一个用于x86(16/32位)或x86-64(64位)系统的C编译器,开发者为Fabrice Bellard.软件是设计用于低级计 ...
- Wiki知识介绍
Wiki简介 Wiki一词来源于夏威夷语的“wee kee wee kee”,原本是“快点快点”的意思,被译为“维基”或“维客”.一种多人协作的写作工具.Wiki站点可以有多人(甚至任何访问者)维护, ...
- RAID技术介绍
RAID技术介绍 简介 RAID是一个我们经常能见到的名词.但却因为很少能在实际环境中体验,所以很难对其原理 能有很清楚的认识和掌握.本文将对RAID技术进行介绍和总结,以期能尽量阐明其概念. RAI ...
- RAID的简单介绍
该文章全部复制转载于:http://blog.jobbole.com/83808/,只为做笔记供自己查看 简介 RAID是一个我们经常能见到的名词.但却因为很少能在实际环境中体验,所以很难对其原理 能 ...
- Streaming data from Oracle using Oracle GoldenGate and Kafka Connect
This is a guest blog from Robin Moffatt. Robin Moffatt is Head of R&D (Europe) at Rittman Mead, ...
- Ninja - chromium核心构建工具
转自:http://guiquanz.me/2014/07/28/a_intro_to_Ninja/ Ninja - chromium核心构建工具Jul 28, 2014 [在线编辑] 缘由 经过上次 ...
- [转]RAID技术介绍和总结
以下内容转自伯乐在线:http://blog.jobbole.com/83808/ 原文出处: 涯余(@若东临于沧海) ---------------------------------------- ...
随机推荐
- Java Cryptography Extension (JCE): 放开Java加密算法密钥最大长度16的限制
1. 在官网下载JCE: http://www.oracle.com/technetwork/java/javasebusiness/downloads/java-archive-downloads- ...
- jquery easyui 弹出消息框
<html> <head> <!-- 导入easyui插件的js和css样式; --> <link rel="stylesheet" ty ...
- P1119 灾后重建
题目背景 B地区在地震过后,所有村庄都造成了一定的损毁,而这场地震却没对公路造成什么影响.但是在村庄重建好之前,所有与未重建完成的村庄的公路均无法通车.换句话说,只有连接着两个重建完成的村庄的公路才能 ...
- 收集的55个Linux系统管理中常用的一些shell命令
.显示消耗内存/CPU最多的10个进程 代码如下: | tail | tail .查看进程 按内存从大到小排列 代码如下: ps -e -o "%C : %p : %z : %a" ...
- 第二课 android项目结构
- Xcode 性能优化
参考: 1, 使用Xcode和Instruments调试解决iOS内存泄露 2, iOS系类教程之用instruments来检验你的app 3, iOS性能优化:Instruments使用实战 4,使 ...
- 一个数如果恰好等于它的因子之和,这个数就称为 "完数 "。例如6=1+2+3.编程 找出1000以内的所有完数。
package a; public class Wanshu { public static void main(String[] args) { for (int i = 1; i <= 10 ...
- BZOJ 2007 海拔(平面图最小割-最短路)
题目链接:http://61.187.179.132/JudgeOnline/problem.php?id=2007 题意:给出一个n*n的格子,那么顶点显然有(n+1)*(n+1)个.每两个相邻顶点 ...
- Myeclipse 10.7 android(安卓) 开发环境搭建
1 下载并安装JDK,并且设置环境变量 2 下载安装 installer_r24.3.4-windows.exe (Android SDK Manager) 3 使用 Android SDK Mana ...
- Codeforces Round #382 (Div. 2) D. Taxes 歌德巴赫猜想
题目链接:Taxes D. Taxes time limit per test 2 seconds memory limit per test 256 megabytes input standard ...