![[R logo]](../../../doc/html/logo.jpg){kind=logo}
![[Package List]](../../../doc/html/left.jpg){kind=small}
![[Top]](../../../doc/html/up.jpg){kind=small}
A B C D E G I L M N P R S T V W
| $.igraphesseq | Vertex and edge sequences |
| $.igraphesvector | Vertex and edge sequences |
| $.igraphvsseq | Vertex and edge sequences |
| $.igraphvsvector | Vertex and edge sequences |
| add.edge.attribute | Graph, vertex and edge attributes |
| add.edges | Method for structural manipulation of graphs |
| add.graph.attribute | Graph, vertex and edge attributes |
| add.vertex.attribute | Graph, vertex and edge attributes |
| add.vertices | Method for structural manipulation of graphs |
| aging.prefatt.game | Generate an evolving random graph with preferential attachment and aging |
| are.connected | Gaining information about graph structure |
| as.vector | Vertex and edge sequences |
| attributes | Graph, vertex and edge attributes |
| average.path.length | Shortest (directed or undirected) paths between vertices |
| barabasi.game | Generate scale-free graphs according to the Barabasi-Albert model |
| betweenness | Vertex and edge betweenness centrality |
| bibcoupling | Cocitation coupling |
| closeness | Closeness centrality of vertices |
| cluster.distribution | Connected components of a graph |
| clusters | Connected components of a graph |
| cocitation | Cocitation coupling |
| community | Undocumented functions for community structure detection |
| degree | Degree and degree distribution of the vertices |
| degree.sequence.game | Generate random graphs with a given degree sequence |
| delete.edges | Method for structural manipulation of graphs |
| delete.vertices | Method for structural manipulation of graphs |
| diameter | Diameter of a graph |
| e.a | Graph, vertex and edge attributes |
| ecount | Gaining information about graph structure |
| edge.betweenness | Vertex and edge betweenness centrality |
| edge.type.matrix | Undocumented functions for community structure detection |
| erdos.renyi.game | Generate random graphs according to the Erdos-Renyi model |
| evcent | Find Eigenvector Centrality Scores of Network Positions |
| g.a | Graph, vertex and edge attributes |
| get.adjacency | Convert a graph to an adjacency matrix or an edge list |
| get.edge.attribute | Graph, vertex and edge attributes |
| get.edgelist | Convert a graph to an adjacency matrix or an edge list |
| get.graph.attribute | Graph, vertex and edge attributes |
| get.shortest.paths | Shortest (directed or undirected) paths between vertices |
| get.vertex.attribute | Graph, vertex and edge attributes |
| graph | Various methods for creating graphs |
| growing.random.game | Growing random graph generation |
| igraph.es.adj | Vertex and edge sequences |
| igraph.es.all | Vertex and edge sequences |
| igraph.es.end | Vertex and edge sequences |
| igraph.es.from | Vertex and edge sequences |
| igraph.es.fromorder | Vertex and edge sequences |
| igraph.es.get | Vertex and edge sequences |
| igraph.es.next | Vertex and edge sequences |
| igraph.es.reset | Vertex and edge sequences |
| igraph.es.to | Vertex and edge sequences |
| igraph.es.vector | Vertex and edge sequences |
| igraph.sample | Sampling a random integer sequence |
| igraph.vs.adj | Vertex and edge sequences |
| igraph.vs.all | Vertex and edge sequences |
| igraph.vs.end | Vertex and edge sequences |
| igraph.vs.get | Vertex and edge sequences |
| igraph.vs.next | Vertex and edge sequences |
| igraph.vs.reset | Vertex and edge sequences |
| igraph.vs.vector | Vertex and edge sequences |
| is.connected | Connected components of a graph |
| is.directed | Gaining information about graph structure |
| is.igraph | Is this object a graph? |
| layout | Generate coordinates for plotting graphs |
| layout.fruchterman.reingold | Generate coordinates for plotting graphs |
| layout.kamada.kawai | Generate coordinates for plotting graphs |
| layout.random | Generate coordinates for plotting graphs |
| layout.spring | Generate coordinates for plotting graphs |
| measure.dynamics | Measuring the driving force in evolving networks |
| minimum.spanning.tree | Minimum spanning tree |
| modularity | Undocumented functions for community structure detection |
| neighbors | Gaining information about graph structure |
| plot.igraph | Plotting of graphs |
| power.law.fit | Fitting a power-law distribution function to discrete data |
| print.igraph | Print graphs to the terminal |
| random.graph.game | Generate random graphs according to the Erdos-Renyi model |
| read.graph | Reading foreign file formats |
| remove.edge.attribute | Graph, vertex and edge attributes |
| remove.graph.attribute | Graph, vertex and edge attributes |
| remove.vertex.attribute | Graph, vertex and edge attributes |
| running.mean | Running mean of a time series |
| set.edge.attribute | Graph, vertex and edge attributes |
| set.graph.attribute | Graph, vertex and edge attributes |
| set.vertex.attribute | Graph, vertex and edge attributes |
| shortest.paths | Shortest (directed or undirected) paths between vertices |
| simplify | Remove loop and/or multiple edges from a graph |
| subcomponent | In- or out- component of a vertex |
| subgraph | Subgraph of a graph |
| summary.igraph | Print graphs to the terminal |
| tkplot | Interactive plotting of graphs |
| tkplot.export.postscript | Interactive plotting of graphs |
| tkplot.fit.to.screen | Interactive plotting of graphs |
| tkplot.getcoords | Interactive plotting of graphs |
| tkplot.off | Interactive plotting of graphs |
| tkplot.reshape | Interactive plotting of graphs |
| tkplot.rotate | Interactive plotting of graphs |
| transitivity | Transitivity of a graph |
| v.a | Graph, vertex and edge attributes |
| vcount | Gaining information about graph structure |
| write.graph | Writing the graph to a file in some format |