igraph v0.4.5
0
Monthly downloads
by Gabor Csardi
Routines for simple graphs, network analysis.
Routines for simple graphs and network analysis. igraph can
handle large graphs very well and provides functions for generating random
and regular graphs, graph visualization, centrality indices and much more.
Functions in igraph
| Name | Description | |
| girth | Girth of a graph | |
| graph.density | Graph density | |
| page.rank | The Page Rank algorithm | |
| components | In- or out- component of a vertex | |
| degree | Degree and degree distribution of the vertices | |
| independent.vertex.sets | Independent vertex sets | |
| decompose.graph | Decompose a graph into components | |
| betweenness | Vertex and edge betweenness centrality | |
| running.mean | Running mean of a time series | |
| layout | Generate coordinates for plotting graphs | |
| power.law.fit | Fitting a power-law distribution function to discrete data | |
| write.pajek.bgraph | Write graphs and their cohesive block hierarchy as Pajek files | |
| diameter | Diameter of a graph | |
| graph-operators | Graph operators | |
| constraint | Burt's constraint | |
| biconnected.components | Biconnected components | |
| Drawing graphs | Drawing graphs | |
| write.graph | Writing the graph to a file in some format | |
| spinglass.community | Finding communities in graphs based on statistical meachanics | |
| cliques | The functions find cliques, ie. complete subgraphs in a graph | |
| transitivity | Transitivity of a graph | |
| shortest.paths | Shortest (directed or undirected) paths between vertices | |
| revolver | Measuring the driving force in evolving networks | |
| graph-motifs | Graph motifs | |
| edge.connectivity | Edge connectivity. | |
| growing.random.game | Growing random graph generation | |
| plot.igraph | Plotting of graphs | |
| rewire.edges | Rewires the endpoints of the edges of a graph randomly | |
| erdos.renyi.game | Generate random graphs according to the Erdos-Renyi model | |
| graph.graphdb | Load a graph from the graph database for testing graph isomorphism. | |
| communities | Common functions supporting community detection algorithms | |
| evcent | Find Eigenvector Centrality Scores of Network Positions | |
| aging.prefatt.game | Generate an evolving random graph with preferential attachment and aging | |
| neighborhood | Neighborhood of graph vertices | |
| conversion | Convert a graph to an adjacency matrix or an edge list | |
| traits | Graph generation based on different vertex types | |
| measure.dynamics | Measuring the driving force in evolving networks | |
| topological.sort | Topological sorting of vertices in a graph | |
| cohesive.blocks | Calculate Cohesive Blocks | |
| articulation.points | Articulation points of a graph | |
| graph.structure | Method for structural manipulation of graphs | |
| igraph.undocumented | Undocumented and unsupportted igraph functions | |
| igraph-parameters | Parameters for the igraph package | |
| edge.betweenness.community | Community structure detection based on edge betweenness | |
| as.directed | Convert between directed and undirected graphs | |
| simplify | Remove loop and/or multiple edges from a graph | |
| rewire | Graph rewiring | |
| iterators | Vertex and edge sequences and iterators | |
| tkplot | Interactive plotting of graphs | |
| layout.merge | Merging graph layouts | |
| modularity | Modularity of a community structure of a graph | |
| minimum.spanning.tree | Minimum spanning tree | |
| clusters | Connected components of a graph | |
| reciprocity | Reciprocity of graphs | |
| rglplot | 3D plotting of graphs with OpenGL | |
| preference.game | Trait-based random generation | |
| read.graph | Reading foreign file formats | |
| watts.strogatz.game | The Watts-Strogatz small-world model | |
| degree.sequence.game | Generate random graphs with a given degree sequence | |
| graph.constructors | Various methods for creating graphs | |
| alpha.centrality | Find Bonacich alpha centrality scores of network positions | |
| is.igraph | Is this object a graph? | |
| fastgreedy.community | Community structure via greedy optimization of modularity | |
| subgraph | Subgraph of a graph | |
| grg.game | Geometric random graphs | |
| structure.info | Gaining information about graph structure | |
| graph.laplacian | Graph Laplacian | |
| graph-isomorphism | Graph Isomorphism | |
| plot.bgraph | Plot graphs and their cohesive block hierarchy | |
| vertex.connectivity | Vertex connectivity. | |
| bonpow | Find Bonacich Power Centrality Scores of Network Positions | |
| graph.coreness | K-core decomposition of graphs | |
| walktrap.community | Community strucure via short random walks | |
| print.igraph | Print graphs to the terminal | |
| igraph.sample | Sampling a random integer sequence | |
| barabasi.game | Generate scale-free graphs according to the Barabasi-Albert model | |
| attributes | Graph, vertex and edge attributes | |
| cocitation | Cocitation coupling | |
| closeness | Closeness centrality of vertices | |
| graph.maxflow | Maximum flow in a network | |
| leading.eigenvector.community | Community structure detecting based on the leading eigenvector of the community matrix | |
| No Results! | ||
Last month downloads
Details
| Date | Oct 3, 2007 |
| License | GPL version 2 or later (June, 1991) |
| URL | http://cneurocvs.rmki.kfki.hu/igraph |
| Packaged | Fri Dec 21 19:38:02 2007; csardi |
Include our badge in your README
[](http://www.rdocumentation.org/packages/igraph)