igraph: Network Analysis and Visualization
Version 1.0.1

Routines for simple graphs and network analysis. It can handle large graphs very well and provides functions for generating random and regular graphs, graph visualization, centrality methods and much more.

Browse man pages Browse package API and functions Browse package files

AuthorSee AUTHORS file.
Date of publication2015-06-26 11:13:24
MaintainerGabor Csardi <csardi.gabor@gmail.com>
LicenseGPL (>= 2)
Version1.0.1
URL http://igraph.org
Package repositoryView on CRAN
InstallationInstall the latest version of this package by entering the following in R:
install.packages("igraph")

Man pages

aaa-igraph-package: The igraph package
add_edges: Add edges to a graph
add_layout_: Add layout to graph
add_vertices: Add vertices to a graph
adjacent_vertices: Adjacent vertices of multiple vertices in a graph
all_simple_paths: List all simple paths from one source
alpha_centrality: Find Bonacich alpha centrality scores of network positions
are_adjacent: Are two vertices adjacent?
arpack: ARPACK eigenvector calculation
articulation_points: Articulation points of a graph
as_adjacency_matrix: Convert a graph to an adjacency matrix
as_adj_list: Adjacency lists
as.directed: Convert between directed and undirected graphs
as_edgelist: Convert a graph to an edge list
as_graphnel: Convert igraph graphs to graphNEL objects from the graph...
as_ids: Convert a vertex or edge sequence to an ordinary vector
as.igraph: Conversion to igraph
as_incidence_matrix: Incidence matrix of a bipartite graph
as_long_data_frame: Convert a graph to a long data frame
as_membership: Declare a numeric vector as a membership vector
assortativity: Assortativity coefficient
authority_score: Kleinberg's authority centrality scores.
automorphisms: Number of automorphisms
betweenness: Vertex and edge betweenness centrality
bfs: Breadth-first search
biconnected_components: Biconnected components
bipartite_mapping: Decide whether a graph is bipartite
bipartite_projection: Project a bipartite graph
canonical_permutation: Canonical permutation of a graph
categorical_pal: Palette for categories
centralize: Centralization of a graph
centr_betw: Centralize a graph according to the betweenness of vertices
centr_betw_tmax: Theoretical maximum for betweenness centralization
centr_clo: Centralize a graph according to the closeness of vertices
centr_clo_tmax: Theoretical maximum for closeness centralization
centr_degree: Centralize a graph according to the degrees of vertices
centr_degree_tmax: Theoretical maximum for degree centralization
centr_eigen: Centralize a graph according to the eigenvector centrality of...
centr_eigen_tmax: Theoretical maximum for betweenness centralization
c.igraph.es: Concatenate edge sequences
c.igraph.vs: Concatenate vertex sequences
cliques: The functions find cliques, ie. complete subgraphs in a graph
closeness: Closeness centrality of vertices
cluster_edge_betweenness: Community structure detection based on edge betweenness
cluster_fast_greedy: Community structure via greedy optimization of modularity
cluster_infomap: Infomap community finding
cluster_label_prop: Finding communities based on propagating labels
cluster_leading_eigen: Community structure detecting based on the leading...
cluster_louvain: Finding community structure by multi-level optimization of...
cluster_optimal: Optimal community structure
cluster_spinglass: Finding communities in graphs based on statistical meachanics
cluster_walktrap: Community strucure via short random walks
cocitation: Cocitation coupling
cohesive_blocks: Calculate Cohesive Blocks
communities: Functions to deal with the result of network community...
compare: Compares community structures using various metrics
complementer: Complementer of a graph
components: Connected components of a graph
component_wise: Component-wise layout
compose: Compose two graphs as binary relations
consensus_tree: Create a consensus tree from several hierarchical random...
console: The igraph console
constraint: Burt's constraint
contract: Contract several vertices into a single one
convex_hull: Convex hull of a set of vertices
coreness: K-core decomposition of graphs
count_isomorphisms: Count the number of isomorphic mappings between two graphs
count_motifs: Graph motifs
count_subgraph_isomorphisms: Count the isomorphic mappings between a graph and the...
count_triangles: Find triangles in graphs
curve_multiple: Optimal edge curvature when plotting graphs
decompose: Decompose a graph into components
degree: Degree and degree distribution of the vertices
delete_edge_attr: Delete an edge attribute
delete_edges: Delete edges from a graph
delete_graph_attr: Delete a graph attribute
delete_vertex_attr: Delete a vertex attribute
delete_vertices: Delete vertices from a graph
dfs: Depth-first search
diameter: Diameter of a graph
difference: Difference of two sets
difference.igraph: Difference of graphs
difference.igraph.es: Difference of edge sequences
difference.igraph.vs: Difference of vertex sequences
dim_select: Dimensionality selection for singular values using profile...
disjoint_union: Disjoint union of graphs
distances: Shortest (directed or undirected) paths between vertices
diverging_pal: Diverging palette
diversity: Graph diversity
dominator_tree: Dominator tree
dyad_census: Dyad census of a graph
E: Edges of a graph
each_edge: Rewires the endpoints of the edges of a graph to a random...
eccentricity: Eccentricity of the vertices in a graph
edge: Helper function for adding and deleting edges
edge_attr: Query edge attributes of a graph
edge_attr_names: List names of edge attributes
edge_attr-set: Set one or more edge attributes
edge_connectivity: Edge connectivity.
edge_density: Graph density
ego: Neighborhood of graph vertices
eigen_centrality: Find Eigenvector Centrality Scores of Network Positions
embed_adjacency_matrix: Spectral Embedding of Adjacency Matrices
embed_laplacian_matrix: Spectral Embedding of the Laplacian of a Graph
ends: Incident vertices of some graph edges
erdos.renyi.game: Generate random graphs according to the Erdos-Renyi model
fit_hrg: Fit a hierarchical random graph model
fit_power_law: Fitting a power-law distribution function to discrete data
gclust.app: Graph Clustering Using NMF (and no SVT) - Apparent Clusters
gclust.rsvt: Graph Clustering Using SVT and NMF - Clusters Implied by...
getAICc: Compute AIC based on a Poisson Approximation using the output...
get.edge.ids: Find the edge ids based on the incident vertices of the edges
girth: Girth of a graph
gorder: Order (number of vertices) of a graph
graph_: Convert object to a graph
graph_attr: Graph attributes of a graph
graph_attr_names: List names of graph attributes
graph_attr-set: Set all or some graph attributes
graph_from_adjacency_matrix: Create graphs from adjacency matrices
graph_from_adj_list: Create graphs from adjacency lists
graph_from_atlas: Create a graph from the Graph Atlas
graph_from_data_frame: Creating igraph graphs from data frames or vice-versa
graph_from_edgelist: Create a graph from an edge list matrix
graph_from_graphdb: Load a graph from the graph database for testing graph...
graph_from_graphnel: Convert graphNEL objects from the graph package to igraph
graph_from_incidence_matrix: Create graphs from an incidence matrix
graph_from_isomorphism_class: Create a graph from an isomorphism class
graph_from_lcf: Creating a graph from LCF notation
graph_from_literal: Creating (small) graphs via a simple interface
graphlet_basis: Graphlet decomposition of a graph
graph_version: Igraph data structure versions
groups: Groups of a vertex partitioning
gsize: The size of the graph (number of edges)
head_of: Head of the edge(s) in a graph
hrg: Create a hierarchical random graph from an igraph graph
hrg-methods: Hierarchical random graphs
hrg_tree: Create an igraph graph from a hierarchical random graph model
hub_score: Kleinberg's hub centrality scores.
identical_graphs: Decide if two graphs are identical
igraph-attribute-combination: How igraph functions handle attributes when the graph changes
igraph_demo: Run igraph demos, step by step
igraph-dollar: Getting and setting graph attributes, shortcut
igraph-es-attributes: Query or set attributes of the edges in an edge sequence
igraph-es-indexing: Indexing edge sequences
igraph-es-indexing2: Select edges and show their metadata
igraph-minus: Delete vertices or edges from a graph
igraph_options: Parameters for the igraph package
igraph_test: Run package tests
igraph_version: Query igraph's version string
igraph-vs-attributes: Query or set attributes of the vertices in a vertex sequence
igraph-vs-indexing: Indexing vertex sequences
igraph-vs-indexing2: Select vertices and show their metadata
incident: Incident edges of a vertex in a graph
incident_edges: Incident edges of multiple vertices in a graph
intersection: Intersection of two or more sets
intersection.igraph: Intersection of graphs
intersection.igraph.es: Intersection of edge sequences
intersection.igraph.vs: Intersection of vertex sequences
is_chordal: Chordality of a graph
is_dag: Directed acyclic graphs
is_degseq: Check if a degree sequence is valid for a multi-graph
is_directed: Check whether a graph is directed
is_graphical: Is a degree sequence graphical?
is_igraph: Is this object an igraph graph?
is_min_separator: Minumal vertex separators
is_named: Named graphs
isomorphic: Decide if two graphs are isomorphic
isomorphism_class: Isomorphism class of a graph
isomorphisms: Calculate all isomorphic mappings between the vertices of two...
is_separator: Vertex separators
is_weighted: Weighted graphs
ivs: Independent vertex sets
keeping_degseq: Graph rewiring while preserving the degree distribution
knn: Average nearest neighbor degree
laplacian_matrix: Graph Laplacian
layout_: Graph layouts
layout_as_bipartite: Simple two-row layout for bipartite graphs
layout_as_star: Generate coordinates to place the vertices of a graph in a...
layout_as_tree: The Reingold-Tilford graph layout algorithm
layout.deprecated: Deprecated layout functions
layout.fruchterman.reingold.grid: Grid Fruchterman-Reingold layout, this was removed from...
layout_in_circle: Graph layout with vertices on a circle.
layout_nicely: Choose an appropriate graph layout algorithm automatically
layout_on_grid: Simple grid layout
layout_on_sphere: Graph layout with vertices on the surface of a sphere
layout_randomly: Randomly place vertices on a plane or in 3d space
layout.spring: Spring layout, this was removed from igraph
layout.svd: SVD layout, this was removed from igraph
layout_with_dh: The Davidson-Harel layout algorithm
layout_with_drl: The DrL graph layout generator
layout_with_fr: The Fruchterman-Reingold layout algorithm
layout_with_gem: The GEM layout algorithm
layout_with_graphopt: The graphopt layout algorithm
layout_with_kk: The Kamada-Kawai layout algorithm
layout_with_lgl: Large Graph Layout
layout_with_mds: Graph layout by multidimensional scaling
layout_with_sugiyama: The Sugiyama graph layout generator
local_scan: Compute local scan statistics on graphs
make_: Make a new graph
make_bipartite_graph: Create a bipartite graph
make_chordal_ring: Create an extended chordal ring graph
make_clusters: Creates a communities object.
make_de_bruijn_graph: De Bruijn graphs
make_empty_graph: A graph with no edges
make_full_bipartite_graph: Create a full bipartite graph
make_full_citation_graph: Create a complete (full) citation graph
make_full_graph: Create a full graph
make_graph: Create an igraph graph from a list of edges, or a notable...
make_kautz_graph: Kautz graphs
make_lattice: Create a lattice graph
make_line_graph: Line graph of a graph
make_ring: Create a ring graph
make_star: Create a star graph, a tree with n vertices and n - 1 leaves
make_tree: Create tree graphs
matching: Graph matching
match_vertices: Match Graphs given a seeding of vertex correspondences
max_cardinality: Maximum cardinality search
max_flow: Maximum flow in a graph
merge_coords: Merging graph layouts
min_cut: Minimum cut in a graph
min_separators: Minimum size vertex separators
min_st_separators: Minimum size vertex separators
modularity.igraph: Modularity of a community structure of a graph
motifs: Graph motifs
mst: Minimum spanning tree
neighbors: Neighboring (adjacent) vertices in a graph
nexus: Query and download from the Nexus network repository
normalize: Normalize layout
norm_coords: Normalize coordinates for plotting graphs
page_rank: The Page Rank algorithm
path: Helper function to add or delete edges along a path
permute: Permute the vertices of a graph
pipe: Magrittr's pipes
plot.common: Drawing graphs
plot_dendrogram.communities: Community structure dendrogram plots
plot_dendrogram.igraphHRG: HRG dendrogram plot
plot.igraph: Plotting of graphs
plot.sir: Plotting the results on multiple SIR model runs
plus-.igraph: Add vertices, edges or another graph to a graph
power_centrality: Find Bonacich Power Centrality Scores of Network Positions
predict_edges: Predict edges based on a hierarchical random graph model
print.igraph: Print graphs to the terminal
print.igraph.es: Print an edge sequence to the screen
print.igraphHRG: Print a hierarchical random graph model to the screen
print.igraphHRGConsensus: Print a hierarchical random graph consensus tree to the...
print.igraph.vs: Show a vertex sequence on the screen
radius: Radius of a graph
random_walk: Random walk on a graph
read_graph: Reading foreign file formats
reciprocity: Reciprocity of graphs
rep.igraph: Replicate a graph multiple times
rev.igraph.es: Reverse the order in an edge sequence
rev.igraph.vs: Reverse the order in a vertex sequence
rewire: Rewiring edges of a graph
rglplot: 3D plotting of graphs with OpenGL
r_pal: The default R palette
running_mean: Running mean of a time series
sample_: Sample from a random graph model
sample_bipartite: Bipartite random graphs
sample_correlated_gnp: Generate a new random graph from a given graph by randomly...
sample_correlated_gnp_pair: Sample a pair of correlated G(n,p) random graphs
sample_degseq: Generate random graphs with a given degree sequence
sample_dirichlet: Sample from a Dirichlet distribution
sample_dot_product: Generate random graphs according to the random dot product...
sample_fitness: Random graphs from vertex fitness scores
sample_fitness_pl: Scale-free random graphs, from vertex fitness scores
sample_forestfire: Forest Fire Network Model
sample_gnm: Generate random graphs according to the G(n,m) Erdos-Renyi...
sample_gnp: Generate random graphs according to the G(n,p) Erdos-Renyi...
sample_grg: Geometric random graphs
sample_growing: Growing random graph generation
sample_hierarchical_sbm: Sample the hierarchical stochastic block model
sample_hrg: Sample from a hierarchical random graph model
sample_islands: A graph with subgraphs that are each a random graph.
sample_k_regular: Create a random regular graph
sample_last_cit: Random citation graphs
sample_motifs: Graph motifs
sample_pa: Generate scale-free graphs according to the Barabasi-Albert...
sample_pa_age: Generate an evolving random graph with preferential...
sample_pref: Trait-based random generation
sample_sbm: Sample stochastic block model
sample_seq: Sampling a random integer sequence
sample_smallworld: The Watts-Strogatz small-world model
sample_sphere_surface: Sample vectors uniformly from the surface of a sphere
sample_sphere_volume: Sample vectors uniformly from the volume of a sphere
sample_traits_callaway: Graph generation based on different vertex types
scan_stat: Scan statistics on a time series of graphs
scg: All-in-one Function for the SCG of Matrices and Graphs
scg_eps: Error of the spectral coarse graining (SCG) approximation
scg_group: SCG Problem Solver
scg-method: Spectral Coarse Graining
scg_semi_proj: Semi-Projectors
sequential_pal: Sequential palette
set_edge_attr: Set edge attributes
set_graph_attr: Set a graph attribute
set_vertex_attr: Set vertex attributes
shapes: Various vertex shapes when plotting igraph graphs
similarity: Similarity measures of two vertices
simplified: Constructor modifier to drop multiple and loop edges
simplify: Simple graphs
sir: SIR model on graphs
spectrum: Eigenvalues and eigenvectors of the adjacency matrix of a...
split_join_distance: Split-join distance of two community structures
srand: Deprecated function, used to set random seed of the C...
st_cuts: List all (s,t)-cuts of a graph
st_min_cuts: List all minimum (s,t)-cuts of a graph
stochastic_matrix: Stochastic matrix of a graph
strength: Strength or weighted vertex degree
subcomponent: In- or out- component of a vertex
subgraph: Subgraph of a graph
subgraph_centrality: Find subgraph centrality scores of network positions
subgraph_isomorphic: Decide if a graph is subgraph isomorphic to another one
subgraph_isomorphisms: All isomorphic mappings between a graph and subgraphs of...
sub-.igraph: Query and manipulate a graph as it were an adjacency matrix
sub-sub-.igraph: Query and manipulate a graph as it were an adjacency list
tail_of: Tails of the edge(s) in a graph
tkigraph: Experimental basic igraph GUI
tkplot: Interactive plotting of graphs
topo_sort: Topological sorting of vertices in a graph
transitivity: Transitivity of a graph
triad_census: Triad census, subgraphs with three vertices
unfold_tree: Convert a general graph into a forest
union: Union of two or more sets
union.igraph: Union of graphs
union.igraph.es: Union of edge sequences
union.igraph.vs: Union of vertex sequences
unique.igraph.es: Remove duplicate edges from an edge sequence
unique.igraph.vs: Remove duplicate vertices from a vertex sequence
upgrade_graph: Igraph data structure versions
V: Vertices of a graph
vertex: Helper function for adding and deleting vertices
vertex_attr: Query vertex attributes of a graph
vertex_attr_names: List names of vertex attributes
vertex_attr-set: Set one or more vertex attributes
vertex_connectivity: Vertex connectivity.
vertex.shape.pie: Using pie charts as vertices in graph plots
which_multiple: Find the multiple or loop edges in a graph
which_mutual: Find mutual edges in a directed graph
with_edge_: Constructor modifier to add edge attributes
with_graph_: Constructor modifier to add graph attributes
without_attr: Construtor modifier to remove all attributes from a graph
without_loops: Constructor modifier to drop loop edges
without_multiples: Constructor modifier to drop multiple edges
with_vertex_: Constructor modifier to add vertex attributes
write_graph: Writing the graph to a file in some format

