计算PageRank，之前直接用NetworkX的API nx.pagerank求的，大概知道PageRank是怎么回事，但对算法细节并不了解。现在想进一步了解PageRank的细节。
NetworkX
Calculate a minimum spanning tree with Python
This article presents how to calculate a minimum spanning tree with the Python package, NetworkX.
Calculate a maximal independent set with Python
This article presents how to calculate a maximal independent set with the Python package, NetworkX.
NetworkX Application Notes: Draw trees with pygraphviz
NetworkX only provides basic functionality for visualizing graphs. It looks ugly to draw trees with its built-in graph layout. This article presents how to draw beautiful trees with pygraphviz and convert the format between NetworkX and Graphviz (dot).
NetworkX Application Notes: A better way to visualize graphs
NetworkX is not powerful enough to draw large graphs since it only provides basic functionality for visualizing graphs. This article presents a better way to visualize graphs, i.e. using layouts in Gephi.
Calculate connected dominating sets (CDS)
It is believed that the minimum connected dominating set problem cannot be solved in polynomial time. To the best of my knowledge, there is no source code available for approximation algorithms. Therefore, I decide to implement one proposed by M. Rai in 2009.
Calculate minimum dominating sets
This blog takes notes of dominating sets and shows how to calculate its value with the Python package, NetworkX.
NetworkX Application Notes: Draw a graph with matplotlib
This article takes notes from my experiences of drawing a graph with the python 2D plotting library, matplotlib.
NetworkX使用笔记：基本操作
用NetworkX有一段时间了，本文从构建一张图要素出发，整理NetworkX基本操作，包括声明图类型、添加边、添加顶点。 Read more
NetworkX使用笔记：读入外部文件并转换成各种格式
复杂网络分析工具众多，有NetworkX,igraph, Pajek, Gephi，这些工具支持的文件格式不尽相同。利用NetworkX库可以很方便地在不同格式间进行转换。本文介绍如何利用NetworkX读入外部文件，并转换成其他格式，最后介绍如何将自动生成的图固定保存下来。