IGraph class


[Package List] [Top]

Documentation for package `igraph' version 0.2.1

Help Pages

A B C D E F G I L M N P R S T V W misc

$.igraph.es Vertex and edge sequences and iterators
$.igraph.vs Vertex and edge sequences and iterators
$<-.igraph.es Vertex and edge sequences and iterators
$<-.igraph.vs Vertex and edge sequences and iterators
%--% Vertex and edge sequences and iterators
%->% Vertex and edge sequences and iterators
%<-% Vertex and edge sequences and iterators
%c% Graph operators
%du% Graph operators
%m% Graph operators
%s% Graph operators
%u% Graph operators

-- A --

add.edges Method for structural manipulation of graphs
add.vertices Method for structural manipulation of graphs
aging.ba.game Generate an evolving random graph with preferential attachment and aging
aging.barabasi.game Generate an evolving random graph with preferential attachment and aging
aging.prefatt.game Generate an evolving random graph with preferential attachment and aging
are.connected Gaining information about graph structure
as.directed Convert between directed and undirected graphs
as.undirected Convert between directed and undirected graphs
attributes Graph, vertex and edge attributes
average.path.length Shortest (directed or undirected) paths between vertices

-- B --

ba.game Generate scale-free graphs according to the Barabasi-Albert model
barabasi.game Generate scale-free graphs according to the Barabasi-Albert model
betweenness Vertex and edge betweenness centrality
bibcoupling Cocitation coupling

-- C --

callaway.traits.game Graph generation based on different vertex types
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
constraint Burt's constraint

-- D --

decompose.graph Decompose a graph into components
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 --

E Vertex and edge sequences and iterators
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
establishment.game Graph generation based on different vertex types
evcent Find Eigenvector Centrality Scores of Network Positions

-- F --

farthest.nodes Diameter of a graph

-- G --

get.adjacency Convert a graph to an adjacency matrix or an edge list
get.all.shortest.paths Shortest (directed or undirected) paths between vertices
get.diameter Diameter of a graph
get.edge Gaining information about graph structure
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
graph.complementer Graph operators
graph.compose Graph operators
graph.difference Graph operators
graph.disjoint.union Graph operators
graph.empty Various methods for creating graphs
graph.full Various methods for creating graphs
graph.intersection Graph operators
graph.isoclass Graph Isomorphism
graph.isocreate Graph Isomorphism
graph.isomorphic Graph Isomorphism
graph.laplacian Graph Laplacian
graph.lattice Various methods for creating graphs
graph.motifs Graph motifs
graph.ring Various methods for creating graphs
graph.star Various methods for creating graphs
graph.tree Various methods for creating graphs
graph.union Graph operators
GraphML Reading foreign file formats
growing.random.game Growing random graph generation

-- I --

igraph.par Parameters for the igraph package
igraph.sample Sampling a random integer sequence
is.connected Connected components of a graph
is.directed Gaining information about graph structure
is.igraph Is this object a graph?
iterators Vertex and edge sequences and iterators

-- L --

layout Generate coordinates for plotting graphs
layout.fruchterman.reingold Generate coordinates for plotting graphs
layout.kamada.kawai Generate coordinates for plotting graphs
layout.lgl Generate coordinates for plotting graphs
layout.merge Merging graph layouts
layout.random Generate coordinates for plotting graphs
layout.reingold.tilford Generate coordinates for plotting graphs
layout.sphere Generate coordinates for plotting graphs
layout.spring Generate coordinates for plotting graphs
LGL Reading foreign file formats
list.edge.attributes Graph, vertex and edge attributes
list.graph.attributes Graph, vertex and edge attributes
list.vertex.attributes Graph, vertex and edge attributes

-- M --

measure.dynamics Measuring the driving force in evolving networks
measure.dynamics.citedcat.id.age Measuring the driving force in evolving networks
measure.dynamics.citingcat.id.age Measuring the driving force in evolving networks
measure.dynamics.d.d Measuring the driving force in evolving networks
measure.dynamics.id Measuring the driving force in evolving networks
measure.dynamics.idage Measuring the driving force in evolving networks
minimum.spanning.tree Minimum spanning tree
modularity Undocumented functions for community structure detection

-- N --

neighbors Gaining information about graph structure

-- P --

page.rank The Page Rank algorithm
Pajek Reading foreign file formats
plot.igraph Plotting of graphs
power.law.fit Fitting a power-law distribution function to discrete data
print.igraph Print graphs to the terminal
print.igraph.es Vertex and edge sequences and iterators
print.igraph.vs Vertex and edge sequences and iterators

-- R --

random.graph.game Generate random graphs according to the Erdos-Renyi model
read.graph Reading foreign file formats
reciprocity Reciprocity of graphs
remove.edge.attribute Graph, vertex and edge attributes
remove.graph.attribute Graph, vertex and edge attributes
remove.vertex.attribute Graph, vertex and edge attributes
rewire Graph rewiring
rglplot 3D plotting of graphs with OpenGL
running.mean Running mean of a time series

-- S --

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

-- T --

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 --

V Vertex and edge sequences and iterators
vcount Gaining information about graph structure

-- W --

write.graph Writing the graph to a file in some format

-- misc --

[.igraph.es Vertex and edge sequences and iterators
[.igraph.vs Vertex and edge sequences and iterators
[<-.igraph.es Vertex and edge sequences and iterators
[<-.igraph.vs Vertex and edge sequences and iterators