Functions

$.igraph Man page
$.igraph.es Man page
$.igraph.vs Man page
$<-.igraph Man page
$<-.igraph.es Man page
$<-.igraph.vs Man page
*.igraph Man page
+.igraph Man page
-.igraph Man page
Call Source code
DL Man page
E Man page Source code
E<- Man page
GML Man page
GraphML Man page
LGL Man page
Pajek Man page
UCINET Man page
V Man page Source code
V<- Man page
[.igraph Man page
[.igraph.es Man page
[.igraph.vs Man page
[.nexusDatasetInfoList Man page
[<-.igraph.es Man page
[<-.igraph.vs Man page
[[.igraph Man page
[[.igraph.es Man page
[[.igraph.vs Man page
[[<-.igraph.es Man page
[[<-.igraph.vs Man page
\%--\% Man page
\%->\% Man page
\%<-\% Man page
\%>\% Man page
\%c\% Man page
\%du\% Man page
\%m\% Man page
\%s\% Man page
\%u\% Man page
add.edges Man page
add.vertex.shape Man page
add.vertices Man page
add_class Source code
add_edges Man page Source code
add_layout_ Man page Source code
add_shape Man page Source code
add_vertices Man page Source code
add_vses_graph_ref Source code
address Source code
adhesion Man page Source code
adjacent.triangles Man page
adjacent_vertices Man page Source code
aging.ba.game Man page
aging.barabasi.game Man page
aging.prefatt.game Man page
algorithm Man page Source code
all_dots Source code
all_shortest_paths Man page Source code
all_simple_paths Man page Source code
all_values Source code
alpha.centrality Man page
alpha.centrality.dense Source code
alpha.centrality.sparse Source code
alpha_centrality Man page Source code
any_multiple Man page Source code
are.connected Man page
are_adjacent Man page Source code
arpack Man page Source code
arpack-options Man page
arpack.unpack.complex Man page Source code
arpack_defaults Man page
articulation.points Man page
articulation_points Man page Source code
as.data.frame.igraphSDF Source code
as.dendrogram.communities Man page Source code
as.dendrogram.igraphHRG Source code
as.directed Man page Source code
as.hclust.communities Man page Source code
as.hclust.igraphHRG Source code
as.igraph Man page Source code
as.igraph.es Source code
as.igraph.igraphHRG Man page Source code
as.igraph.vs Source code
as.lazy Source code
as.lazy.call Source code
as.lazy.character Source code
as.lazy.formula Source code
as.lazy.lazy Source code
as.lazy.name Source code
as.lazy.numeric Source code
as.lazy.promise Source code
as.lazy_dots Source code
as.lazy_dots.NULL Source code
as.lazy_dots.character Source code
as.lazy_dots.lazy Source code
as.lazy_dots.lazy_dots Source code
as.lazy_dots.list Source code
as.lazy_dots.name Source code
as.undirected Man page Source code
asPhylo Man page
asPhylo.communities Man page
as_adj Man page
as_adj_edge_list Man page Source code
as_adj_list Man page Source code
as_adjacency_matrix Man page Source code
as_bipartite Man page Source code
as_data_frame Man page Source code
as_edgelist Man page Source code
as_graphnel Man page Source code
as_ids Man page Source code
as_ids.igraph.es Man page Source code
as_ids.igraph.vs Man page Source code
as_incidence_matrix Man page Source code
as_long_data_frame Man page Source code
as_membership Man page Source code
as_phylo Man page Source code
as_phylo.communities Man page Source code
as_phylo.igraphHRG Source code
as_star Man page Source code
as_tree Man page Source code
assortativity Man page Source code
assortativity.degree Man page
assortativity.nominal Man page
assortativity_degree Man page Source code
assortativity_nominal Man page Source code
asym_pref Man page Source code
asymmetric.preference.game Man page
atlas Man page Source code
attribute.combination Man page
attributes Man page
authority.score Man page
authority_score Man page Source code
auto_name Source code
auto_names Source code
autocurve.edges Man page
automorphisms Man page Source code
average.path.length Man page
ba.game Man page
barabasi.game Man page
betweenness Man page Source code
betweenness.estimate Man page
bfs Man page Source code
bibcoupling Man page Source code
biconnected.components Man page
biconnected_components Man page Source code
bipartite Man page Source code
bipartite.mapping Man page
bipartite.projection Man page
bipartite.projection.size Man page
bipartite.random.game Man page
bipartite_graph Man page Source code
bipartite_mapping Man page Source code
bipartite_projection Man page Source code
bipartite_projection_size Man page Source code
blockGraphs Man page
blocks Man page Source code
bonpow Man page
bonpow.dense Source code
bonpow.sparse Source code
buildMerges Source code
c.igraph.es Man page Source code
c.igraph.vs Man page Source code
c.lazy_dots Source code
callaway.traits.game Man page
canonical.permutation Man page
canonical_permutation Man page Source code
capitalize Source code
categorical_pal Man page Source code
centr_betw Man page Source code
centr_betw_tmax Man page Source code
centr_clo Man page Source code
centr_clo_tmax Man page Source code
centr_degree Man page Source code
centr_degree_tmax Man page Source code
centr_eigen Man page Source code
centr_eigen_tmax Man page Source code
centralization Man page
centralization.betweenness Man page
centralization.betweenness.tmax Man page
centralization.closeness Man page
centralization.closeness.tmax Man page
centralization.degree Man page
centralization.degree.tmax Man page
centralization.evcent Man page
centralization.evcent.tmax Man page
centralize Man page Source code
centralize.scores Man page
check_version Source code
checkpkg Source code
chordal_ring Man page Source code
cit_cit_types Man page Source code
cit_types Man page Source code
cited.type.game Man page
citing.cited.type.game Man page
clique.number Man page
clique_num Man page Source code
cliques Man page Source code
close.igraphconsole Source code
closeness Man page Source code
closeness.estimate Man page
cluster.distribution Man page
cluster_edge_betweenness Man page Source code
cluster_fast_greedy Man page Source code
cluster_infomap Man page Source code
cluster_label_prop Man page Source code
cluster_leading_eigen Man page Source code
cluster_louvain Man page Source code
cluster_optimal Man page Source code
cluster_spinglass Man page Source code
cluster_walktrap Man page Source code
clusters Man page
cocitation Man page Source code
code.length Man page
code_len Man page Source code
cohesion Man page Source code
cohesion.cohesiveBlocks Man page Source code
cohesion.igraph Man page Source code
cohesive.blocks Man page
cohesiveBlocks Man page
cohesive_blocks Man page Source code
common_env Source code
communities Man page
community.to.membership2 Source code
compare Man page Source code
compare.communities Man page Source code
compare.membership Man page Source code
complementer Man page Source code
complete.dend Source code
component_distribution Man page Source code
component_wise Man page Source code
components Man page Source code
compose Man page Source code
connect Man page Source code
connect.neighborhood Man page
consensus_tree Man page Source code
console Man page Source code
constraint Man page Source code
constructor_modifier Source code
constructor_spec Source code
contract Man page Source code
contract.vertices Man page
convex.hull Man page
convex_hull Man page Source code
coreness Man page Source code
count.multiple Man page
count_components Man page Source code
count_isomorphisms Man page Source code
count_max_cliques Man page Source code
count_motifs Man page Source code
count_multiple Man page Source code
count_subgraph_isomorphisms Man page Source code
count_triangles Man page Source code
create.communities Man page
create_es Source code
create_op_result Source code
create_vs Source code
crossing Man page Source code
curve_multiple Man page Source code
cut_at Man page Source code
cutat Man page
de_bruijn_graph Man page Source code
decompose Man page Source code
decompose.graph Man page
degree Man page Source code
degree.distribution Man page
degree.sequence.game Man page
degree_distribution Man page Source code
degseq Man page Source code
delete.edges Man page
delete.vertices Man page
delete_edge_attr Man page Source code
delete_edges Man page Source code
delete_graph_attr Man page Source code
delete_vertex_attr Man page Source code
delete_vertices Man page Source code
dendPlot Man page
dendPlotDendrogram Source code
dendPlotHclust Source code
dendPlotPhylo Source code
deparse_trunc Source code
deprecated Source code
dfs Man page Source code
diameter Man page Source code
difference Man page Source code
difference.igraph Man page Source code
difference.igraph.es Man page
difference.igraph.vs Man page Source code
dim_select Man page Source code
directed_graph Man page Source code
disjoint_union Man page Source code
distance_table Man page Source code
distances Man page Source code
diverging_pal Man page Source code
diversity Man page Source code
do_call Source code
dominator.tree Man page
dominator_tree Man page Source code
dot_product Man page Source code
drl_defaults Man page
drop_null Source code
dyad.census Man page
dyad_census Man page Source code
each_edge Man page Source code
eccentricity Man page Source code
ecount Man page
edge Man page Source code
edge.attributes Man page Source code
edge.attributes<- Man page
edge.betweenness Man page
edge.betweenness.community Man page
edge.betweenness.estimate Man page
edge.connectivity Man page
edge.disjoint.paths Man page
edge_attr Man page Source code
edge_attr<- Man page
edge_attr_names Man page Source code
edge_betweenness Man page Source code
edge_connectivity Man page Source code
edge_density Man page Source code
edge_disjoint_paths Man page Source code
edges Man page
ego Man page Source code
ego_graph Man page
ego_size Man page Source code
eigen_centrality Man page Source code
embed_adjacency_matrix Man page Source code
embed_laplacian_matrix Man page Source code
empty_graph Man page Source code
ends Man page Source code
erdos.renyi.game Man page Source code
establishment.game Man page
estimate_betweenness Man page Source code
estimate_closeness Man page Source code
estimate_edge_betweenness Man page Source code
eval_call Source code
evcent Man page
exportPajek Man page
exportPajek.cohesiveblocks.nopf Source code
exportPajek.cohesiveblocks.pf Source code
export_pajek Man page Source code
farthest.nodes Man page
farthest_vertices Man page Source code
fastgreedy.community Man page
fit_hrg Man page Source code
fit_power_law Man page Source code
forest.fire.game Man page
from_adjacency Man page Source code
from_data_frame Man page Source code
from_edgelist Man page Source code
from_incidence_matrix Man page Source code
from_literal Man page Source code
full_bipartite_graph Man page Source code
full_citation_graph Man page Source code
full_graph Man page Source code
gclust.app Man page Source code
gclust.rsvt Man page Source code
generate_uuid Source code
get.adjacency Man page
get.adjacency.dense Source code
get.adjacency.sparse Source code
get.adjedgelist Man page
get.adjlist Man page
get.all.shortest.paths Man page
get.all.simple.paths.pp Source code
get.attr.codes Source code
get.data.frame Man page
get.diameter Man page
get.edge Man page Source code
get.edge.attribute Man page
get.edge.ids Man page Source code
get.edgelist Man page
get.edges Man page Source code
get.graph.attribute Man page
get.incidence Man page
get.incidence.dense Source code
get.incidence.sparse Source code
get.shortest.paths Man page
get.stochastic Man page
get.vertex.attribute Man page
getAICc Man page Source code
getIgraphOpt Man page
get_diameter Man page Source code
get_graph_id Source code
girth Man page Source code
gnm Man page Source code
gnp Man page Source code
gorder Man page Source code
grab_args Source code
graph Man page
graph.adhesion Man page
graph.adjacency Man page
graph.adjacency.dense Source code
graph.adjacency.sparse Source code
graph.adjlist Man page
graph.atlas Man page
graph.attributes Man page Source code
graph.attributes<- Man page
graph.automorphisms Man page
graph.bfs Man page
graph.bipartite Man page
graph.cohesion Man page
graph.complementer Man page
graph.compose Man page
graph.coreness Man page
graph.count.isomorphisms.vf2 Man page Source code
graph.count.subisomorphisms.vf2 Man page Source code
graph.data.frame Man page
graph.de.bruijn Man page
graph.density Man page
graph.dfs Man page
graph.difference Man page
graph.disjoint.union Man page
graph.diversity Man page
graph.edgelist Man page
graph.eigen Man page
graph.empty Man page
graph.extended.chordal.ring Man page
graph.famous Man page
graph.formula Man page
graph.full Man page
graph.full.bipartite Man page
graph.full.citation Man page
graph.get.isomorphisms.vf2 Man page Source code
graph.get.subisomorphisms.vf2 Man page Source code
graph.graph.union.or.intersection Source code
graph.graphdb Man page
graph.incidence Man page
graph.incidence.dense Source code
graph.incidence.sparse Source code
graph.intersection Man page
graph.isoclass Man page Source code
graph.isoclass.subgraph Man page Source code
graph.isocreate Man page
graph.isomorphic Man page Source code
graph.isomorphic.34 Man page Source code
graph.isomorphic.bliss Man page Source code
graph.isomorphic.vf2 Man page Source code
graph.kautz Man page
graph.knn Man page
graph.laplacian Man page
graph.lattice Man page
graph.lcf Man page
graph.maxflow Man page
graph.mincut Man page
graph.motifs Man page
graph.motifs.est Man page
graph.motifs.no Man page
graph.neighborhood Man page
graph.progress Source code
graph.progress.tk Source code
graph.progress.tkconsole Source code
graph.progress.tkconsole.create Source code
graph.progress.tkconsole.message Source code
graph.progress.tkconsole.pbar Source code
graph.progress.txt Source code
graph.ring Man page
graph.shape.circle.clip Source code
graph.shape.circle.plot Source code
graph.shape.crectangle.clip Source code
graph.shape.csquare.clip Source code
graph.shape.none.plot Source code
graph.shape.pie.clip Source code
graph.shape.pie.plot Source code
graph.shape.raster.plot Source code
graph.shape.rectangle.clip Source code
graph.shape.rectangle.plot Source code
graph.shape.sphere.plot Source code
graph.shape.square.clip Source code
graph.shape.square.plot Source code
graph.shape.vrectangle.clip Source code
graph.star Man page
graph.status Source code
graph.strength Man page
graph.subisomorphic.lad Man page Source code
graph.subisomorphic.vf2 Man page Source code
graph.tree Man page
graph.union Man page
graph_ Man page
graph_attr Man page Source code
graph_attr<- Man page
graph_attr_names Man page Source code
graph_from_adj_list Man page Source code
graph_from_adjacency_matrix Man page Source code
graph_from_atlas Man page Source code
graph_from_data_frame Man page Source code
graph_from_edgelist Man page Source code
graph_from_graphdb Man page Source code
graph_from_graphnel Man page Source code
graph_from_incidence_matrix Man page Source code
graph_from_isomorphism_class Man page Source code
graph_from_lcf Man page Source code
graph_from_literal Man page Source code
graph_from_literal_i Source code
graph_version Man page Source code
graphlet_basis Man page Source code
graphlet_proj Man page Source code
graphlets Man page Source code
graphlets.candidate.basis Man page
graphlets.project Man page
graphs_from_cohesive_blocks Man page Source code
grg Man page Source code
grg.game Man page
groups Man page Source code
groups.communities Man page Source code
groups.default Man page Source code
growing Man page Source code
growing.random.game Man page
gsize Man page Source code
has.multiple Man page
head_of Man page Source code
hierarchical_sbm Man page Source code
hierarchy Man page Source code
hrg Man page Source code
hrg-methods Man page
hrg.consensus Man page
hrg.create Man page
hrg.dendrogram Man page
hrg.fit Man page
hrg.game Man page
hrg.predict Man page
hrgPlotDendrogram Source code
hrgPlotHclust Source code
hrgPlotPhylo Source code
hrg_tree Man page Source code
hsbm.1.game Source code
hsbm.list.game Source code
hub.score Man page
hub_score Man page Source code
i.get.arrow.mode Source code
i.get.edge.labels Source code
i.get.labels Source code
i.get.main Source code
i.get.xlab Source code
i.parse.plot.params Source code
i.tkplot.get.edge.lty Source code
i_compare Source code
i_set_edge_attr Source code
i_set_vertex_attr Source code
identical_graphs Man page Source code
igraph Man page
igraph-attribute-combination Man page
igraph-dollar Man page
igraph-es-attributes Man page
igraph-es-indexing Man page
igraph-es-indexing2 Man page
igraph-minus Man page
igraph-package Man page
igraph-vs-attributes Man page
igraph-vs-indexing Man page
igraph-vs-indexing2 Man page
igraph.Arrows Source code
igraph.arpack.default Man page
igraph.check.shapes Source code
igraph.console Man page
igraph.drl.coarsen Man page
igraph.drl.coarsest Man page
igraph.drl.default Man page
igraph.drl.final Man page
igraph.drl.refine Man page
igraph.eigen.default Man page
igraph.from.graphNEL Man page
igraph.i.attribute.combination Source code
igraph.i.levc.arp Source code
igraph.i.spMatrix Source code
igraph.match.arg Source code
igraph.options Man page
igraph.pars.set.verbose Source code
igraph.plotting Man page
igraph.polygon Source code
igraph.sample Man page
igraph.shape.noclip Man page
igraph.shape.noplot Man page
igraph.to.graphNEL Man page
igraph.version Man page
igraph.vertex.shapes Man page
igraph_demo Man page Source code
igraph_opt Man page Source code
igraph_options Man page Source code
igraph_test Man page Source code
igraph_version Man page Source code
igraphdemo Man page
igraphtest Man page
in_circle Man page Source code
incident Man page Source code
incident_edges Man page Source code
independence.number Man page
independent.vertex.sets Man page
induced.subgraph Man page
induced_subgraph Man page Source code
infomap.community Man page
interconnected.islands.game Man page
interp Source code
interp.call Source code
interp.character Source code
interp.formula Source code
interp.lazy Source code
interp.name Source code
intersection Man page Source code
intersection.igraph Man page Source code
intersection.igraph.es Man page
intersection.igraph.vs Man page Source code
is.bipartite Man page
is.chordal Man page
is.connected Man page
is.dag Man page
is.degree.sequence Man page
is.directed Man page
is.graphical.degree.sequence Man page
is.hierarchical Man page
is.igraph Man page
is.lazy Source code
is.lazy_dots Source code
is.loop Man page
is.matching Man page
is.maximal.matching Man page
is.minimal.separator Man page
is.multiple Man page
is.mutual Man page
is.named Man page
is.separator Man page
is.simple Man page
is.weighted Man page
is_bipartite Man page Source code
is_chordal Man page Source code
is_connected Man page Source code
is_dag Man page Source code
is_degseq Man page Source code
is_directed Man page Source code
is_graphical Man page Source code
is_hierarchical Man page Source code
is_igraph Man page Source code
is_igraph_es Source code
is_igraph_vs Source code
is_isomorphic_to Man page
is_matching Man page Source code
is_max_matching Man page Source code
is_min_separator Man page Source code
is_named Man page Source code
is_separator Man page Source code
is_simple Man page Source code
is_subgraph_isomorphic_to Man page
is_weighted Man page Source code
isomorphic Man page Source code
isomorphism_class Man page Source code
isomorphisms Man page Source code
ivs Man page Source code
ivs_size Man page Source code
k.regular.game Man page
kautz_graph Man page Source code
keeping_degseq Man page Source code
knn Man page Source code
label.propagation.community Man page
laplacian_matrix Man page Source code
largest.cliques Man page
largest.independent.vertex.sets Man page
largest_cliques Man page Source code
largest_ivs Man page Source code
last_cit Man page Source code
lastcit.game Man page
lattice Man page Source code
layout Man page
layout.auto Man page
layout.bipartite Man page
layout.circle Man page Source code
layout.davidson.harel Man page
layout.drl Man page
layout.fruchterman.reingold Man page Source code
layout.fruchterman.reingold.grid Man page Source code
layout.gem Man page
layout.graphopt Man page
layout.grid Man page
layout.grid.3d Man page Source code
layout.kamada.kawai Man page Source code
layout.lgl Man page Source code
layout.mds Man page
layout.merge Man page
layout.norm Man page
layout.norm.col Source code
layout.random Man page Source code
layout.reingold.tilford Man page Source code
layout.sphere Man page Source code
layout.spring Man page Source code
layout.star Man page
layout.sugiyama Man page
layout.svd Man page Source code
layout_ Man page Source code
layout_as_bipartite Man page Source code
layout_as_star Man page Source code
layout_as_tree Man page Source code
layout_components Man page Source code
layout_in_circle Man page Source code
layout_modifier Source code
layout_nicely Man page Source code
layout_on_grid Man page Source code
layout_on_sphere Man page Source code
layout_randomly Man page Source code
layout_spec Source code
layout_with_dh Man page Source code
layout_with_drl Man page Source code
layout_with_fr Man page Source code
layout_with_gem Man page Source code
layout_with_graphopt Man page Source code
layout_with_kk Man page Source code
layout_with_lgl Man page Source code
layout_with_mds Man page Source code
layout_with_sugiyama Man page Source code
lazy Source code
lazy_ Source code
lazy_dots Source code
lazy_eval Source code
leading.eigenvector.community Man page
length.cohesiveBlocks Man page Source code
length.communities Man page Source code
line.graph Man page
line_graph Man page Source code
list.edge.attributes Man page
list.graph.attributes Man page
list.vertex.attributes Man page
local_scan Man page Source code
makeNexusDatasetInfo Source code
make_ Man page Source code
make_bipartite_graph Man page Source code
make_call Source code Source code
make_chordal_ring Man page Source code
make_clusters Man page Source code
make_de_bruijn_graph Man page Source code
make_directed_graph Man page Source code
make_ego_graph Man page Source code
make_empty_graph Man page Source code
make_famous_graph Source code
make_full_bipartite_graph Man page Source code
make_full_citation_graph Man page Source code
make_full_graph Man page Source code
make_graph Man page Source code
make_kautz_graph Man page Source code
make_lattice Man page Source code
make_line_graph Man page Source code
make_ring Man page Source code
make_star Man page Source code
make_tree Man page Source code
make_undirected_graph Man page Source code
make_weak_ref Source code
match_vertices Man page Source code
max_bipartite_match Man page Source code
max_cardinality Man page Source code
max_cliques Man page Source code
max_cohesion Man page Source code
max_flow Man page Source code
maxcohesion Man page
maximal.cliques Man page
maximal.cliques.count Man page
maximal.independent.vertex.sets Man page
maximal_ivs Man page Source code
maximum.bipartite.matching Man page
maximum.cardinality.search Man page
mean_distance Man page Source code
median.sir Man page Source code
membership Man page Source code
merge_coords Man page Source code
merges Man page Source code
min_cut Man page Source code
min_separators Man page Source code
min_st_separators Man page Source code
minimal.st.separators Man page
minimum.size.separators Man page
minimum.spanning.tree Man page
missing_arg Source code
mod.matrix Man page
modularity Man page Source code
modularity.communities Man page Source code
modularity.igraph Man page Source code
modularity_matrix Man page Source code
motifs Man page Source code
mst Man page Source code
multilevel.community Man page
mypie Source code
myscg Source code
neighborhood Man page
neighborhood.size Man page
neighbors Man page Source code
nexus Man page
nexus.format.result Source code
nexus.get Man page
nexus.info Man page
nexus.list Man page
nexus.search Man page
nexusDatasetInfo Man page
nexus_get Man page Source code
nexus_info Man page Source code
nexus_list Man page Source code
nexus_search Man page Source code
nicely Man page Source code
no.clusters Man page
norm_coords Man page Source code
normalize Man page Source code
onAttach Source code
on_grid Man page Source code
on_sphere Man page Source code
optimal.community Man page
pa Man page Source code
pa_age Man page Source code
page.rank Man page
page.rank.old Man page
page_rank Man page Source code
page_rank_old Man page Source code
parent Man page Source code
parseVE Source code
parse_es_op_args Source code
parse_op_args Source code
parse_vs_op_args Source code
path Man page Source code
path.length.hist Man page
permute Man page Source code
permute.vertices Man page
piecewise.layout Man page
plot.cohesiveBlocks Man page Source code
plot.communities Man page Source code
plot.graph Man page
plot.igraph Man page Source code
plot.sir Man page Source code
plotHierarchy Man page
plot_dendrogram Man page Source code
plot_dendrogram.communities Man page Source code
plot_dendrogram.igraphHRG Man page Source code
plot_hierarchy Man page Source code
power.law.fit Man page
power.law.fit.new Source code
power.law.fit.old Source code
power_centrality Man page Source code
predict_edges Man page Source code
pref Man page Source code
preference.game Man page
print.cohesiveBlocks Man page Source code
print.communities Man page Source code
print.edges.adjlist Source code
print.edges.adjlist.named Source code
print.edges.compressed Source code
print.edges.compressed.all Source code
print.edges.compressed.limit Source code
print.edges.edgelist Source code
print.graph.attributes Source code
print.header Source code
print.igraph Man page Source code
print.igraph.es Man page Source code
print.igraph.vs Man page Source code
print.igraphHRG Man page Source code
print.igraphHRGConsensus Man page Source code
print.igraph_layout_modifier Man page Source code
print.igraph_layout_spec Man page Source code
print.lazy Source code
print.membership Source code
print.nexusDatasetInfo Man page Source code
print.nexusDatasetInfoList Man page Source code
print.vertex.attributes Source code
print.vertex.attributes.old Source code
print1.igraphHRG Source code
print2.igraphHRG Source code
promise_env Source code
promise_expr Source code
quantile.sir Man page Source code
r_pal Man page Source code
radius Man page Source code
random.graph.game Man page
random_walk Man page Source code
randomly Man page Source code
read.graph Man page
read.graph.dimacs Source code
read.graph.dl Source code
read.graph.edgelist Source code
read.graph.gml Source code
read.graph.graphdb Source code
read.graph.graphml Source code
read.graph.lgl Source code
read.graph.ncol Source code
read.graph.pajek Source code
read.graph.toraw Source code
read_graph Man page Source code
reciprocity Man page Source code
remove.edge.attribute Man page
remove.graph.attribute Man page
remove.vertex.attribute Man page
rename.attr.if.needed Source code
rep.igraph Man page Source code
rev.igraph.es Man page
rev.igraph.vs Man page Source code
rewire Man page Source code
rewire_each_edge Source code
rewire_keeping_degseq Source code
rglplot Man page Source code
rglplot.igraph Man page Source code
ring Man page Source code
running.mean Man page
running_mean Man page Source code
sample_ Man page
sample_asym_pref Man page Source code
sample_bipartite Man page Source code
sample_cit_cit_types Man page Source code
sample_cit_types Man page Source code
sample_correlated_gnp Man page Source code
sample_correlated_gnp_pair Man page Source code
sample_degseq Man page Source code
sample_dirichlet Man page Source code Source code
sample_dot_product Man page Source code
sample_fitness Man page Source code
sample_fitness_pl Man page Source code
sample_forestfire Man page Source code
sample_gnm Man page Source code
sample_gnp Man page Source code
sample_grg Man page Source code
sample_growing Man page Source code
sample_hierarchical_sbm Man page Source code
sample_hrg Man page Source code
sample_islands Man page Source code
sample_k_regular Man page Source code
sample_last_cit Man page Source code
sample_motifs Man page Source code
sample_pa Man page Source code
sample_pa_age Man page Source code
sample_pref Man page Source code
sample_sbm Man page Source code
sample_seq Man page Source code
sample_smallworld Man page Source code
sample_sphere_surface Man page Source code Source code
sample_sphere_volume Man page Source code Source code
sample_traits Man page Source code
sample_traits_callaway Man page Source code
sbm Man page Source code
sbm.game Man page
scan_stat Man page Source code
scan_temp_norm Source code
scan_vertex_norm Source code
scg Man page Source code
scg-method Man page
scg.Matrix Source code
scg.igraph Source code
scg.matrix Source code
scgGrouping Man page
scgNormEps Man page
scgSemiProjectors Man page
scg_eps Man page Source code
scg_group Man page Source code
scg_semi_proj Man page Source code
sdf Source code
seeded.graph.match Man page
sequential_pal Man page Source code
set.edge.attribute Man page
set.graph.attribute Man page
set.vertex.attribute Man page
set_edge_attr Man page Source code
set_graph_attr Man page Source code
set_vertex_attr Man page Source code
shape_noclip Man page Source code
shape_noplot Man page Source code
shapes Man page Source code
shortest.paths Man page
shortest_paths Man page Source code
show_trace Man page Source code
showtrace Man page
similarity Man page Source code
similarity.dice Man page Source code
similarity.invlogweighted Man page Source code
similarity.jaccard Man page Source code
simple_es_index Source code
simple_vs_index Source code
simplified Man page Source code
simplify Man page Source code
sir Man page Source code
sizes Man page Source code
smallworld Man page Source code
solve_LSAP Source code
spectrum Man page Source code
spinglass.community Man page
split_join_distance Man page Source code
srand Man page Source code
stCuts Man page
stMincuts Man page
st_cuts Man page Source code
st_min_cuts Man page Source code
star Man page Source code
static.fitness.game Man page
static.power.law.game Man page
stochastic_matrix Man page Source code
str.igraph Man page Source code
strength Man page Source code
subcomponent Man page Source code
subgraph Man page Source code
subgraph.centrality Man page
subgraph.edges Man page Source code
subgraph_centrality Man page Source code
subgraph_isomorphic Man page Source code
subgraph_isomorphisms Man page Source code
substitute_ Source code
summary.cohesiveBlocks Man page Source code
summary.igraph Man page Source code
summary.nexusDatasetInfoList Man page Source code
tail_of Man page Source code
time_bins Man page Source code
time_bins.sir Man page Source code
tk_canvas Man page Source code
tk_center Man page Source code
tk_close Man page Source code
tk_coords Man page Source code
tk_fit Man page Source code
tk_off Man page Source code
tk_postscript Man page Source code
tk_reshape Man page Source code
tk_rotate Man page Source code
tk_set_coords Man page Source code
tkigraph Man page Source code
tkigraph.about Source code
tkigraph.add.graph Source code
tkigraph.atlas Source code
tkigraph.barabasi.game Source code
tkigraph.betweenness Source code
tkigraph.by.hand Source code
tkigraph.calculate.clusters Source code
tkigraph.close Source code
tkigraph.closeness Source code
tkigraph.clusters Source code
tkigraph.clusters.membership Source code
tkigraph.cohesion Source code
tkigraph.constraints Source code
tkigraph.create.comp Source code
tkigraph.create.giantcomp Source code
tkigraph.create.mycomp Source code
tkigraph.degree Source code
tkigraph.degree.dist Source code
tkigraph.degree.sequence.game Source code
tkigraph.delete Source code
tkigraph.dialogbox Source code
tkigraph.diameter Source code
tkigraph.dist.matrix Source code
tkigraph.distance.tofrom Source code
tkigraph.edge.betweenness Source code
tkigraph.erdos.renyi.game Source code
tkigraph.erdos.renyi.gnm.game Source code
tkigraph.error Source code
tkigraph.export.adjacency Source code
tkigraph.export.edgelist Source code
tkigraph.export.pajek Source code
tkigraph.full Source code
tkigraph.get.selected Source code
tkigraph.graph.adjacency Source code
tkigraph.help Source code
tkigraph.help.external Source code
tkigraph.import.adjacency Source code
tkigraph.import.edgelist Source code
tkigraph.import.pajek Source code
tkigraph.lattice Source code
tkigraph.load Source code
tkigraph.load.online Source code
tkigraph.motifs.draw Source code
tkigraph.motifs.find Source code
tkigraph.my.spinglass Source code
tkigraph.page.rank Source code
tkigraph.plot Source code
tkigraph.plot.comp Source code
tkigraph.plot.diameter Source code
tkigraph.power.centrality Source code
tkigraph.ring Source code
tkigraph.save Source code
tkigraph.show Source code
tkigraph.showData Source code
tkigraph.simplify Source code
tkigraph.spinglass Source code
tkigraph.spinglass.community.dialog Source code
tkigraph.spinglass.mycommunity.dialog Source code
tkigraph.star Source code
tkigraph.stat Source code
tkigraph.tree Source code
tkigraph.warning Source code
tkigraph.watts.strogatz Source code
tkplot Man page Source code
tkplot.addlayout Source code
tkplot.canvas Man page
tkplot.center Man page
tkplot.close Man page
tkplot.convert.color Source code
tkplot.convert.font Source code
tkplot.create.edge Source code
tkplot.create.edges Source code
tkplot.create.vertex Source code
tkplot.create.vertices Source code
tkplot.deselect.all Source code
tkplot.deselect.current Source code
tkplot.deselect.edge Source code
tkplot.deselect.label Source code
tkplot.deselect.this Source code
tkplot.deselect.vertex Source code
tkplot.export.postscript Man page
tkplot.fit.to.screen Man page
tkplot.get Source code
tkplot.get.numeric.vector Source code
tkplot.get.selected.edges Source code
tkplot.get.selected.vertices Source code
tkplot.getcoords Man page
tkplot.getlayout Source code
tkplot.getlayoutlist Source code
tkplot.getlayoutname Source code
tkplot.layout.dialog Source code
tkplot.layout.menu Source code
tkplot.layouts.newdefaults Source code
tkplot.new Source code
tkplot.off Man page
tkplot.reshape Man page
tkplot.rotate Man page
tkplot.select.all.edges Source code
tkplot.select.all.vertices Source code
tkplot.select.color Source code
tkplot.select.current Source code
tkplot.select.edge Source code
tkplot.select.label Source code
tkplot.select.menu Source code
tkplot.select.number Source code
tkplot.select.some.edges Source code
tkplot.select.some.vertices Source code
tkplot.select.this Source code
tkplot.select.vertex Source code
tkplot.set Source code
tkplot.set.label.degree Source code
tkplot.set.params Source code
tkplot.set.vertex.coords Source code
tkplot.setcoords Man page
tkplot.toggle.grid Source code
tkplot.toggle.labels Source code
tkplot.update.edge Source code
tkplot.update.edge.color Source code
tkplot.update.edge.width Source code
tkplot.update.label Source code
tkplot.update.vertex Source code
tkplot.update.vertex.color Source code
tkplot.update.vertex.size Source code
tkplot.update.vertices Source code
topo_sort Man page Source code
topological.sort Man page
traits Man page Source code
traits_callaway Man page Source code
transitivity Man page Source code
tree Man page Source code
triad.census Man page
triad_census Man page Source code
triangles Man page Source code
undirected_graph Man page Source code
unfold.tree Man page
unfold_tree Man page Source code
union Man page Source code
union.default Source code
union.igraph Man page Source code
union.igraph.es Man page
union.igraph.vs Man page Source code
unique.igraph.es Man page Source code
unique.igraph.vs Man page Source code
upgrade_graph Man page Source code
vcount Man page
vertex Man page Source code
vertex.attributes Man page Source code
vertex.attributes<- Man page
vertex.connectivity Man page
vertex.disjoint.paths Man page
vertex.shape.pie Man page
vertex.shapes Man page
vertex_attr Man page Source code
vertex_attr<- Man page
vertex_attr_names Man page Source code
vertex_connectivity Man page Source code
vertex_disjoint_paths Man page Source code
vertices Man page
walktrap.community Man page
warn_version Source code
watts.strogatz.game Man page
weak_ref_key Source code
weak_ref_run_finalizer Source code
weak_ref_value Source code
which_loop Man page Source code
which_multiple Man page Source code
which_mutual Man page Source code
with_dh Man page Source code
with_drl Man page Source code
with_edge_ Man page Source code
with_fr Man page Source code
with_gem Man page Source code
with_graph_ Man page Source code
with_graphopt Man page Source code
with_kk Man page Source code
with_lgl Man page Source code
with_mds Man page Source code
with_sugiyama Man page Source code
with_vertex_ Man page Source code
without_attr Man page Source code
without_loops Man page Source code
without_multiples Man page Source code
write.graph Man page
write.graph.dimacs Source code
write.graph.dot Source code
write.graph.edgelist Source code
write.graph.fromraw Source code
write.graph.gml Source code
write.graph.graphml Source code
write.graph.leda Source code
write.graph.lgl Source code
write.graph.ncol Source code
write.graph.pajek Source code
write_graph Man page Source code

Files

inst
inst/my_html_library.tcl
inst/html_library.tcl
inst/CITATION
inst/tests
inst/tests/test_graph.density.R
inst/tests/test-old-data-type.R
inst/tests/test_alpha.centrality.R
inst/tests/test_correlated.R
inst/tests/test_dominator.tree.R
inst/tests/test_girth.R
inst/tests/test_edge.connectivity.R
inst/tests/test_get.shortest.paths.R
inst/tests/test_fartherst.nodes.R
inst/tests/test_callbacks.R
inst/tests/test_are.connected.R
inst/tests/test_articulation.points.R
inst/tests/test_operators.R
inst/tests/test_communities.R
inst/tests/test_operators4.R
inst/tests/test_bug-1073800-clique.R
inst/tests/test_indexing3.R
inst/tests/test_attributes.R
inst/tests/test_sdf.R
inst/tests/test_forestfire.R
inst/tests/test_neighborhood.R
inst/tests/test_decompose.graph.R
inst/tests/test_layout.mds.R
inst/tests/test_arpack.R
inst/tests/test_igraph.options.R
inst/tests/dyad.census.R
inst/tests/test_edge.betweenness.community.R
inst/tests/test_layout.fr.R
inst/tests/test_bonpow.R
inst/tests/test_graphlets.R
inst/tests/test_graph.subisomorphic.vf2.R
inst/tests/test-vs-es.R
inst/tests/test-vs-es-printing.R
inst/tests/test-weakref.R
inst/tests/test_largest.cliques.R
inst/tests/test_average.path.length.R
inst/tests/test_sample.R
inst/tests/test_is.bipartite.R
inst/tests/test_iterators.R
inst/tests/test_graph.atlas.R
inst/tests/test_bug-1019624.R
inst/tests/test_graph.data.frame.R
inst/tests/test_minimal.st.separators.R
inst/tests/test_evcent.R
inst/tests/test_delete.vertices.R
inst/tests/test_dot.product.game.R
inst/tests/test_optimal.community.R
inst/tests/test_assortativity.R
inst/tests/test-random_walk.R
inst/tests/test_graph.de.bruijn.R
inst/tests/test_neighbors.R
inst/tests/test_authority.score.R
inst/tests/test_edgenames.R
inst/tests/test-make_graph.R
inst/tests/test_bug-1073705-indexing.R
inst/tests/test_pajek.R
inst/tests/test_independent.vertex.sets.R
inst/tests/test_dimSelect.R
inst/tests/test-isomorphism.R
inst/tests/test_bug-1033045.R
inst/tests/test_graph.maxflow.R
inst/tests/test_multilevel.community.R
inst/tests/test_adjacency.spectral.embedding.R
inst/tests/test_operators3.R
inst/tests/test_scg.R
inst/tests/test_as.directed.R
inst/tests/test_layout.gem.R
inst/tests/test_laplacian.spectral.embedding.R
inst/tests/test_closeness.R
inst/tests/test_walktrap.community.R
inst/tests/test_hsbm.R
inst/tests/test-version.R
inst/tests/test_graphNEL.R
inst/tests/test_label.propagation.community.R
inst/tests/test_fastgreedy.community.R
inst/tests/test-vs-es-quirks.R
inst/tests/test_graph.adhesion.R
inst/tests/test_graph.formula.R
inst/tests/test-new-layout-api.R
inst/tests/test_minimum.size.separators.R
inst/tests/test_graph.isoclass.R
inst/tests/test_indexing.R
inst/tests/test_triangles.R
inst/tests/test_delete.edges.R
inst/tests/test_ba.game.R
inst/tests/test_motifs.R
inst/tests/test_graph.knn.R
inst/tests/test-notable.R
inst/tests/test_constraint.R
inst/tests/test_degree.R
inst/tests/test_graph.complementer.R
inst/tests/test_clusters.R
inst/tests/test_graph.subisomorphic.lad.R
inst/tests/test_graph.adjacency.R
inst/tests/test_betweenness.R
inst/tests/test_as.undirected.R
inst/tests/test-index-es.R
inst/tests/test_bipartite.random.game.R
inst/tests/test_count.multiple.R
inst/tests/test-make.R
inst/tests/test_dyad.census.R
inst/tests/test_modularity_matrix.R
inst/tests/test_graph.bipartite.R
inst/tests/test-constructor-modifiers.R
inst/tests/test_edge.betweenness.R
inst/tests/test_graph.mincut.R
inst/tests/celegansneural.gml.gz
inst/tests/football.gml.gz
inst/tests/test_is.chordal.R
inst/tests/test_watts.strogatz.game.R
inst/tests/test_transitivity.R
inst/tests/test-versions.R
inst/tests/test_graph.edgelist.R
inst/tests/test_sir.R
inst/tests/test_get.adjacency.R
inst/tests/test_graph.kautz.R
inst/tests/test_cliques.R
inst/tests/test_indexing2.R
inst/tests/test_graph.compose.R
inst/tests/test_sgm.R
inst/tests/test_graph.bfs.R
inst/tests/test_scan.R
inst/tests/test_get.adjlist.R
inst/tests/test_bug-1032819.R
inst/tests/test_diameter.R
inst/tests/test_biconnected.components.R
inst/tests/test_contract.vertices.R
inst/tests/test_graph.coreness.R
inst/tests/test_print.R
inst/tests/test_sbm.game.R
inst/tests/test_get.edgelist.R
inst/tests/test_psumtree.R
inst/tests/test_maximal_cliques.R
inst/tests/test-vs-indexing-lapply.R
inst/tests/test_add.vertices.R
inst/tests/power.gml.gz
inst/tests/test_graph.adjlist.R
inst/tests/test_leading.eigenvector.community.R
inst/tests/test_hrg.R
inst/tests/test-vs-operators.R
inst/tests/test_layout.kk.R
inst/tests/test_graph.eigen.R
inst/tests/test_bipartite.projection.R
inst/tests/test_get.edge.R
inst/tests/test_degree.sequence.game.R
inst/tests/test_get.diameter.R
inst/tests/test_get.incidence.R
inst/tests/test_layout.merge.R
inst/tests/test_add.edges.R
inst/tests/test_sphere.R
inst/tests/test_all.st.cuts.R
inst/tests/test_unfold.tree.R
inst/tests/test_canonical.permutation.R
inst/tests/test_largest.independent.vertex.sets.R
inst/tests/test_get.all.shortest.paths.R
inst/AUTHORS
inst/html_library.license.terms
inst/igraph2.gif
inst/NEWS.md
inst/README.md
inst/tkigraph_help
inst/tkigraph_help/index.html
inst/tkigraph_help/communities.html
inst/tkigraph_help/style.css
inst/tkigraph_help/tkigraph-main.gif
inst/benchmarks
inst/benchmarks/time_dirSelect.R
inst/benchmarks/time_fr_layout.R
inst/benchmarks/correlated.R
inst/benchmarks/time_sir.R
inst/benchmarks/local.scan.R
inst/benchmarks/time_kk_layout.R
inst/benchmarks/time_sgm.R
inst/benchmarks/time_print.R
inst/benchmarks/time_call.R
inst/igraph.gif
configure.ac
src
src/NetDataTypes.h
src/bignum.h
src/walktrap_communities.cpp
src/bliss_partition.hh
src/bliss_defs.hh
src/infomap_FlowGraph.cc
src/DensityGrid_3d.h
src/cliques.c
src/matrix.c
src/bigint.c
src/gengraph_vertex_cover.h
src/gengraph_header.h
src/foreign-pajek-lexer.c
src/foreign-ncol-lexer.c
src/foreign-dl-parser.c
src/igraph_math.h
src/distances.c
src/glpk_support.c
src/igraph_blas_internal.h
src/hrg_splittree_eq.h
src/dsgets.f
src/drl_graph_3d.h
src/walktrap_graph.cpp
src/walktrap.cpp
src/gengraph_powerlaw.cpp
src/gengraph_degree_sequence.h
src/layout_gem.c
src/conversion.c
src/lazyeval.c
src/scg.c
src/foreign-pajek-lexer.l
src/separators.c
src/progress.c
src/lad.c
src/layout.c
src/foreign-lgl-parser.h
src/NetRoutines.cpp
src/other.c
src/attributes.c
src/dstatn.f
src/heap.pmt
src/foreign-pajek-header.h
src/igraph_version.h
src/igraph_lapack_internal.h
src/walktrap_communities.h
src/foreign-graphml.c
src/clustertool.cpp
src/foreign-gml-lexer.l
src/infomap_Greedy.h
src/foreign-gml-header.h
src/prpack.cpp
src/dnconv.f
src/igraph_hashtable.c
src/community.c
src/config.h.in
src/dsaup2.f
src/vector_ptr.c
src/bliss_utils.cc
src/array.pmt
src/infomap_FlowGraph.h
src/dnaupd.f
src/heap.c
src/igraph_arpack_internal.h
src/components.c
src/sugiyama.c
src/drl_layout.cpp
src/random_walk.c
src/foreign.c
src/layout_fr.c
src/types.c
src/rinterface_extra.c
src/vector.pmt
src/foreign-pajek-parser.h
src/mixing.c
src/bfgs.c
src/bliss_kqueue.hh
src/vector.c
src/rinterface.h
src/pstdint.h
src/drl_graph_3d.cpp
src/foreign-pajek-parser.y
src/igraph_threading.h
src/dsortc.f
src/atlas.c
src/forestfire.c
src/dotproduct.c
src/igraph_strvector.c
src/complex.c
src/dqueue.c
src/igraph_heap.c
src/igraph_set.c
src/DensityGrid.cpp
src/topology.c
src/foreign-gml-lexer.c
src/foreign-lgl-lexer.c
src/igraph_gml_tree.h
src/scg_approximate_methods.c
src/decomposition.c
src/igraph_hacks_internal.h
src/igraph_interrupt_internal.h
src/random.c
src/prpack.h
src/igraph_hrg_types.cc
src/drl_Node_3d.h
src/foreign-ncol-lexer.l
src/spectral_properties.c
src/paths.c
src/dgetv0.f
src/config.h
src/cattributes.c
src/bliss_heap.hh
src/gengraph_random.cpp
src/dsesrt.f
src/memory.c
src/dsapps.f
src/infomap_Node.cc
src/operators.c
src/bliss_graph.cc
src/gengraph_definitions.h
src/interrupt.c
src/hrg_dendro.h
src/igraph_error.c
src/foreign-lgl-header.h
src/spanning_trees.c
src/NetRoutines.h
src/math.c
src/plfit
src/plfit/arithmetic_sse_double.h
src/plfit/kolmogorov.h
src/plfit/arithmetic_ansi.h
src/plfit/gss.h
src/plfit/lbfgs.c
src/plfit/error.h
src/plfit/zeta.h
src/plfit/error.c
src/plfit/plfit.h
src/plfit/kolmogorov.c
src/plfit/arithmetic_sse_float.h
src/plfit/gss.c
src/plfit/plfit.inc
src/plfit/options.c
src/plfit/platform.h
src/plfit/zeta.c
src/plfit/lbfgs.h
src/plfit/plfit.c
src/igraph_estack.h
src/lsap.c
src/structure_generators.c
src/scg_headers.h
src/drl_layout_3d.cpp
src/bliss_graph.hh
src/foreign-dl-parser.h
src/gml_tree.c
src/igraph_estack.c
src/motifs.c
src/spmatrix.c
src/igraph_glpk_support.h
src/walktrap_heap.cpp
src/bliss_orbit.hh
src/eigen.c
src/visitors.c
src/dstqrb.f
src/uuid
src/uuid/COPYING
src/uuid/isnull.c
src/uuid/copy.c
src/uuid/win32
src/uuid/win32/config.h
src/uuid/uuid.h
src/uuid/uuidP.h
src/uuid/R.c
src/uuid/config.h.in
src/uuid/gen_uuid.c
src/uuid/compare.c
src/uuid/unpack.c
src/uuid/uuidd.h
src/uuid/clear.c
src/uuid/Makevars.in
src/uuid/pack.c
src/uuid/Makevars.win
src/uuid/unparse.c
src/uuid/parse.c
src/hrg_rbtree.h
src/foreign-dl-header.h
src/hacks.c
src/dnaup2.f
src/bliss_kstack.hh
src/igraph_marked_queue.h
src/second.f
src/scg_exact_scg.c
src/drl_layout_3d.h
src/CHOLMOD
src/CHOLMOD/Makefile
src/CHOLMOD/Modify
src/CHOLMOD/Modify/License.txt
src/CHOLMOD/Modify/t_cholmod_updown_numkr.c
src/CHOLMOD/Modify/gpl.txt
src/CHOLMOD/Modify/cholmod_updown.c
src/CHOLMOD/Modify/t_cholmod_updown.c
src/CHOLMOD/Modify/cholmod_rowdel.c
src/CHOLMOD/Modify/cholmod_rowadd.c
src/CHOLMOD/Cholesky
src/CHOLMOD/Cholesky/cholmod_colamd.c
src/CHOLMOD/Cholesky/License.txt
src/CHOLMOD/Cholesky/t_cholmod_lsolve.c
src/CHOLMOD/Cholesky/cholmod_etree.c
src/CHOLMOD/Cholesky/cholmod_resymbol.c
src/CHOLMOD/Cholesky/t_cholmod_ltsolve.c
src/CHOLMOD/Cholesky/cholmod_rowfac.c
src/CHOLMOD/Cholesky/cholmod_solve.c
src/CHOLMOD/Cholesky/cholmod_rcond.c
src/CHOLMOD/Cholesky/cholmod_spsolve.c
src/CHOLMOD/Cholesky/cholmod_amd.c
src/CHOLMOD/Cholesky/cholmod_factorize.c
src/CHOLMOD/Cholesky/cholmod_postorder.c
src/CHOLMOD/Cholesky/cholmod_analyze.c
src/CHOLMOD/Cholesky/cholmod_rowcolcounts.c
src/CHOLMOD/Cholesky/t_cholmod_rowfac.c
src/CHOLMOD/Cholesky/t_cholmod_solve.c
src/CHOLMOD/Cholesky/lesser.txt
src/CHOLMOD/Check
src/CHOLMOD/Check/License.txt
src/CHOLMOD/Check/cholmod_write.c
src/CHOLMOD/Check/cholmod_check.c
src/CHOLMOD/Check/cholmod_read.c
src/CHOLMOD/Check/lesser.txt
src/CHOLMOD/Supernodal
src/CHOLMOD/Supernodal/cholmod_super_symbolic.c
src/CHOLMOD/Supernodal/License.txt
src/CHOLMOD/Supernodal/gpl.txt
src/CHOLMOD/Supernodal/t_cholmod_gpu.c
src/CHOLMOD/Supernodal/t_cholmod_super_numeric.c
src/CHOLMOD/Supernodal/cholmod_super_solve.c
src/CHOLMOD/Supernodal/cholmod_super_numeric.c
src/CHOLMOD/Supernodal/t_cholmod_super_solve.c
src/CHOLMOD/Partition
src/CHOLMOD/Partition/License.txt
src/CHOLMOD/Partition/cholmod_nesdis.c
src/CHOLMOD/Partition/cholmod_csymamd.c
src/CHOLMOD/Partition/cholmod_camd.c
src/CHOLMOD/Partition/cholmod_ccolamd.c
src/CHOLMOD/Partition/cholmod_metis.c
src/CHOLMOD/Partition/lesser.txt
src/CHOLMOD/Core
src/CHOLMOD/Core/cholmod_change_factor.c
src/CHOLMOD/Core/cholmod_aat.c
src/CHOLMOD/Core/License.txt
src/CHOLMOD/Core/cholmod_transpose.c
src/CHOLMOD/Core/cholmod_add.c
src/CHOLMOD/Core/cholmod_copy.c
src/CHOLMOD/Core/cholmod_dense.c
src/CHOLMOD/Core/t_cholmod_change_factor.c
src/CHOLMOD/Core/t_cholmod_dense.c
src/CHOLMOD/Core/cholmod_common.c
src/CHOLMOD/Core/cholmod_triplet.c
src/CHOLMOD/Core/cholmod_error.c
src/CHOLMOD/Core/cholmod_version.c
src/CHOLMOD/Core/cholmod_memory.c
src/CHOLMOD/Core/cholmod_complex.c
src/CHOLMOD/Core/t_cholmod_transpose.c
src/CHOLMOD/Core/cholmod_factor.c
src/CHOLMOD/Core/t_cholmod_triplet.c
src/CHOLMOD/Core/cholmod_sparse.c
src/CHOLMOD/Core/cholmod_band.c
src/CHOLMOD/Core/lesser.txt
src/CHOLMOD/MatrixOps
src/CHOLMOD/MatrixOps/cholmod_norm.c
src/CHOLMOD/MatrixOps/License.txt
src/CHOLMOD/MatrixOps/gpl.txt
src/CHOLMOD/MatrixOps/t_cholmod_sdmult.c
src/CHOLMOD/MatrixOps/cholmod_submatrix.c
src/CHOLMOD/MatrixOps/cholmod_sdmult.c
src/CHOLMOD/MatrixOps/cholmod_horzcat.c
src/CHOLMOD/MatrixOps/cholmod_symmetry.c
src/CHOLMOD/MatrixOps/cholmod_scale.c
src/CHOLMOD/MatrixOps/cholmod_drop.c
src/CHOLMOD/MatrixOps/cholmod_vertcat.c
src/CHOLMOD/MatrixOps/cholmod_ssmult.c
src/CHOLMOD/README.txt
src/CHOLMOD/Include
src/CHOLMOD/Include/cholmod.h
src/CHOLMOD/Include/License.txt
src/CHOLMOD/Include/cholmod_modify.h
src/CHOLMOD/Include/cholmod_complexity.h
src/CHOLMOD/Include/cholmod_io64.h
src/CHOLMOD/Include/cholmod_camd.h
src/CHOLMOD/Include/cholmod_blas.h
src/CHOLMOD/Include/cholmod_matrixops.h
src/CHOLMOD/Include/cholmod_internal.h
src/CHOLMOD/Include/cholmod_config.h
src/CHOLMOD/Include/cholmod_template.h
src/CHOLMOD/Include/cholmod_core.h
src/CHOLMOD/Include/cholmod_supernodal.h
src/CHOLMOD/Include/cholmod_cholesky.h
src/CHOLMOD/Include/README.txt
src/CHOLMOD/Include/cholmod_check.h
src/CHOLMOD/Include/cholmod_partition.h
src/drl_parse.h
src/dnaitr.f
src/gengraph_qsort.h
src/gengraph_graph_molloy_hash.cpp
src/arpack.c
src/hrg_graph_simp.h
src/igraph_flow_internal.h
src/bipartite.c
src/ivout.f
src/matching.c
src/st-cuts.c
src/foreign-gml-parser.c
src/simpleraytracer
src/simpleraytracer/Light.h
src/simpleraytracer/unit_limiter.h
src/simpleraytracer/Point.h
src/simpleraytracer/Ray.cpp
src/simpleraytracer/RayTracer.cpp
src/simpleraytracer/Ray.h
src/simpleraytracer/RayVector.h
src/simpleraytracer/Sphere.cpp
src/simpleraytracer/RayVector.cpp
src/simpleraytracer/Color.cpp
src/simpleraytracer/Sphere.h
src/simpleraytracer/Shape.h
src/simpleraytracer/Point.cpp
src/simpleraytracer/Color.h
src/simpleraytracer/Light.cpp
src/simpleraytracer/Triangle.cpp
src/simpleraytracer/unit_limiter.cpp
src/simpleraytracer/RIgraphRay.cpp
src/simpleraytracer/Shape.cpp
src/simpleraytracer/Triangle.h
src/simpleraytracer/RayTracer.h
src/pottsmodel_2.h
src/bliss_timer.cc
src/bliss_eqrefhash.hh
src/cores.c
src/basic_query.c
src/walktrap_graph.h
src/gengraph_mr-connected.cpp
src/layout_kk.c
src/foreign-ncol-parser.c
src/infomap_Greedy.cc
src/stat.h
src/Makevars.in
src/scan.c
src/dngets.f
src/dqueue.pmt
src/bliss_partition.cc
src/gengraph_powerlaw.h
src/maximal_cliques_template.h
src/dsaitr.f
src/optimal_modularity.c
src/scg_optimal_method.c
src/centrality.c
src/feedback_arc_set.c
src/sir.c
src/CHOLMOD.diff
src/debug.h
src/flow.c
src/igraph_stack.c
src/dstats.f
src/infomap_Node.h
src/foreign-gml-parser.h
src/gengraph_graph_molloy_hash.h
src/embedding.c
src/bliss_bignum.hh
src/SuiteSparse_config
src/SuiteSparse_config/Makefile
src/SuiteSparse_config/SuiteSparse_config_Mac.mk
src/SuiteSparse_config/SuiteSparse_config.c
src/SuiteSparse_config/SuiteSparse_config.h
src/SuiteSparse_config/SuiteSparse_config.mk
src/SuiteSparse_config/SuiteSparse_config_GPU.mk
src/SuiteSparse_config/README.txt
src/DensityGrid_3d.cpp
src/qsort.c
src/glpk
src/glpk/amd
src/glpk/amd/COPYING
src/glpk/amd/amd_aat.c
src/glpk/amd/amd.h
src/glpk/amd/amd_info.c
src/glpk/amd/amd_internal.h
src/glpk/amd/amd_preprocess.c
src/glpk/amd/amd_postorder.c
src/glpk/amd/amd_control.c
src/glpk/amd/README
src/glpk/amd/amd_order.c
src/glpk/amd/amd_dump.c
src/glpk/amd/amd_defaults.c
src/glpk/amd/amd_valid.c
src/glpk/amd/amd_1.c
src/glpk/amd/amd_2.c
src/glpk/amd/amd_post_tree.c
src/glpk/glpmpl03.c
src/glpk/glpapi04.c
src/glpk/glpnpp05.c
src/glpk/COPYING
src/glpk/glpenv03.c
src/glpk/glplpf.c
src/glpk/glpenv05.c
src/glpk/glpios02.c
src/glpk/glpssx.h
src/glpk/glpios11.c
src/glpk/glpmps.c
src/glpk/glpspm.c
src/glpk/glplux.c
src/glpk/glpapi02.c
src/glpk/glpspx02.c
src/glpk/glplib02.c
src/glpk/glpenv06.c
src/glpk/glpfhv.c
src/glpk/glpmpl02.c
src/glpk/glpdmp.h
src/glpk/glplib.h
src/glpk/glpspm.h
src/glpk/glpnet08.c
src/glpk/glpios05.c
src/glpk/glpnet.h
src/glpk/glpapi03.c
src/glpk/glpbfx.h
src/glpk/glpenv02.c
src/glpk/glplpx03.c
src/glpk/glpmpl05.c
src/glpk/glpgmp.c
src/glpk/glpnet04.c
src/glpk/glpscf.c
src/glpk/glpbfx.c
src/glpk/glprng.h
src/glpk/glpini02.c
src/glpk/glpmpl.h
src/glpk/glpenv01.c
src/glpk/glpk.h
src/glpk/glpapi11.c
src/glpk/glpscf.h
src/glpk/glpluf.h
src/glpk/glphbm.c
src/glpk/glpluf.c
src/glpk/glpios08.c
src/glpk/glplux.h
src/glpk/glpnpp01.c
src/glpk/glpmpl06.c
src/glpk/glpipm.c
src/glpk/glpsql.h
src/glpk/glpapi16.c
src/glpk/glptsp.h
src/glpk/glpipm.h
src/glpk/glpmpl01.c
src/glpk/glpenv07.c
src/glpk/glpnet02.c
src/glpk/glpapi07.c
src/glpk/glpenv.h
src/glpk/glpbfd.h
src/glpk/glpspx.h
src/glpk/glprgr.c
src/glpk/README
src/glpk/glpsql.c
src/glpk/glpscl.c
src/glpk/glprng01.c
src/glpk/glpapi.h
src/glpk/glpios.h
src/glpk/glpapi05.c
src/glpk/glpapi14.c
src/glpk/glpios12.c
src/glpk/glpnet07.c
src/glpk/glpapi17.c
src/glpk/glpnpp03.c
src/glpk/glpini01.c
src/glpk/glpios06.c
src/glpk/glpgmp.h
src/glpk/glpenv08.c
src/glpk/glpapi06.c
src/glpk/glplpx01.c
src/glpk/glpmat.c
src/glpk/glpios04.c
src/glpk/glpnet03.c
src/glpk/glpnet05.c
src/glpk/glpios01.c
src/glpk/glptsp.c
src/glpk/glpnet06.c
src/glpk/glpcpx.c
src/glpk/glpdmx.c
src/glpk/glpapi10.c
src/glpk/glpspx01.c
src/glpk/glpapi13.c
src/glpk/glpnet09.c
src/glpk/glpdmp.c
src/glpk/colamd
src/glpk/colamd/colamd.c
src/glpk/colamd/COPYING
src/glpk/colamd/colamd.h
src/glpk/colamd/README
src/glpk/glpapi19.c
src/glpk/glpssx02.c
src/glpk/glpapi15.c
src/glpk/glpapi12.c
src/glpk/glpios10.c
src/glpk/glplpx02.c
src/glpk/glphbm.h
src/glpk/glpfhv.h
src/glpk/glpbfd.c
src/glpk/glpios03.c
src/glpk/glpavl.c
src/glpk/glpnpp04.c
src/glpk/glpios09.c
src/glpk/glplpf.h
src/glpk/glpmat.h
src/glpk/glpnet01.c
src/glpk/glpapi08.c
src/glpk/glpnpp.h
src/glpk/glpqmd.c
src/glpk/glpapi18.c
src/glpk/glpsdf.c
src/glpk/glpenv04.c
src/glpk/glplib01.c
src/glpk/glpqmd.h
src/glpk/glpk.inc
src/glpk/glpssx01.c
src/glpk/glpios07.c
src/glpk/glpmpl04.c
src/glpk/glpapi01.c
src/glpk/glpstd.h
src/glpk/glprng02.c
src/glpk/glpavl.h
src/glpk/glplib03.c
src/glpk/glprgr.h
src/glpk/glpapi09.c
src/glpk/glpnpp02.c
src/sbm.c
src/dsortr.f
src/blas.c
src/bliss_orbit.cc
src/structural_properties.c
src/stack.pmt
src/dlaqrb.f
src/microscopic_update.c
src/igraph_trie.c
src/dsaupd.f
src/bliss.cc
src/qsort_r.c
src/drl_parse.cpp
src/array.c
src/cocitation.c
src/gengraph_hash.h
src/zeroin.c
src/foreign-lgl-lexer.l
src/hrg_graph.h
src/bliss_heap.cc
src/prpack
src/prpack/prpack.inc
src/prpack/prpack_solver.cpp
src/prpack/prpack_edge_list.h
src/prpack/prpack_utils.h
src/prpack/prpack_igraph_graph.cpp
src/prpack/prpack_preprocessed_schur_graph.h
src/prpack/prpack_solver.h
src/prpack/prpack.h
src/prpack/prpack_utils.cpp
src/prpack/prpack_result.cpp
src/prpack/prpack_preprocessed_graph.h
src/prpack/prpack_csr.h
src/prpack/prpack_csc.h
src/prpack/prpack_preprocessed_ge_graph.cpp
src/prpack/prpack_preprocessed_scc_graph.h
src/prpack/prpack_igraph_graph.h
src/prpack/prpack_preprocessed_gs_graph.cpp
src/prpack/prpack_preprocessed_ge_graph.h
src/prpack/prpack_base_graph.h
src/prpack/prpack_result.h
src/prpack/prpack_base_graph.cpp
src/prpack/prpack_preprocessed_schur_graph.cpp
src/prpack/prpack_preprocessed_scc_graph.cpp
src/prpack/prpack_preprocessed_gs_graph.h
src/triangles.c
src/gengraph_random.h
src/scg_kmeans.c
src/gengraph_graph_molloy_optimized.cpp
src/statusbar.c
src/foreign-pajek-parser.c
src/drl_graph.cpp
src/dseupd.f
src/iterators.c
src/igraph_fixed_vectorlist.c
src/igraph_psumtree.c
src/AMD
src/AMD/Source
src/AMD/Source/amd_global.c
src/AMD/Source/amd_aat.c
src/AMD/Source/amd_info.c
src/AMD/Source/amd.f
src/AMD/Source/amd_preprocess.c
src/AMD/Source/amd_postorder.c
src/AMD/Source/amdbar.f
src/AMD/Source/amd_control.c
src/AMD/Source/amd_order.c
src/AMD/Source/amd_dump.c
src/AMD/Source/amd_defaults.c
src/AMD/Source/amd_valid.c
src/AMD/Source/amd_1.c
src/AMD/Source/amd_2.c
src/AMD/Source/amd_post_tree.c
src/AMD/Makefile
src/AMD/README.txt
src/AMD/Include
src/AMD/Include/amd.h
src/AMD/Include/amd_internal.h
src/triangles_template.h
src/gengraph_box_list.cpp
src/layout_dh.c
src/Makevars.win
src/gengraph_box_list.h
src/COLAMD
src/COLAMD/Source
src/COLAMD/Source/colamd.c
src/COLAMD/Source/colamd_global.c
src/COLAMD/Makefile
src/COLAMD/README.txt
src/COLAMD/Include
src/COLAMD/Include/colamd.h
src/scg_utils.c
src/bignum.c
src/games.c
src/maximal_cliques.c
src/igraph_buckets.c
src/matrix.pmt
src/foreign-gml-parser.y
src/igraph_marked_queue.c
src/triangles_template1.h
src/foreign-dl-lexer.l
src/igraph_grid.c
src/infomap.cc
src/cohesive_blocks.c
src/drl_Node.h
src/pottsmodel_2.cpp
src/foreign-lgl-parser.y
src/bliss_timer.hh
src/bliss_eqrefhash.cc
src/glet.c
src/fast_community.c
src/gengraph_degree_sequence.cpp
src/type_indexededgelist.c
src/dneupd.f
src/foreign-dl-lexer.c
src/foreign-ncol-parser.h
src/bliss_utils.hh
src/DensityGrid.h
src/gengraph_graph_molloy_optimized.h
src/adjlist.c
src/NetDataTypes.cpp
src/dnapps.f
src/drl_layout.h
src/foreign-ncol-header.h
src/lapack.c
src/atlas-edges.h
src/dsconv.f
src/rinterface.c
src/cs
src/cs/cs_house.c
src/cs/cs_ipvec.c
src/cs/cs_qr.c
src/cs/cs_post.c
src/cs/cs_permute.c
src/cs/cs_ereach.c
src/cs/cs_multiply.c
src/cs/cs_leaf.c
src/cs/cs_ltsolve.c
src/cs/cs_updown.c
src/cs/cs_util.c
src/cs/cs_cumsum.c
src/cs/cs_fkeep.c
src/cs/cs_chol.c
src/cs/cs_randperm.c
src/cs/cs_counts.c
src/cs/cs_cholsol.c
src/cs/cs_norm.c
src/cs/cs_print.c
src/cs/cs_etree.c
src/cs/cs_entry.c
src/cs/cs_load.c
src/cs/cs_droptol.c
src/cs/cs_qrsol.c
src/cs/cs_add.c
src/cs/cs_usolve.c
src/cs/cs_malloc.c
src/cs/cs_lu.c
src/cs/cs_maxtrans.c
src/cs/cs_symperm.c
src/cs/cs_lusol.c
src/cs/cs_schol.c
src/cs/cs_transpose.c
src/cs/cs.h
src/cs/cs_spsolve.c
src/cs/cs_happly.c
src/cs/cs_compress.c
src/cs/cs_reach.c
src/cs/cs_pvec.c
src/cs/cs_dfs.c
src/cs/cs_dupl.c
src/cs/UFconfig.h
src/cs/cs_tdfs.c
src/cs/cs_amd.c
src/cs/cs_scatter.c
src/cs/cs_pinv.c
src/cs/cs_lsolve.c
src/cs/cs_utsolve.c
src/cs/cs_dmperm.c
src/cs/cs_dropzeros.c
src/cs/cs_scc.c
src/cs/cs_gaxpy.c
src/cs/cs_sqr.c
src/drl_graph.h
src/foreign-ncol-parser.y
src/dmout.f
src/foreign-dl-parser.y
src/walktrap_heap.h
src/sparsemat.c
src/dseigt.f
src/dneigh.f
src/igraph_f2c.h
src/foreign-lgl-parser.c
src/fortran_intrinsics.c
src/bigint.h
src/version.c
src/igraph_hrg.cc
src/include
src/include/igraph_random.h
src/include/igraph_heap.h
src/include/igraph_array.h
src/include/igraph_lsap.h
src/include/igraph_vector_type.h
src/include/igraph_matrix.h
src/include/igraph_psumtree.h
src/include/igraph_embedding.h
src/include/igraph_structural.h
src/include/igraph_datatype.h
src/include/igraph_pmt.h
src/include/igraph_threading.h.in
src/include/igraph_transitivity.h
src/include/igraph_paths.h
src/include/igraph_bipartite.h
src/include/igraph_spmatrix.h
src/include/igraph_matrix_pmt.h
src/include/igraph_attributes.h
src/include/igraph_cocitation.h
src/include/igraph_version.h.in
src/include/igraph_arpack.h
src/include/igraph_scg.h
src/include/igraph_conversion.h
src/include/igraph_graphlets.h
src/include/igraph_eigen.h
src/include/igraph_vector_pmt.h
src/include/igraph_epidemics.h
src/include/igraph_scan.h
src/include/igraph_centrality.h
src/include/igraph_pmt_off.h
src/include/igraph_iterators.h
src/include/igraph_error.h
src/include/igraph_components.h
src/include/igraph_hrg.h
src/include/igraph_interface.h
src/include/igraph_motifs.h
src/include/igraph_flow.h
src/include/igraph_vector.h
src/include/igraph_mixing.h
src/include/igraph_games.h
src/include/igraph_complex.h
src/include/igraph.h
src/include/igraph_stack.h
src/include/igraph_nongraph.h
src/include/igraph_foreign.h
src/include/igraph_dqueue_pmt.h
src/include/igraph_qsort.h
src/include/igraph_stack_pmt.h
src/include/igraph_topology.h
src/include/igraph_visitor.h
src/include/igraph_neighborhood.h
src/include/igraph_strvector.h
src/include/igraph_community.h
src/include/igraph_matching.h
src/include/igraph_separators.h
src/include/igraph_microscopic_update.h
src/include/igraph_constructors.h
src/include/igraph_layout.h
src/include/igraph_lapack.h
src/include/igraph_array_pmt.h
src/include/igraph_blas.h
src/include/igraph_types.h
src/include/igraph_cliques.h
src/include/igraph_dqueue.h
src/include/igraph_memory.h
src/include/igraph_adjlist.h
src/include/igraph_vector_ptr.h
src/include/igraph_progress.h
src/include/igraph_interrupt.h
src/include/igraph_statusbar.h
src/include/igraph_sparsemat.h
src/include/igraph_operators.h
src/include/igraph_heap_pmt.h
src/include/igraph_cohesive_blocks.h
src/include/igraph_constants.h
src/dvout.f
src/igraph_types_internal.h
NAMESPACE
demo
demo/hrg.R
demo/centrality.R
demo/cohesive.R
demo/00Index
demo/community.R
demo/smallworld.R
demo/crashR.R
R
R/zzz-deprecate.R
R/scan.R
R/decomposition.R
R/auto.R
R/palette.R
R/games.R
R/utils.R
R/printr.R
R/attributes.R
R/operators.R
R/structural.properties.R
R/scg.R
R/minimum.spanning.tree.R
R/structure.info.R
R/lazyeval.R
R/epi.R
R/hrg.R
R/auto.R.in
R/versions.R
R/simple.R
R/plot.R
R/triangles.R
R/sir.R
R/indexing.R
R/topology.R
R/foreign.R
R/layout.R
R/cliques.R
R/par.R
R/assortativity.R
R/rewire.R
R/plot.shapes.R
R/weakref.R
R/sgm.R
R/igraph-package.R
R/embedding.R
R/cohesive.blocks.R
R/components.R
R/centrality.R
R/fit.R
R/make.R
R/basic.R
R/test.R
R/socnet.R
R/data_frame.R
R/print.R
R/conversion.R
R/paths.R
R/community.R
R/demo.R
R/sparsedf.R
R/layout_drl.R
R/mgclust.R
R/package.R
R/interface.R
R/console.R
R/uuid.R
R/plot.common.R
R/similarity.R
R/bipartite.R
R/motifs.R
R/other.R
R/pp.R
R/centralization.R
R/flow.R
R/iterators.R
R/cocitation.R
R/incidence.R
R/random_walk.R
R/glet.R
R/nexus.R
R/tkplot.R
R/adjacency.R
R/degseq.R
MD5
DESCRIPTION
configure
man
man/make_full_citation_graph.Rd
man/subgraph_centrality.Rd
man/hrg_tree.Rd
man/graph_.Rd
man/convex_hull.Rd
man/motifs.Rd
man/add_vertices.Rd
man/without_loops.Rd
man/sample_pref.Rd
man/is_weighted.Rd
man/layout_with_mds.Rd
man/add_edges.Rd
man/igraph_options.Rd
man/read_graph.Rd
man/min_cut.Rd
man/pipe.Rd
man/make_clusters.Rd
man/is_degseq.Rd
man/compose.Rd
man/incident.Rd
man/sample_k_regular.Rd
man/layout_with_gem.Rd
man/distances.Rd
man/rev.igraph.vs.Rd
man/canonical_permutation.Rd
man/layout_with_fr.Rd
man/incident_edges.Rd
man/cluster_leading_eigen.Rd
man/get.edge.ids.Rd
man/sample_hierarchical_sbm.Rd
man/graphlet_basis.Rd
man/path.Rd
man/vertex.shape.pie.Rd
man/sample_.Rd
man/disjoint_union.Rd
man/layout_on_sphere.Rd
man/sample_sphere_surface.Rd
man/layout_as_bipartite.Rd
man/sample_dirichlet.Rd
man/delete_graph_attr.Rd
man/make_chordal_ring.Rd
man/erdos.renyi.game.Rd
man/scg_group.Rd
man/layout_with_kk.Rd
man/bfs.Rd
man/intersection.igraph.Rd
man/laplacian_matrix.Rd
man/embed_laplacian_matrix.Rd
man/sample_grg.Rd
man/difference.igraph.Rd
man/centr_eigen_tmax.Rd
man/layout.fruchterman.reingold.grid.Rd
man/knn.Rd
man/add_layout_.Rd
man/automorphisms.Rd
man/sample_correlated_gnp.Rd
man/layout_nicely.Rd
man/edge_density.Rd
man/intersection.igraph.vs.Rd
man/cluster_infomap.Rd
man/diversity.Rd
man/unfold_tree.Rd
man/union.igraph.Rd
man/dominator_tree.Rd
man/norm_coords.Rd
man/fit_power_law.Rd
man/rep.igraph.Rd
man/as.igraph.Rd
man/layout.svd.Rd
man/shapes.Rd
man/igraph-vs-indexing.Rd
man/nexus.Rd
man/are_adjacent.Rd
man/edge_connectivity.Rd
man/identical_graphs.Rd
man/ivs.Rd
man/sample_hrg.Rd
man/set_vertex_attr.Rd
man/embed_adjacency_matrix.Rd
man/union.Rd
man/as.directed.Rd
man/hrg.Rd
man/as_adjacency_matrix.Rd
man/layout.deprecated.Rd
man/E.Rd
man/isomorphisms.Rd
man/dim_select.Rd
man/sequential_pal.Rd
man/layout.spring.Rd
man/dfs.Rd
man/graph_from_data_frame.Rd
man/sample_bipartite.Rd
man/make_star.Rd
man/similarity.Rd
man/subgraph.Rd
man/make_line_graph.Rd
man/is_dag.Rd
man/contract.Rd
man/which_multiple.Rd
man/layout_randomly.Rd
man/difference.igraph.es.Rd
man/count_subgraph_isomorphisms.Rd
man/topo_sort.Rd
man/with_graph_.Rd
man/communities.Rd
man/merge_coords.Rd
man/with_edge_.Rd
man/is_directed.Rd
man/layout_with_drl.Rd
man/make_de_bruijn_graph.Rd
man/union.igraph.es.Rd
man/authority_score.Rd
man/layout_in_circle.Rd
man/layout_with_lgl.Rd
man/sample_growing.Rd
man/getAICc.Rd
man/scg-method.Rd
man/cluster_label_prop.Rd
man/constraint.Rd
man/complementer.Rd
man/assortativity.Rd
man/sample_fitness_pl.Rd
man/sample_islands.Rd
man/transitivity.Rd
man/srand.Rd
man/arpack.Rd
man/sample_gnp.Rd
man/sample_fitness.Rd
man/radius.Rd
man/igraph_demo.Rd
man/set_graph_attr.Rd
man/predict_edges.Rd
man/plot.common.Rd
man/graph_from_graphdb.Rd
man/subgraph_isomorphic.Rd
man/igraph_test.Rd
man/is_separator.Rd
man/decompose.Rd
man/closeness.Rd
man/which_mutual.Rd
man/gclust.app.Rd
man/with_vertex_.Rd
man/centr_degree.Rd
man/component_wise.Rd
man/components.Rd
man/sir.Rd
man/as_ids.Rd
man/head_of.Rd
man/scg_eps.Rd
man/cocitation.Rd
man/vertex_connectivity.Rd
man/max_cardinality.Rd
man/set_edge_attr.Rd
man/centr_degree_tmax.Rd
man/as_long_data_frame.Rd
man/unique.igraph.es.Rd
man/layout_with_dh.Rd
man/without_multiples.Rd
man/cliques.Rd
man/is_named.Rd
man/plot.igraph.Rd
man/graph_from_incidence_matrix.Rd
man/igraph-es-indexing2.Rd
man/c.igraph.vs.Rd
man/graph_from_lcf.Rd
man/scan_stat.Rd
man/isomorphism_class.Rd
man/power_centrality.Rd
man/reciprocity.Rd
man/igraph_version.Rd
man/sample_forestfire.Rd
man/make_full_graph.Rd
man/scg_semi_proj.Rd
man/sample_degseq.Rd
man/cluster_louvain.Rd
man/max_flow.Rd
man/sub-sub-.igraph.Rd
man/graph_from_edgelist.Rd
man/biconnected_components.Rd
man/make_graph.Rd
man/make_bipartite_graph.Rd
man/hrg-methods.Rd
man/random_walk.Rd
man/igraph-es-attributes.Rd
man/edge.Rd
man/st_min_cuts.Rd
man/layout_.Rd
man/cohesive_blocks.Rd
man/layout_with_sugiyama.Rd
man/tail_of.Rd
man/centr_eigen.Rd
man/graph_from_literal.Rd
man/make_ring.Rd
man/sample_last_cit.Rd
man/igraph-vs-indexing2.Rd
man/coreness.Rd
man/as_edgelist.Rd
man/print.igraph.vs.Rd
man/permute.Rd
man/make_full_bipartite_graph.Rd
man/print.igraph.es.Rd
man/vertex_attr_names.Rd
man/count_isomorphisms.Rd
man/sample_correlated_gnp_pair.Rd
man/matching.Rd
man/union.igraph.vs.Rd
man/keeping_degseq.Rd
man/subcomponent.Rd
man/make_lattice.Rd
man/groups.Rd
man/dyad_census.Rd
man/graph_from_adjacency_matrix.Rd
man/articulation_points.Rd
man/igraph-vs-attributes.Rd
man/running_mean.Rd
man/print.igraphHRGConsensus.Rd
man/compare.Rd
man/centralize.Rd
man/as_membership.Rd
man/make_empty_graph.Rd
man/consensus_tree.Rd
man/upgrade_graph.Rd
man/aaa-igraph-package.Rd
man/sample_sphere_volume.Rd
man/graph_from_graphnel.Rd
man/sub-.igraph.Rd
man/graph_attr.Rd
man/page_rank.Rd
man/centr_clo.Rd
man/subgraph_isomorphisms.Rd
man/sample_pa.Rd
man/is_graphical.Rd
man/count_triangles.Rd
man/rewire.Rd
man/plot_dendrogram.igraphHRG.Rd
man/console.Rd
man/sample_motifs.Rd
man/layout_as_tree.Rd
man/sample_smallworld.Rd
man/is_min_separator.Rd
man/bipartite_projection.Rd
man/plot_dendrogram.communities.Rd
man/without_attr.Rd
man/make_.Rd
man/diameter.Rd
man/vertex_attr.Rd
man/betweenness.Rd
man/centr_betw_tmax.Rd
man/local_scan.Rd
man/igraph-attribute-combination.Rd
man/eigen_centrality.Rd
man/intersection.igraph.es.Rd
man/match_vertices.Rd
man/bipartite_mapping.Rd
man/vertex.Rd
man/is_igraph.Rd
man/fit_hrg.Rd
man/as_graphnel.Rd
man/layout_as_star.Rd
man/normalize.Rd
man/count_motifs.Rd
man/curve_multiple.Rd
man/graph_attr_names.Rd
man/delete_vertex_attr.Rd
man/simplify.Rd
man/centr_clo_tmax.Rd
man/triad_census.Rd
man/each_edge.Rd
man/as_incidence_matrix.Rd
man/centr_betw.Rd
man/layout_on_grid.Rd
man/all_simple_paths.Rd
man/difference.igraph.vs.Rd
man/graph_attr-set.Rd
man/split_join_distance.Rd
man/sample_dot_product.Rd
man/stochastic_matrix.Rd
man/print.igraphHRG.Rd
man/unique.igraph.vs.Rd
man/min_st_separators.Rd
man/layout_with_graphopt.Rd
man/mst.Rd
man/alpha_centrality.Rd
man/edge_attr_names.Rd
man/ends.Rd
man/intersection.Rd
man/igraph-es-indexing.Rd
man/gsize.Rd
man/eccentricity.Rd
man/diverging_pal.Rd
man/st_cuts.Rd
man/modularity.igraph.Rd
man/igraph-dollar.Rd
man/edge_attr.Rd
man/rev.igraph.es.Rd
man/scg.Rd
man/categorical_pal.Rd
man/spectrum.Rd
man/sample_sbm.Rd
man/delete_edges.Rd
man/vertex_attr-set.Rd
man/ego.Rd
man/as_adj_list.Rd
man/cluster_spinglass.Rd
man/delete_vertices.Rd
man/cluster_fast_greedy.Rd
man/neighbors.Rd
man/graph_from_atlas.Rd
man/graph_from_adj_list.Rd
man/tkplot.Rd
man/delete_edge_attr.Rd
man/rglplot.Rd
man/write_graph.Rd
man/c.igraph.es.Rd
man/sample_traits_callaway.Rd
man/difference.Rd
man/degree.Rd
man/is_chordal.Rd
man/igraph-minus.Rd
man/gorder.Rd
man/adjacent_vertices.Rd
man/sample_gnm.Rd
man/print.igraph.Rd
man/min_separators.Rd
man/make_kautz_graph.Rd
man/edge_attr-set.Rd
man/graph_from_isomorphism_class.Rd
man/gclust.rsvt.Rd
man/graph_version.Rd
man/cluster_walktrap.Rd
man/simplified.Rd
man/isomorphic.Rd
man/strength.Rd
man/plus-.igraph.Rd
man/V.Rd
man/cluster_edge_betweenness.Rd
man/girth.Rd
man/sample_seq.Rd
man/plot.sir.Rd
man/cluster_optimal.Rd
man/make_tree.Rd
man/hub_score.Rd
man/sample_pa_age.Rd
man/r_pal.Rd
man/tkigraph.Rd
configure.win
igraph documentation built on May 20, 2017, 12:49 a.m.