图和网络分析重要库简介

    图和网络分析重要库简介

 

                                      By wangsh 2011-11-24

 

网络分析算法库,能高效解决网络分析问题,本文介绍网络分析相关的开源库。

这些算法库主要包含:

 

BGL(Boost Graph Library)是比较经典C++图算法库,内容丰富,高效稳定(见参考1)。Pgrouting、opensourceroute中的最短路径算法就是封装BGL库中的最短路径算法。

 

GOBLIN(A Graph Object Library for Network Programming Problems)是C++语言实现的开源图算法网络规划库,其主要功能包含无向图、有向图的算法,包含图生成、最短路径、旅行商分析等经典算法(见参考2)。

 

LEDA(Library of Efficient Data types and Algorithms)现在已经商业化,可以在网上找到3.0版本的开源版本,具有高效的数据结构和算法(见参考3-4)。

 

       igraph是c语言开发的算法库,并提供了python、ruby和R语言版本(见参考5)。

 

Tulip是使用C++开发的图数据显示和分析库(见参考6),其中提供的界面采用qt开发,界面漂亮。

 

       SNAP是C++语言开发的社会网络分析库(参考7)。

 
    Cytoscape是Java语言开发的开源网络数据可视化与分析库(见参考8)。
 
Networkx是Python语言的网络分析库(见参考9)。
 
Grapgviz是c语言开发的图显示软件(见参考10),绘制的图和网络请参考11。
 
Chisio是java语言开发的图显示工具(见参考12)。
 
Pajeck是社会网络分析软件(见参考13)。
 
Ucinet是一款社会网络分析的商业软件(见参考14)。
 
JUNG是Java语言开发的图分析包(见参考15)。
 
Piana是python语言开发用于生物网络分析软件(见参考16)。
Netminder是用于社会网络分析的商业软件(见参考17)。
 
Vizster主要用来显示社会网络(见参考18)。
 
NodeX是C#开发的网络分析插件(见参考19)。
 
Netanslyser基于cytoscape使用Java开发的网络分析插件(见参考20)。
 
 
其他未介绍的请参考21。
 
Enjoy Network Analysis!
    

转自: http://blog.csdn.net/wsh6759/article/details/7008793

LEDA是一个商业化的算法函数,LEDA就是Library of Efficient Data structure and Algorithm一个常用ADT的C++实现,推荐下载。简介:LEDA is a library of the data types and algorithms of combinatorial computing. The main features are: LEDA provides a sizable collection of data types and algorithms in a form which allows them to be used by non-experts. In the current version, this collection includes most of the data types and algorithms described in the text books of the area. LEDA gives a precise and readable specification for each of the data types and algorithms mentioned above. The specifications are short (typically, not more than a page), general (so as to allow several implementations), and abstract (so as to hide all details of the implementation). For many efficient data structures access by position is important. In LEDA, we use an item concept to cast positions into an abstract form. We mention that most of the specifications given in the LEDA manual use this concept, i.e., the concept is adequate for the description of many data types. LEDA contains efficient implementations for each of the data types, e.g., Fibonacci heaps for priority queues, red-black trees and dynamic perfect hashing for dictionaries, ... LEDA contains a comfortable data type graph. It offers the standard iterations such as ``for all nodes v of a graph G do'' or ``for all neighbors w of v do'', it allows to add and delete vertices and edges, it offers arrays and matrices indexed by nodes and edges,... The data type graph allows to write programs for graph problems in a form close to the typical text book presentation. LEDA is implemented by a C++ class library. It can be used with almost any C++ compiler (g++, CC, xlC, cxx, Borland, MSVC++, Watcom). LEDA is not in the public domain, but can be used freely for academic research and teaching. A commercial license is also available.
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值