- create directed or undirected graphs and manipulate them in an arbitrary fashion - Associate arbitrary information to the vertices, edges by means of property maps - Filter vertices and/or edges "on the fly", such that they appear to have been removed from the graph - Instantaneously reverse the edge direction of directed graphs, and easily transform directed graphs into undirected - Collect all sorts of statistics: degree/property histogram, combined degree/property histogram, vertex-vertex correlations, assortativity, average vertex-vertex shortest distance, etc. - Run several topological algorithms on your graphs, such as isomorphism, minimum spanning tree, connected components, dominator tree, maximum flow - Generate random graphs, with arbitrary degree distribution and degree correlation. - Calculate clustering coefficients, motif statistics, communities, centrality measures - Ad-hoc compilation and execution of C++ code
Read More...