| add.edges |
igraph::add_edges |
| add.vertex.shape |
igraph::add_shape |
| add.vertices |
igraph::add_vertices |
| adjacent.triangles |
igraph::count_triangles |
| articulation.points |
igraph::articulation_points |
| aging.prefatt.game |
igraph::sample_pa_age |
| aging.ba.game |
igraph::sample_pa_age |
| aging.barabasi.game |
igraph::sample_pa_age |
| alpha.centrality |
igraph::alpha_centrality |
| are.connected |
igraph::are_adjacent |
| assortativity.degree |
igraph::assortativity_degree |
| assortativity.nominal |
igraph::assortativity_nominal |
| asymmetric.preference.game |
igraph::sample_asym_pref |
| authority.score |
igraph::authority_score |
| automorphisms |
igraph::count_automorphisms |
| autocurve.edges |
igraph::curve_multiple |
| average.path.length |
igraph::mean_distance |
| ba.game |
igraph::sample_pa |
| barabasi.game |
igraph::sample_pa |
| biconnected.components |
igraph::biconnected_components |
| bipartite.mapping |
igraph::bipartite_mapping |
| bipartite.projection |
igraph::bipartite_projection |
| bipartite.projection.size |
igraph::bipartite_projection_size |
| bipartite.random.game |
igraph::sample_bipartite |
| blockGraphs |
igraph::graphs_from_cohesive_blocks |
| bonpow |
igraph::power_centrality |
| callaway.traits.game |
igraph::sample_traits_callaway |
| canonical.permutation |
igraph::canonical_permutation |
| centralization.betweenness |
igraph::centr_betw |
| centralization.betweenness.tmax |
igraph::centr_betw_tmax |
| centralization.closeness |
igraph::centr_clo |
| centralization.closeness.tmax |
igraph::centr_clo_tmax |
| centralization.degree |
igraph::centr_degree |
| centralization.degree.tmax |
igraph::centr_degree_tmax |
| centralization.evcent |
igraph::centr_eigen |
| centralization.evcent.tmax |
igraph::centr_eigen_tmax |
| centralize.scores |
igraph::centralize |
| cited.type.game |
igraph::sample_cit_types |
| citing.cited.type.game |
igraph::sample_cit_cit_types |
| clique.number |
igraph::clique_num |
| cluster.distribution |
igraph::component_distribution |
| clusters |
igraph::components |
| code.length |
igraph::code_len |
| cohesive.blocks |
igraph::cohesive_blocks |
| connect.neighborhood |
igraph::connect |
| contract.vertices |
igraph::contract |
| convex.hull |
igraph::convex_hull |
| count.multiple |
igraph::count_multiple |
| cutat |
igraph::cut_at |
| decompose.graph |
igraph::decompose |
| degree.distribution |
igraph::degree_distribution |
| degree.sequence.game |
igraph::sample_degseq |
| delete.edges |
igraph::delete_edges |
| delete.vertices |
igraph::delete_vertices |
| dendPlot |
igraph::plot_dendrogram |
| dominator.tree |
igraph::dominator_tree |
| dyad.census |
igraph::dyad_census |
| edge.betweenness |
igraph::edge_betweenness |
| edge.betweenness.community |
igraph::cluster_edge_betweenness |
| edge.connectivity |
igraph::edge_connectivity |
| edge.disjoint.paths |
igraph::edge_connectivity |
| establishment.game |
igraph::sample_traits |
| evcent |
igraph::eigen_centrality |
| farthest.nodes |
igraph::farthest_vertices |
| fastgreedy.community |
igraph::cluster_fast_greedy |
| forest.fire.game |
igraph::sample_forestfire |
| get.adjedgelist |
igraph::as_adj_edge_list |
| get.adjlist |
igraph::as_adj_list |
| get.adjacency |
igraph::as_adjacency_matrix |
| get.data.frame |
igraph::as_data_frame |
| get.edge.attribute |
igraph::edge_attr |
| get.edgelist |
igraph::as_edgelist |
| get.graph.attribute |
igraph::graph_attr |
| get.incidence |
igraph::as_biadjacency_matrix |
| get.stochastic |
igraph::stochastic_matrix |
| get.vertex.attribute |
igraph::vertex_attr |
| graph.adhesion |
igraph::adhesion |
| graph.adjacency |
igraph::graph_from_adjacency_matrix |
| graph.adjlist |
igraph::graph_from_adj_list |
| graph.atlas |
igraph::graph_from_atlas |
| graph.automorphisms |
igraph::count_automorphisms |
| graph.bfs |
igraph::bfs |
| graph.bipartite |
igraph::make_bipartite_graph |
| graph.cohesion |
igraph::cohesion |
| graph.complementer |
igraph::complementer |
| graph.compose |
igraph::compose |
| graph.coreness |
igraph::coreness |
| graph.data.frame |
igraph::graph_from_data_frame |
| graph.de.bruijn |
igraph::make_de_bruijn_graph |
| graph.density |
igraph::edge_density |
| graph.disjoint.union |
igraph::disjoint_union |
| graph.dfs |
igraph::dfs |
| graph.difference |
igraph::difference |
| graph.diversity |
igraph::diversity |
| graph.edgelist |
igraph::graph_from_edgelist |
| graph.eigen |
igraph::spectrum |
| graph.empty |
igraph::make_empty_graph |
| graph.extended.chordal.ring |
igraph::make_chordal_ring |
| graph.formula |
igraph::graph_from_literal |
| graph.full |
igraph::make_full_graph |
| graph.full.bipartite |
igraph::make_full_bipartite_graph |
| graph.full.citation |
igraph::make_full_citation_graph |
| graph.graphdb |
igraph::graph_from_graphdb |
| graph.incidence |
igraph::graph_from_biadjacency_matrix |
| graph.isocreate |
igraph::graph_from_isomorphism_class |
| graph.kautz |
igraph::make_kautz_graph |
| graph.knn |
igraph::knn |
| graph.laplacian |
igraph::laplacian_matrix |
| graph.lattice |
igraph::make_lattice |
| graph.lcf |
igraph::graph_from_lcf |
| graph.maxflow |
igraph::max_flow |
| graph.mincut |
igraph::min_cut |
| graph.motifs |
igraph::motifs |
| graph.motifs.est |
igraph::sample_motifs |
| graph.motifs.no |
igraph::count_motifs |
| graph.neighborhood |
igraph::make_ego_graph |
| graph.star |
igraph::make_star |
| graph.strength |
igraph::strength |
| graph.tree |
igraph::make_tree |
| graph.union |
igraph::union.igraph |
| graph.ring |
igraph::make_ring |
| graphlets.candidate.basis |
igraph::graphlet_basis |
| graphlets.project |
igraph::graphlet_proj |
| growing.random.game |
igraph::sample_growing |
| grg.game |
igraph::sample_grg |
| has.multiple |
igraph::any_multiple |
| hrg.consensus |
igraph::consensus_tree |
| hrg.create |
igraph::hrg |
| hrg.dendrogram |
igraph::hrg_tree |
| hrg.game |
igraph::sample_hrg |
| hrg.fit |
igraph::fit_hrg |
| hrg.predict |
igraph::predict_edges |
| hub.score |
igraph::hub_score |
| igraph.console |
igraph::console |
| igraph.sample |
igraph::sample_seq |
| igraph.version |
igraph::igraph_version |
| igraphdemo |
igraph::igraph_demo |
| igraphtest |
igraph::igraph_test |
| independence.number |
igraph::ivs_size |
| independent.vertex.sets |
igraph::ivs |
| infomap.community |
igraph::cluster_infomap |
| induced.subgraph |
igraph::induced_subgraph |
| interconnected.islands.game |
igraph::sample_islands |
| is.bipartite |
igraph::is_bipartite |
| is.chordal |
igraph::is_chordal |
| is.connected |
igraph::is_connected |
| is.dag |
igraph::is_dag |
| is.degree.sequence |
igraph::is_degseq |
| is.directed |
igraph::is_directed |
| is.graphical.degree.sequence |
igraph::is_graphical |
| is.hierarchical |
igraph::is_hierarchical |
| is.igraph |
igraph::is_igraph |
| is.loop |
igraph::which_loop |
| is.matching |
igraph::is_matching |
| is.maximal.matching |
igraph::is_max_matching |
| is.minimal.separator |
igraph::is_min_separator |
| is.multiple |
igraph::which_multiple |
| is.mutual |
igraph::which_mutual |
| is.named |
igraph::is_named |
| is.separator |
igraph::is_separator |
| is.simple |
igraph::is_simple |
| is.weighted |
igraph::is_weighted |
| k.regular.game |
igraph::sample_k_regular |
| label.propagation.community |
igraph::cluster_label_prop |
| largest.cliques |
igraph::largest_cliques |
| largest.independent.vertex.sets |
igraph::largest_ivs |
| lastcit.game |
igraph::sample_last_cit |
| layout.auto |
igraph::layout_nicely |
| layout.bipartite |
igraph::layout_as_bipartite |
| layout.davidson.harel |
igraph::layout_with_dh |
| layout.drl |
igraph::layout_with_drl |
| layout.gem |
igraph::layout_with_gem |
| layout.graphopt |
igraph::layout_with_graphopt |
| layout.grid |
igraph::layout_on_grid |
| layout.mds |
igraph::layout_with_mds |
| layout.merge |
igraph::merge_coords |
| layout.norm |
igraph::norm_coords |
| layout.star |
igraph::layout_as_star |
| layout.sugiyama |
igraph::layout_with_sugiyama |
| leading.eigenvector.community |
igraph::cluster_leading_eigen |
| line.graph |
igraph::make_line_graph |
| list.edge.attributes |
igraph::edge_attr_names |
| list.graph.attributes |
igraph::graph_attr_names |
| list.vertex.attributes |
igraph::vertex_attr_names |
| maxcohesion |
igraph::max_cohesion |
| maximal.cliques |
igraph::max_cliques |
| maximal.cliques.count |
igraph::count_max_cliques |
| maximal.independent.vertex.sets |
igraph::maximal_ivs |
| minimal.st.separators |
igraph::min_st_separators |
| maximum.bipartite.matching |
igraph::max_bipartite_match |
| maximum.cardinality.search |
igraph::max_cardinality |
| minimum.size.separators |
igraph::min_separators |
| minimum.spanning.tree |
igraph::mst |
| mod.matrix |
igraph::modularity_matrix |
| multilevel.community |
igraph::cluster_louvain |
| neighborhood.size |
igraph::ego_size |
| no.clusters |
igraph::count_components |
| optimal.community |
igraph::cluster_optimal |
| page.rank |
igraph::page_rank |
| path.length.hist |
igraph::distance_table |
| permute.vertices |
igraph::permute |
| piecewise.layout |
igraph::layout_components |
| plotHierarchy |
igraph::plot_hierarchy |
| power.law.fit |
igraph::fit_power_law |
| preference.game |
igraph::sample_pref |
| read.graph |
igraph::read_graph |
| remove.edge.attribute |
igraph::delete_edge_attr |
| remove.graph.attribute |
igraph::delete_graph_attr |
| remove.vertex.attribute |
igraph::delete_vertex_attr |
| running.mean |
igraph::running_mean |
| sbm.game |
igraph::sample_sbm |
| set.edge.attribute |
igraph::set_edge_attr |
| set.graph.attribute |
igraph::set_graph_attr |
| set.vertex.attribute |
igraph::set_vertex_attr |
| shortest.paths |
igraph::distances |
| showtrace |
igraph::show_trace |
| spinglass.community |
igraph::cluster_spinglass |
| stCuts |
igraph::st_cuts |
| stMincuts |
igraph::st_min_cuts |
| static.fitness.game |
igraph::sample_fitness |
| static.power.law.game |
igraph::sample_fitness_pl |
| subgraph.centrality |
igraph::subgraph_centrality |
| tkplot.canvas |
igraph::tk_canvas |
| tkplot.center |
igraph::tk_center |
| tkplot.close |
igraph::tk_close |
| tkplot.export.postscript |
igraph::tk_postscript |
| tkplot.fit.to.screen |
igraph::tk_fit |
| tkplot.getcoords |
igraph::tk_coords |
| tkplot.off |
igraph::tk_off |
| tkplot.reshape |
igraph::tk_reshape |
| tkplot.rotate |
igraph::tk_rotate |
| tkplot.setcoords |
igraph::tk_set_coords |
| topological.sort |
igraph::topo_sort |
| triad.census |
igraph::triad_census |
| unfold.tree |
igraph::unfold_tree |
| vertex.connectivity |
igraph::vertex_connectivity |
| vertex.disjoint.paths |
igraph::vertex_disjoint_paths |
| walktrap.community |
igraph::cluster_walktrap |
| watts.strogatz.game |
igraph::sample_smallworld |
| write.graph |
igraph::write_graph |
| graph.famous |
igraph::make_graph |
| igraph.from.graphNEL |
igraph::graph_from_graphnel |
| igraph.to.graphNEL |
igraph::as_graphnel |
| getIgraphOpt |
igraph::igraph_opt |
| igraph.options |
igraph::igraph_options |
| graph.intersection |
igraph::intersection |
| exportPajek |
igraph::export_pajek |
| get.diameter |
igraph::get_diameter |
| get.all.shortest.paths |
igraph::all_shortest_paths |
| get.shortest.paths |
igraph::shortest_paths |
| graph |
igraph::make_graph |
| vertex.shapes |
igraph::shapes |
| igraph.shape.noclip |
igraph::shape_noclip |
| igraph.shape.noplot |
igraph::shape_noplot |
| create.communities |
igraph::make_clusters |
