Abdelrahman Said
2523 lines
232 KiB
HTML
2523 lines
232 KiB
HTML
<html>
|
||
<head>
|
||
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
||
<title>Index</title>
|
||
<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot">
|
||
<link rel="home" href="index.html" title="igraph Reference Manual">
|
||
<link rel="up" href="index.html" title="igraph Reference Manual">
|
||
<link rel="prev" href="igraph-Licenses.html" title="Chapter 36. Licenses for igraph and this manual">
|
||
<script type="text/javascript" src="toggle.js"></script><link rel="stylesheet" href="style.css" type="text/css">
|
||
<link rel="stylesheet" href="https://stackpath.bootstrapcdn.com/font-awesome/4.7.0/css/font-awesome.min.css" type="text/css">
|
||
<link rel="chapter" href="igraph-Introduction.html" title="Chapter 1. Introduction">
|
||
<link rel="chapter" href="igraph-Installation.html" title="Chapter 2. Installation">
|
||
<link rel="chapter" href="igraph-Tutorial.html" title="Chapter 3. Tutorial">
|
||
<link rel="chapter" href="igraph-Basic.html" title="Chapter 4. Basic data types and interface">
|
||
<link rel="chapter" href="igraph-Error.html" title="Chapter 5. Error handling">
|
||
<link rel="chapter" href="igraph-Memory.html" title="Chapter 6. Memory (de)allocation">
|
||
<link rel="chapter" href="igraph-Data-structures.html" title="Chapter 7. Data structure library: vector, matrix, other data types">
|
||
<link rel="chapter" href="igraph-Random.html" title="Chapter 8. Random numbers">
|
||
<link rel="chapter" href="igraph-Iterators.html" title="Chapter 9. Vertex and edge selectors and sequences, iterators">
|
||
<link rel="chapter" href="igraph-Attributes.html" title="Chapter 10. Graph, vertex and edge attributes">
|
||
<link rel="chapter" href="igraph-Generators.html" title="Chapter 11. Deterministic graph generators">
|
||
<link rel="chapter" href="igraph-Games.html" title='Chapter 12. Stochastic graph generators ("games")'>
|
||
<link rel="chapter" href="igraph-Bipartite.html" title="Chapter 13. Bipartite, i.e. two-mode graphs">
|
||
<link rel="chapter" href="igraph-Spatial.html" title="Chapter 14. Spatial graphs">
|
||
<link rel="chapter" href="igraph-Operators.html" title="Chapter 15. Graph operators">
|
||
<link rel="chapter" href="igraph-Visitors.html" title="Chapter 16. Graph visitors">
|
||
<link rel="chapter" href="igraph-Structural.html" title="Chapter 17. Structural properties of graphs">
|
||
<link rel="chapter" href="igraph-Cycles.html" title="Chapter 18. Graph cycles">
|
||
<link rel="chapter" href="igraph-Cliques.html" title="Chapter 19. Cliques and independent vertex sets">
|
||
<link rel="chapter" href="igraph-Motifs.html" title="Chapter 20. Graph motifs, dyad census and triad census">
|
||
<link rel="chapter" href="igraph-Isomorphism.html" title="Chapter 21. Graph isomorphism">
|
||
<link rel="chapter" href="igraph-Coloring.html" title="Chapter 22. Graph coloring">
|
||
<link rel="chapter" href="igraph-Flows.html" title="Chapter 23. Maximum flows, minimum cuts and related measures">
|
||
<link rel="chapter" href="igraph-Separators.html" title="Chapter 24. Vertex separators">
|
||
<link rel="chapter" href="igraph-Community.html" title="Chapter 25. Detecting community structure">
|
||
<link rel="chapter" href="igraph-Graphlets.html" title="Chapter 26. Graphlets">
|
||
<link rel="chapter" href="igraph-HRG.html" title="Chapter 27. Hierarchical random graphs">
|
||
<link rel="chapter" href="igraph-Embedding.html" title="Chapter 28. Embedding of graphs">
|
||
<link rel="chapter" href="igraph-Layout.html" title="Chapter 29. Generating layouts for graph drawing">
|
||
<link rel="chapter" href="igraph-Processes.html" title="Chapter 30. Processes on graphs">
|
||
<link rel="chapter" href="igraph-Foreign.html" title="Chapter 31. Reading and writing graphs from and to files">
|
||
<link rel="chapter" href="igraph-Linalg.html" title="Chapter 32. Using BLAS, LAPACK and ARPACK for igraph matrices and graphs">
|
||
<link rel="chapter" href="igraph-Nongraph.html" title="Chapter 33. Non-graph related functions">
|
||
<link rel="chapter" href="igraph-Advanced.html" title="Chapter 34. Advanced igraph programming">
|
||
<link rel="chapter" href="igraph-Glossary.html" title="Chapter 35. Glossary">
|
||
<link rel="chapter" href="igraph-Licenses.html" title="Chapter 36. Licenses for igraph and this manual">
|
||
<link rel="index" href="ix01.html" title="Index">
|
||
</head>
|
||
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
|
||
<div class="navigation-header mb-4" width="100%" summary="Navigation header"><div class="btn-group">
|
||
<a accesskey="p" class="btn btn-light" href="igraph-Licenses.html"><i class="fa fa-chevron-left"></i>
|
||
Previous
|
||
</a><a accesskey="h" class="btn btn-light" href="index.html"><i class="fa fa-home"></i>
|
||
Home
|
||
</a>
|
||
</div></div>
|
||
<div class="index">
|
||
<div class="titlepage"><div><div><h1 class="title">
|
||
<a name="id-1.38"></a>Index</h1></div></div></div>
|
||
<div xmlns:xlink="http://www.w3.org/1999/xlink" class="index">
|
||
<div class="indexdiv">
|
||
<h3>A</h3>
|
||
<dl>
|
||
<dt id="ientry-id3682">add_edge, <a class="indexterm" href="igraph-Basic.html#igraph_add_edge">igraph_add_edge — Adds a single edge to a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id3743">add_edges, <a class="indexterm" href="igraph-Basic.html#igraph_add_edges">igraph_add_edges — Adds edges to a graph object.</a>
|
||
</dt>
|
||
<dt id="ientry-id3824">add_vertices, <a class="indexterm" href="igraph-Basic.html#igraph_add_vertices">igraph_add_vertices — Adds vertices to a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id62748">adhesion, <a class="indexterm" href="igraph-Flows.html#igraph_adhesion">igraph_adhesion — Graph adhesion, this is (almost) the same as edge connectivity.</a>
|
||
</dt>
|
||
<dt id="ientry-id30116">adjacency, <a class="indexterm" href="igraph-Generators.html#igraph_adjacency">igraph_adjacency — Creates a graph from an adjacency matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id66832">adjacency_spectral_embedding, <a class="indexterm" href="igraph-Embedding.html#igraph_adjacency_spectral_embedding">igraph_adjacency_spectral_embedding — Adjacency spectral embedding</a>
|
||
</dt>
|
||
<dt id="ientry-id30407">adjlist, <a class="indexterm" href="igraph-Generators.html#igraph_adjlist">igraph_adjlist — Creates a graph from an adjacency list.</a>
|
||
</dt>
|
||
<dt id="ientry-id20175">adjlist_clear, <a class="indexterm" href="igraph-Data-structures.html#igraph_adjlist_clear">igraph_adjlist_clear — Removes all edges from an adjacency list.</a>
|
||
</dt>
|
||
<dt id="ientry-id20090">adjlist_destroy, <a class="indexterm" href="igraph-Data-structures.html#igraph_adjlist_destroy">igraph_adjlist_destroy — Deallocates an adjacency list.</a>
|
||
</dt>
|
||
<dt id="ientry-id20109">adjlist_get, <a class="indexterm" href="igraph-Data-structures.html#igraph_adjlist_get">igraph_adjlist_get — Query a vector in an adjacency list.</a>
|
||
</dt>
|
||
<dt id="ientry-id19848">adjlist_init, <a class="indexterm" href="igraph-Data-structures.html#igraph_adjlist_init">igraph_adjlist_init — Constructs an adjacency list of vertices from a given graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id19970">adjlist_init_complementer, <a class="indexterm" href="igraph-Data-structures.html#igraph_adjlist_init_complementer">igraph_adjlist_init_complementer — Adjacency lists for the complementer graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id19934">adjlist_init_empty, <a class="indexterm" href="igraph-Data-structures.html#igraph_adjlist_init_empty">igraph_adjlist_init_empty — Initializes an empty adjacency list.</a>
|
||
</dt>
|
||
<dt id="ientry-id20045">adjlist_init_from_inclist, <a class="indexterm" href="igraph-Data-structures.html#igraph_adjlist_init_from_inclist">igraph_adjlist_init_from_inclist — Constructs an adjacency list of vertices from an incidence list.</a>
|
||
</dt>
|
||
<dt id="ientry-id20215">adjlist_simplify, <a class="indexterm" href="igraph-Data-structures.html#igraph_adjlist_simplify">igraph_adjlist_simplify — Simplifies an adjacency list.</a>
|
||
</dt>
|
||
<dt id="ientry-id20146">adjlist_size, <a class="indexterm" href="igraph-Data-structures.html#igraph_adjlist_size">igraph_adjlist_size — Returns the number of vertices in an adjacency list.</a>
|
||
</dt>
|
||
<dt id="ientry-id20194">adjlist_sort, <a class="indexterm" href="igraph-Data-structures.html#igraph_adjlist_sort">igraph_adjlist_sort — Sorts each vector in an adjacency list.</a>
|
||
</dt>
|
||
<dt id="ientry-id63205">all_minimal_st_separators, <a class="indexterm" href="igraph-Separators.html#igraph_all_minimal_st_separators">igraph_all_minimal_st_separators — List all vertex sets that are minimal (s,t) separators for some s and t.</a>
|
||
</dt>
|
||
<dt id="ientry-id61921">all_st_cuts, <a class="indexterm" href="igraph-Flows.html#igraph_all_st_cuts">igraph_all_st_cuts — List all edge-cuts between two vertices in a directed graph</a>
|
||
</dt>
|
||
<dt id="ientry-id61970">all_st_mincuts, <a class="indexterm" href="igraph-Flows.html#igraph_all_st_mincuts">igraph_all_st_mincuts — All minimum s-t cuts of a directed graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id73963">almost_equals, <a class="indexterm" href="igraph-Nongraph.html#igraph_almost_equals">igraph_almost_equals — Compare two double-precision floats with a tolerance.</a>
|
||
</dt>
|
||
<dt id="ientry-id40871">are_adjacent, <a class="indexterm" href="igraph-Structural.html#igraph_are_adjacent">igraph_are_adjacent — Decides whether two vertices are adjacent.</a>
|
||
</dt>
|
||
<dt id="ientry-id72962">arpack_function_t, <a class="indexterm" href="igraph-Linalg.html#igraph_arpack_function_t">igraph_arpack_function_t — Type of the ARPACK callback function.</a>
|
||
</dt>
|
||
<dt id="ientry-id73012">arpack_options_init, <a class="indexterm" href="igraph-Linalg.html#igraph_arpack_options_init">igraph_arpack_options_init — Initialize ARPACK options.</a>
|
||
</dt>
|
||
<dt id="ientry-id72616">arpack_options_t, <a class="indexterm" href="igraph-Linalg.html#igraph_arpack_options_t">igraph_arpack_options_t — Options for ARPACK.</a>
|
||
</dt>
|
||
<dt id="ientry-id73189">arpack_rnsolve, <a class="indexterm" href="igraph-Linalg.html#igraph_arpack_rnsolve">igraph_arpack_rnsolve — ARPACK solver for non-symmetric matrices.</a>
|
||
</dt>
|
||
<dt id="ientry-id73122">arpack_rssolve, <a class="indexterm" href="igraph-Linalg.html#igraph_arpack_rssolve">igraph_arpack_rssolve — ARPACK solver for symmetric matrices.</a>
|
||
</dt>
|
||
<dt id="ientry-id73099">arpack_storage_destroy, <a class="indexterm" href="igraph-Linalg.html#igraph_arpack_storage_destroy">igraph_arpack_storage_destroy — Deallocate ARPACK storage.</a>
|
||
</dt>
|
||
<dt id="ientry-id73038">arpack_storage_init, <a class="indexterm" href="igraph-Linalg.html#igraph_arpack_storage_init">igraph_arpack_storage_init — Initialize ARPACK storage.</a>
|
||
</dt>
|
||
<dt id="ientry-id72887">arpack_storage_t, <a class="indexterm" href="igraph-Linalg.html#igraph_arpack_storage_t">igraph_arpack_storage_t — Storage for ARPACK.</a>
|
||
</dt>
|
||
<dt id="ientry-id73259">arpack_unpack_complex, <a class="indexterm" href="igraph-Linalg.html#igraph_arpack_unpack_complex">igraph_arpack_unpack_complex — Makes the result of the non-symmetric ARPACK solver more readable.</a>
|
||
</dt>
|
||
<dt id="ientry-id46345">articulation_points, <a class="indexterm" href="igraph-Structural.html#igraph_articulation_points">igraph_articulation_points — Finds the articulation points in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id5361">ASSERT, <a class="indexterm" href="igraph-Error.html#IGRAPH_ASSERT">IGRAPH_ASSERT — igraph-specific replacement for assert().</a>
|
||
</dt>
|
||
<dt id="ientry-id52933">assortativity, <a class="indexterm" href="igraph-Structural.html#igraph_assortativity">igraph_assortativity — Assortativity based on numeric properties of vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id53038">assortativity_degree, <a class="indexterm" href="igraph-Structural.html#igraph_assortativity_degree">igraph_assortativity_degree — Assortativity of a graph based on vertex degree.</a>
|
||
</dt>
|
||
<dt id="ientry-id52794">assortativity_nominal, <a class="indexterm" href="igraph-Structural.html#igraph_assortativity_nominal">igraph_assortativity_nominal — Assortativity of a graph based on vertex categories.</a>
|
||
</dt>
|
||
<dt id="ientry-id42804">astar_heuristic_func_t, <a class="indexterm" href="igraph-Structural.html#igraph_astar_heuristic_func_t">igraph_astar_heuristic_func_t — Distance estimator for A* algorithm.</a>
|
||
</dt>
|
||
<dt id="ientry-id33849">asymmetric_preference_game, <a class="indexterm" href="igraph-Games.html#igraph_asymmetric_preference_game">igraph_asymmetric_preference_game — Generates a graph with asymmetric vertex types and connection preferences.</a>
|
||
</dt>
|
||
<dt id="ientry-id32817">atlas, <a class="indexterm" href="igraph-Generators.html#igraph_atlas">igraph_atlas — Create a small graph from the “Graph Atlas”.</a>
|
||
</dt>
|
||
<dt id="ientry-id26323">attribute_combination, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_combination">igraph_attribute_combination — Initialize attribute combination list and add records.</a>
|
||
</dt>
|
||
<dt id="ientry-id26143">attribute_combination_add, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_combination_add">igraph_attribute_combination_add — Add combination record to attribute combination list.</a>
|
||
</dt>
|
||
<dt id="ientry-id26226">attribute_combination_destroy, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_combination_destroy">igraph_attribute_combination_destroy — Destroy attribute combination list.</a>
|
||
</dt>
|
||
<dt id="ientry-id26114">attribute_combination_init, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_combination_init">igraph_attribute_combination_init — Initialize attribute combination list.</a>
|
||
</dt>
|
||
<dt id="ientry-id26192">attribute_combination_remove, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_combination_remove">igraph_attribute_combination_remove — Remove a record from an attribute combination list.</a>
|
||
</dt>
|
||
<dt id="ientry-id26245">attribute_combination_type_t, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_combination_type_t">igraph_attribute_combination_type_t — The possible types of attribute combinations.</a>
|
||
</dt>
|
||
<dt id="ientry-id25711">attribute_elemtype_t, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_elemtype_t">igraph_attribute_elemtype_t — Types of objects to which attributes can be attached.</a>
|
||
</dt>
|
||
<dt id="ientry-id26088">attribute_record_destroy, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_record_destroy">igraph_attribute_record_destroy — Destroys an attribute record.</a>
|
||
</dt>
|
||
<dt id="ientry-id25762">attribute_record_init, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_record_init">igraph_attribute_record_init — Initializes an attribute record with a given name and type.</a>
|
||
</dt>
|
||
<dt id="ientry-id25802">attribute_record_init_copy, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_record_init_copy">igraph_attribute_record_init_copy — Initializes an attribute record by copying another record.</a>
|
||
</dt>
|
||
<dt id="ientry-id25867">attribute_record_resize, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_record_resize">igraph_attribute_record_resize — Resizes the value vector in an attribute record.</a>
|
||
</dt>
|
||
<dt id="ientry-id26051">attribute_record_set_default_boolean, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_record_set_default_boolean">igraph_attribute_record_set_default_boolean — Sets the default value of the attribute to the given logical value.</a>
|
||
</dt>
|
||
<dt id="ientry-id25977">attribute_record_set_default_numeric, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_record_set_default_numeric">igraph_attribute_record_set_default_numeric — Sets the default value of the attribute to the given number.</a>
|
||
</dt>
|
||
<dt id="ientry-id26013">attribute_record_set_default_string, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_record_set_default_string">igraph_attribute_record_set_default_string — Sets the default value of the attribute to the given string.</a>
|
||
</dt>
|
||
<dt id="ientry-id25906">attribute_record_set_name, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_record_set_name">igraph_attribute_record_set_name — Sets the attribute name in an attribute record.</a>
|
||
</dt>
|
||
<dt id="ientry-id25941">attribute_record_set_type, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_record_set_type">igraph_attribute_record_set_type — Sets the type of an attribute record.</a>
|
||
</dt>
|
||
<dt id="ientry-id25838">attribute_record_size, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_record_size">igraph_attribute_record_size — Returns the size of the value vector in an attribute record.</a>
|
||
</dt>
|
||
<dt id="ientry-id25744">attribute_record_t, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_record_t">igraph_attribute_record_t — An attribute record holding the name, type and values of an attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id25477">attribute_table_t, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_table_t">igraph_attribute_table_t — Table of functions to perform operations on attributes.</a>
|
||
</dt>
|
||
<dt id="ientry-id25671">attribute_type_t, <a class="indexterm" href="igraph-Attributes.html#igraph_attribute_type_t">igraph_attribute_type_t — The possible types of the attributes.</a>
|
||
</dt>
|
||
<dt id="ientry-id59000">automorphism_group, <a class="indexterm" href="igraph-Isomorphism.html#igraph_automorphism_group">igraph_automorphism_group — Automorphism group generators of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id59351">automorphism_group_bliss, <a class="indexterm" href="igraph-Isomorphism.html#igraph_automorphism_group_bliss">igraph_automorphism_group_bliss — Automorphism group generators using Bliss.</a>
|
||
</dt>
|
||
<dt id="ientry-id44840">average_local_efficiency, <a class="indexterm" href="igraph-Structural.html#igraph_average_local_efficiency">igraph_average_local_efficiency — Calculates the average local efficiency in a network.</a>
|
||
</dt>
|
||
<dt id="ientry-id43391">average_path_length, <a class="indexterm" href="igraph-Structural.html#igraph_average_path_length">igraph_average_path_length — The average shortest path length between all vertex pairs.</a>
|
||
</dt>
|
||
<dt id="ientry-id53134">avg_nearest_neighbor_degree, <a class="indexterm" href="igraph-Structural.html#igraph_avg_nearest_neighbor_degree">igraph_avg_nearest_neighbor_degree — Average neighbor degree.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>B</h3>
|
||
<dl>
|
||
<dt id="ientry-id34398">barabasi_aging_game, <a class="indexterm" href="igraph-Games.html#igraph_barabasi_aging_game">igraph_barabasi_aging_game — Preferential attachment with aging of vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id34077">barabasi_game, <a class="indexterm" href="igraph-Games.html#igraph_barabasi_game">igraph_barabasi_game — Generates a graph based on the Barabási-Albert model.</a>
|
||
</dt>
|
||
<dt id="ientry-id37726">beta_weighted_gabriel_graph, <a class="indexterm" href="igraph-Spatial.html#igraph_beta_weighted_gabriel_graph">igraph_beta_weighted_gabriel_graph — A Gabriel graph, with edges weighted by the β value at which it disappears.</a>
|
||
</dt>
|
||
<dt id="ientry-id47136">betweenness, <a class="indexterm" href="igraph-Structural.html#igraph_betweenness">igraph_betweenness — Betweenness centrality of some vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id48405">betweenness_cutoff, <a class="indexterm" href="igraph-Structural.html#igraph_betweenness_cutoff">igraph_betweenness_cutoff — Range-limited betweenness centrality.</a>
|
||
</dt>
|
||
<dt id="ientry-id48561">betweenness_subset, <a class="indexterm" href="igraph-Structural.html#igraph_betweenness_subset">igraph_betweenness_subset — Betweenness centrality for a subset of source and target vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id40251">bfs, <a class="indexterm" href="igraph-Visitors.html#igraph_bfs">igraph_bfs — Breadth-first search.</a>
|
||
</dt>
|
||
<dt id="ientry-id40554">bfshandler_t, <a class="indexterm" href="igraph-Visitors.html#igraph_bfshandler_t">igraph_bfshandler_t — Callback type for BFS function.</a>
|
||
</dt>
|
||
<dt id="ientry-id40463">bfs_simple, <a class="indexterm" href="igraph-Visitors.html#igraph_bfs_simple">igraph_bfs_simple — Breadth-first search, single-source version</a>
|
||
</dt>
|
||
<dt id="ientry-id36982">biadjacency, <a class="indexterm" href="igraph-Bipartite.html#igraph_biadjacency">igraph_biadjacency — Creates a bipartite graph from a bipartite adjacency matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id49490">bibcoupling, <a class="indexterm" href="igraph-Structural.html#igraph_bibcoupling">igraph_bibcoupling — Bibliographic coupling.</a>
|
||
</dt>
|
||
<dt id="ientry-id46212">biconnected_components, <a class="indexterm" href="igraph-Structural.html#igraph_biconnected_components">igraph_biconnected_components — Calculates biconnected components.</a>
|
||
</dt>
|
||
<dt id="ientry-id36651">bipartite_game_gnm, <a class="indexterm" href="igraph-Bipartite.html#igraph_bipartite_game_gnm">igraph_bipartite_game_gnm — Generate a random bipartite graph with a fixed number of edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id36765">bipartite_game_gnp, <a class="indexterm" href="igraph-Bipartite.html#igraph_bipartite_game_gnp">igraph_bipartite_game_gnp — Generates a random bipartite graph with a fixed connection probability.</a>
|
||
</dt>
|
||
<dt id="ientry-id36882">bipartite_iea_game, <a class="indexterm" href="igraph-Bipartite.html#igraph_bipartite_iea_game">igraph_bipartite_iea_game — Generates a random bipartite multigraph through independent edge assignment.</a>
|
||
</dt>
|
||
<dt id="ientry-id37268">bipartite_projection, <a class="indexterm" href="igraph-Bipartite.html#igraph_bipartite_projection">igraph_bipartite_projection — Create one or both projections of a bipartite (two-mode) network.</a>
|
||
</dt>
|
||
<dt id="ientry-id37194">bipartite_projection_size, <a class="indexterm" href="igraph-Bipartite.html#igraph_bipartite_projection_size">igraph_bipartite_projection_size — Calculate the number of vertices and edges in the bipartite projections.</a>
|
||
</dt>
|
||
<dt id="ientry-id21538">bitset_and, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_and">igraph_bitset_and — Bitwise AND of two bitsets.</a>
|
||
</dt>
|
||
<dt id="ientry-id21917">bitset_capacity, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_capacity">igraph_bitset_capacity — Returns the allocated capacity of the bitset.</a>
|
||
</dt>
|
||
<dt id="ientry-id21683">bitset_countl_one, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_countl_one">igraph_bitset_countl_one — The number of leading ones in the bitset.</a>
|
||
</dt>
|
||
<dt id="ientry-id21654">bitset_countl_zero, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_countl_zero">igraph_bitset_countl_zero — The number of leading zeros in the bitset.</a>
|
||
</dt>
|
||
<dt id="ientry-id21741">bitset_countr_one, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_countr_one">igraph_bitset_countr_one — The number of trailing ones in the bitset.</a>
|
||
</dt>
|
||
<dt id="ientry-id21712">bitset_countr_zero, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_countr_zero">igraph_bitset_countr_zero — The number of trailing zeros in the bitset.</a>
|
||
</dt>
|
||
<dt id="ientry-id21238">bitset_destroy, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_destroy">igraph_bitset_destroy — Destroys a bitset object.</a>
|
||
</dt>
|
||
<dt id="ientry-id21440">bitset_fill, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_fill">igraph_bitset_fill — Fills a bitset with a constant value.</a>
|
||
</dt>
|
||
<dt id="ientry-id21163">bitset_init, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_init">igraph_bitset_init — Initializes a bitset object (constructor).</a>
|
||
</dt>
|
||
<dt id="ientry-id21203">bitset_init_copy, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_init_copy">igraph_bitset_init_copy — Initializes a bitset from another bitset object (constructor).</a>
|
||
</dt>
|
||
<dt id="ientry-id21799">bitset_is_all_one, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_is_all_one">igraph_bitset_is_all_one — Are all bits ones?</a>
|
||
</dt>
|
||
<dt id="ientry-id21770">bitset_is_all_zero, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_is_all_zero">igraph_bitset_is_all_zero — Are all bits zeros?</a>
|
||
</dt>
|
||
<dt id="ientry-id21857">bitset_is_any_one, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_is_any_one">igraph_bitset_is_any_one — Are any bits ones?</a>
|
||
</dt>
|
||
<dt id="ientry-id21828">bitset_is_any_zero, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_is_any_zero">igraph_bitset_is_any_zero — Are any bits zeros?</a>
|
||
</dt>
|
||
<dt id="ientry-id21600">bitset_not, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_not">igraph_bitset_not — Bitwise negation of a bitset.</a>
|
||
</dt>
|
||
<dt id="ientry-id21476">bitset_null, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_null">igraph_bitset_null — Clears all bits in a bitset.</a>
|
||
</dt>
|
||
<dt id="ientry-id21507">bitset_or, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_or">igraph_bitset_or — Bitwise OR of two bitsets.</a>
|
||
</dt>
|
||
<dt id="ientry-id21625">bitset_popcount, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_popcount">igraph_bitset_popcount — The population count of the bitset.</a>
|
||
</dt>
|
||
<dt id="ientry-id21962">bitset_reserve, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_reserve">igraph_bitset_reserve — Reserves memory for a bitset.</a>
|
||
</dt>
|
||
<dt id="ientry-id22001">bitset_resize, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_resize">igraph_bitset_resize — Resizes the bitset.</a>
|
||
</dt>
|
||
<dt id="ientry-id21888">bitset_size, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_size">igraph_bitset_size — Returns the length of the bitset.</a>
|
||
</dt>
|
||
<dt id="ientry-id22051">bitset_update, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_update">igraph_bitset_update — Update a bitset from another one.</a>
|
||
</dt>
|
||
<dt id="ientry-id21569">bitset_xor, <a class="indexterm" href="igraph-Data-structures.html#igraph_bitset_xor">igraph_bitset_xor — Bitwise XOR of two bitsets.</a>
|
||
</dt>
|
||
<dt id="ientry-id21357">BIT_CLEAR, <a class="indexterm" href="igraph-Data-structures.html#IGRAPH_BIT_CLEAR">IGRAPH_BIT_CLEAR — Sets a specific bit in a bitset to 0 without altering other bits.</a>
|
||
</dt>
|
||
<dt id="ientry-id21279">BIT_MASK, <a class="indexterm" href="igraph-Data-structures.html#IGRAPH_BIT_MASK">IGRAPH_BIT_MASK — Computes mask used to access a specific bit of an integer.</a>
|
||
</dt>
|
||
<dt id="ientry-id21413">BIT_NSLOTS, <a class="indexterm" href="igraph-Data-structures.html#IGRAPH_BIT_NSLOTS">IGRAPH_BIT_NSLOTS — Computes the number of slots required to store a specified number of bits.</a>
|
||
</dt>
|
||
<dt id="ientry-id21329">BIT_SET, <a class="indexterm" href="igraph-Data-structures.html#IGRAPH_BIT_SET">IGRAPH_BIT_SET — Sets a specific bit in a bitset to 1 without altering other bits.</a>
|
||
</dt>
|
||
<dt id="ientry-id21304">BIT_SLOT, <a class="indexterm" href="igraph-Data-structures.html#IGRAPH_BIT_SLOT">IGRAPH_BIT_SLOT — Computes index used to access a specific slot of a bitset.</a>
|
||
</dt>
|
||
<dt id="ientry-id21385">BIT_TEST, <a class="indexterm" href="igraph-Data-structures.html#IGRAPH_BIT_TEST">IGRAPH_BIT_TEST — Tests whether a bit is set in a bitset.</a>
|
||
</dt>
|
||
<dt id="ientry-id71243">blas_ddot, <a class="indexterm" href="igraph-Linalg.html#igraph_blas_ddot">igraph_blas_ddot — Dot product of two vectors.</a>
|
||
</dt>
|
||
<dt id="ientry-id71517">blas_dgemm, <a class="indexterm" href="igraph-Linalg.html#igraph_blas_dgemm">igraph_blas_dgemm — Matrix-matrix multiplication using BLAS.</a>
|
||
</dt>
|
||
<dt id="ientry-id71374">blas_dgemv, <a class="indexterm" href="igraph-Linalg.html#igraph_blas_dgemv">igraph_blas_dgemv — Matrix-vector multiplication using BLAS, vector version.</a>
|
||
</dt>
|
||
<dt id="ientry-id71630">blas_dgemv_array, <a class="indexterm" href="igraph-Linalg.html#igraph_blas_dgemv_array">igraph_blas_dgemv_array — Matrix-vector multiplication using BLAS, array version.</a>
|
||
</dt>
|
||
<dt id="ientry-id71344">blas_dnrm2, <a class="indexterm" href="igraph-Linalg.html#igraph_blas_dnrm2">igraph_blas_dnrm2 — Euclidean norm of a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id59154">bliss_info_t, <a class="indexterm" href="igraph-Isomorphism.html#igraph_bliss_info_t">igraph_bliss_info_t — Information about a Bliss run.</a>
|
||
</dt>
|
||
<dt id="ientry-id59109">bliss_sh_t, <a class="indexterm" href="igraph-Isomorphism.html#igraph_bliss_sh_t">igraph_bliss_sh_t — Splitting heuristics for Bliss.</a>
|
||
</dt>
|
||
<dt id="ientry-id46590">bond_percolation, <a class="indexterm" href="igraph-Structural.html#igraph_bond_percolation">igraph_bond_percolation — The size of the largest component as edges are added to a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id46400">bridges, <a class="indexterm" href="igraph-Structural.html#igraph_bridges">igraph_bridges — Finds all bridges in a graph.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>C</h3>
|
||
<dl>
|
||
<dt id="ientry-id34802">callaway_traits_game, <a class="indexterm" href="igraph-Games.html#igraph_callaway_traits_game">igraph_callaway_traits_game — Simulates a growing network with vertex types.</a>
|
||
</dt>
|
||
<dt id="ientry-id5531">calloc, <a class="indexterm" href="igraph-Memory.html#igraph_calloc">igraph_calloc — Allocates memory that can be safely deallocated by igraph functions.</a>
|
||
</dt>
|
||
<dt id="ientry-id59042">canonical_permutation, <a class="indexterm" href="igraph-Isomorphism.html#igraph_canonical_permutation">igraph_canonical_permutation — Canonical permutation of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id59405">canonical_permutation_bliss, <a class="indexterm" href="igraph-Isomorphism.html#igraph_canonical_permutation_bliss">igraph_canonical_permutation_bliss — Canonical permutation using Bliss.</a>
|
||
</dt>
|
||
<dt id="ientry-id27849">cattribute_EAB, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_EAB">igraph_cattribute_EAB — Query a boolean edge attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id27942">cattribute_EABV, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_EABV">igraph_cattribute_EABV — Query a boolean edge attribute for many edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id28852">cattribute_EAB_set, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_EAB_set">igraph_cattribute_EAB_set — Set a boolean edge attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id29412">cattribute_EAB_setv, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_EAB_setv">igraph_cattribute_EAB_setv — Set a boolean edge attribute for all edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id27672">cattribute_EAN, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_EAN">igraph_cattribute_EAN — Query a numeric edge attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id27765">cattribute_EANV, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_EANV">igraph_cattribute_EANV — Query a numeric edge attribute for many edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id28749">cattribute_EAN_set, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_EAN_set">igraph_cattribute_EAN_set — Set a numeric edge attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id29331">cattribute_EAN_setv, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_EAN_setv">igraph_cattribute_EAN_setv — Set a numeric edge attribute for all edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id28026">cattribute_EAS, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_EAS">igraph_cattribute_EAS — Query a string edge attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id28111">cattribute_EASV, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_EASV">igraph_cattribute_EASV — Query a string edge attribute for many edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id28955">cattribute_EAS_set, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_EAS_set">igraph_cattribute_EAS_set — Set a string edge attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id29493">cattribute_EAS_setv, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_EAS_setv">igraph_cattribute_EAS_setv — Set a string edge attribute for all edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id26975">cattribute_GAB, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_GAB">igraph_cattribute_GAB — Query a boolean graph attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id28278">cattribute_GAB_set, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_GAB_set">igraph_cattribute_GAB_set — Set a boolean graph attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id26894">cattribute_GAN, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_GAN">igraph_cattribute_GAN — Query a numeric graph attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id28197">cattribute_GAN_set, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_GAN_set">igraph_cattribute_GAN_set — Set a numeric graph attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id27056">cattribute_GAS, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_GAS">igraph_cattribute_GAS — Query a string graph attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id28359">cattribute_GAS_set, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_GAS_set">igraph_cattribute_GAS_set — Set a string graph attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id26850">cattribute_has_attr, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_has_attr">igraph_cattribute_has_attr — Checks whether a (graph, vertex or edge) attribute exists.</a>
|
||
</dt>
|
||
<dt id="ientry-id26789">cattribute_list, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_list">igraph_cattribute_list — List all attributes.</a>
|
||
</dt>
|
||
<dt id="ientry-id29759">cattribute_remove_all, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_remove_all">igraph_cattribute_remove_all — Remove all graph/vertex/edge attributes.</a>
|
||
</dt>
|
||
<dt id="ientry-id29698">cattribute_remove_e, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_remove_e">igraph_cattribute_remove_e — Remove an edge attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id29576">cattribute_remove_g, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_remove_g">igraph_cattribute_remove_g — Remove a graph attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id29637">cattribute_remove_v, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_remove_v">igraph_cattribute_remove_v — Remove a vertex attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id27316">cattribute_VAB, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_VAB">igraph_cattribute_VAB — Query a boolean vertex attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id27409">cattribute_VABV, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_VABV">igraph_cattribute_VABV — Query a boolean vertex attribute for many vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id28543">cattribute_VAB_set, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_VAB_set">igraph_cattribute_VAB_set — Set a boolean vertex attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id29149">cattribute_VAB_setv, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_VAB_setv">igraph_cattribute_VAB_setv — Set a boolean vertex attribute for all vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id27139">cattribute_VAN, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_VAN">igraph_cattribute_VAN — Query a numeric vertex attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id27232">cattribute_VANV, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_VANV">igraph_cattribute_VANV — Query a numeric vertex attribute for many vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id28440">cattribute_VAN_set, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_VAN_set">igraph_cattribute_VAN_set — Set a numeric vertex attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id29058">cattribute_VAN_setv, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_VAN_setv">igraph_cattribute_VAN_setv — Set a numeric vertex attribute for all vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id27493">cattribute_VAS, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_VAS">igraph_cattribute_VAS — Query a string vertex attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id27588">cattribute_VASV, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_VASV">igraph_cattribute_VASV — Query a string vertex attribute for many vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id28646">cattribute_VAS_set, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_VAS_set">igraph_cattribute_VAS_set — Set a string vertex attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id29240">cattribute_VAS_setv, <a class="indexterm" href="igraph-Attributes.html#igraph_cattribute_VAS_setv">igraph_cattribute_VAS_setv — Set a string vertex attribute for all vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id48730">centralization, <a class="indexterm" href="igraph-Structural.html#igraph_centralization">igraph_centralization — Calculate the centralization score from the node level scores.</a>
|
||
</dt>
|
||
<dt id="ientry-id48941">centralization_betweenness, <a class="indexterm" href="igraph-Structural.html#igraph_centralization_betweenness">igraph_centralization_betweenness — Calculate vertex betweenness and graph centralization.</a>
|
||
</dt>
|
||
<dt id="ientry-id49272">centralization_betweenness_tmax, <a class="indexterm" href="igraph-Structural.html#igraph_centralization_betweenness_tmax">igraph_centralization_betweenness_tmax — Theoretical maximum for graph centralization based on betweenness.</a>
|
||
</dt>
|
||
<dt id="ientry-id49017">centralization_closeness, <a class="indexterm" href="igraph-Structural.html#igraph_centralization_closeness">igraph_centralization_closeness — Calculate vertex closeness and graph centralization.</a>
|
||
</dt>
|
||
<dt id="ientry-id49341">centralization_closeness_tmax, <a class="indexterm" href="igraph-Structural.html#igraph_centralization_closeness_tmax">igraph_centralization_closeness_tmax — Theoretical maximum for graph centralization based on closeness.</a>
|
||
</dt>
|
||
<dt id="ientry-id48854">centralization_degree, <a class="indexterm" href="igraph-Structural.html#igraph_centralization_degree">igraph_centralization_degree — Calculate vertex degree and graph centralization.</a>
|
||
</dt>
|
||
<dt id="ientry-id49192">centralization_degree_tmax, <a class="indexterm" href="igraph-Structural.html#igraph_centralization_degree_tmax">igraph_centralization_degree_tmax — Theoretical maximum for graph centralization based on degree.</a>
|
||
</dt>
|
||
<dt id="ientry-id49098">centralization_eigenvector_centrality, <a class="indexterm" href="igraph-Structural.html#igraph_centralization_eigenvector_centrality">igraph_centralization_eigenvector_centrality — Calculate eigenvector centrality scores and graph centralization.</a>
|
||
</dt>
|
||
<dt id="ientry-id49413">centralization_eigenvector_centrality_tmax, <a class="indexterm" href="igraph-Structural.html#igraph_centralization_eigenvector_centrality_tmax">igraph_centralization_eigenvector_centrality_tmax — Theoretical maximum centralization for eigenvector centrality.</a>
|
||
</dt>
|
||
<dt id="ientry-id4991">CHECK, <a class="indexterm" href="igraph-Error.html#IGRAPH_CHECK">IGRAPH_CHECK — Checks the return value of a function call.</a>
|
||
</dt>
|
||
<dt id="ientry-id5024">CHECK_CALLBACK, <a class="indexterm" href="igraph-Error.html#IGRAPH_CHECK_CALLBACK">IGRAPH_CHECK_CALLBACK — Checks the return value of a callback.</a>
|
||
</dt>
|
||
<dt id="ientry-id35576">chung_lu_game, <a class="indexterm" href="igraph-Games.html#igraph_chung_lu_game">igraph_chung_lu_game — Samples graphs from the Chung-Lu model.</a>
|
||
</dt>
|
||
<dt id="ientry-id37682">circle_beta_skeleton, <a class="indexterm" href="igraph-Spatial.html#igraph_circle_beta_skeleton">igraph_circle_beta_skeleton — The circle based β-skeleton of a 2D spatial point set.</a>
|
||
</dt>
|
||
<dt id="ientry-id31355">circulant, <a class="indexterm" href="igraph-Generators.html#igraph_circulant">igraph_circulant — Creates a circulant graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id34949">cited_type_game, <a class="indexterm" href="igraph-Games.html#igraph_cited_type_game">igraph_cited_type_game — Simulates a citation based on vertex types.</a>
|
||
</dt>
|
||
<dt id="ientry-id35023">citing_cited_type_game, <a class="indexterm" href="igraph-Games.html#igraph_citing_cited_type_game">igraph_citing_cited_type_game — Simulates a citation network based on vertex types.</a>
|
||
</dt>
|
||
<dt id="ientry-id56410">cliques, <a class="indexterm" href="igraph-Cliques.html#igraph_cliques">igraph_cliques — Finds all or some cliques in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id56655">cliques_callback, <a class="indexterm" href="igraph-Cliques.html#igraph_cliques_callback">igraph_cliques_callback — Calls a function for each clique in the graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id56729">clique_handler_t, <a class="indexterm" href="igraph-Cliques.html#igraph_clique_handler_t">igraph_clique_handler_t — Type of clique handler functions.</a>
|
||
</dt>
|
||
<dt id="ientry-id57324">clique_number, <a class="indexterm" href="igraph-Cliques.html#igraph_clique_number">igraph_clique_number — Finds the clique number of the graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id56593">clique_size_hist, <a class="indexterm" href="igraph-Cliques.html#igraph_clique_size_hist">igraph_clique_size_hist — Counts cliques of each size in the graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id46899">closeness, <a class="indexterm" href="igraph-Structural.html#igraph_closeness">igraph_closeness — Closeness centrality calculations for some vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id48179">closeness_cutoff, <a class="indexterm" href="igraph-Structural.html#igraph_closeness_cutoff">igraph_closeness_cutoff — Range limited closeness centrality.</a>
|
||
</dt>
|
||
<dt id="ientry-id73921">cmp_epsilon, <a class="indexterm" href="igraph-Nongraph.html#igraph_cmp_epsilon">igraph_cmp_epsilon — Compare two double-precision floats with a tolerance.</a>
|
||
</dt>
|
||
<dt id="ientry-id49581">cocitation, <a class="indexterm" href="igraph-Structural.html#igraph_cocitation">igraph_cocitation — Cocitation coupling.</a>
|
||
</dt>
|
||
<dt id="ientry-id62808">cohesion, <a class="indexterm" href="igraph-Flows.html#igraph_cohesion">igraph_cohesion — Graph cohesion, this is the same as vertex connectivity.</a>
|
||
</dt>
|
||
<dt id="ientry-id62869">cohesive_blocks, <a class="indexterm" href="igraph-Flows.html#igraph_cohesive_blocks">igraph_cohesive_blocks — Identifies the hierarchical cohesive block structure of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id61106">coloring_greedy_t, <a class="indexterm" href="igraph-Coloring.html#igraph_coloring_greedy_t">igraph_coloring_greedy_t — Ordering heuristics for greedy graph coloring.</a>
|
||
</dt>
|
||
<dt id="ientry-id64945">community_eb_get_merges, <a class="indexterm" href="igraph-Community.html#igraph_community_eb_get_merges">igraph_community_eb_get_merges — Calculating the merges, i.e. the dendrogram for an edge betweenness community structure.</a>
|
||
</dt>
|
||
<dt id="ientry-id64782">community_edge_betweenness, <a class="indexterm" href="igraph-Community.html#igraph_community_edge_betweenness">igraph_community_edge_betweenness — Community finding based on edge betweenness.</a>
|
||
</dt>
|
||
<dt id="ientry-id65045">community_fastgreedy, <a class="indexterm" href="igraph-Community.html#igraph_community_fastgreedy">igraph_community_fastgreedy — Finding community structure by greedy optimization of modularity.</a>
|
||
</dt>
|
||
<dt id="ientry-id65678">community_fluid_communities, <a class="indexterm" href="igraph-Community.html#igraph_community_fluid_communities">igraph_community_fluid_communities — Community detection based on fluids interacting on the graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id65874">community_infomap, <a class="indexterm" href="igraph-Community.html#igraph_community_infomap">igraph_community_infomap — Community structure that minimizes the expected description length of a random walker trajectory.</a>
|
||
</dt>
|
||
<dt id="ientry-id65721">community_label_propagation, <a class="indexterm" href="igraph-Community.html#igraph_community_label_propagation">igraph_community_label_propagation — Community detection based on label propagation.</a>
|
||
</dt>
|
||
<dt id="ientry-id64363">community_leading_eigenvector, <a class="indexterm" href="igraph-Community.html#igraph_community_leading_eigenvector">igraph_community_leading_eigenvector — Leading eigenvector community finding (proper version).</a>
|
||
</dt>
|
||
<dt id="ientry-id64512">community_leading_eigenvector_callback_t, <a class="indexterm" href="igraph-Community.html#igraph_community_leading_eigenvector_callback_t">igraph_community_leading_eigenvector_callback_t — Callback for the leading eigenvector community finding method.</a>
|
||
</dt>
|
||
<dt id="ientry-id65289">community_leiden, <a class="indexterm" href="igraph-Community.html#igraph_community_leiden">igraph_community_leiden — Finding community structure using the Leiden algorithm.</a>
|
||
</dt>
|
||
<dt id="ientry-id65544">community_leiden_simple, <a class="indexterm" href="igraph-Community.html#igraph_community_leiden_simple">igraph_community_leiden_simple — Finding community structure using the Leiden algorithm, simple interface.</a>
|
||
</dt>
|
||
<dt id="ientry-id65142">community_multilevel, <a class="indexterm" href="igraph-Community.html#igraph_community_multilevel">igraph_community_multilevel — Finding community structure by multi-level optimization of modularity (Louvain).</a>
|
||
</dt>
|
||
<dt id="ientry-id63647">community_optimal_modularity, <a class="indexterm" href="igraph-Community.html#igraph_community_optimal_modularity">igraph_community_optimal_modularity — Calculate the community structure with the highest modularity value.</a>
|
||
</dt>
|
||
<dt id="ientry-id64056">community_spinglass, <a class="indexterm" href="igraph-Community.html#igraph_community_spinglass">igraph_community_spinglass — Community detection based on statistical mechanics.</a>
|
||
</dt>
|
||
<dt id="ientry-id64190">community_spinglass_single, <a class="indexterm" href="igraph-Community.html#igraph_community_spinglass_single">igraph_community_spinglass_single — Community of a single node based on statistical mechanics.</a>
|
||
</dt>
|
||
<dt id="ientry-id63749">community_to_membership, <a class="indexterm" href="igraph-Community.html#igraph_community_to_membership">igraph_community_to_membership — Cut a dendrogram after a given number of merges.</a>
|
||
</dt>
|
||
<dt id="ientry-id65980">community_voronoi, <a class="indexterm" href="igraph-Community.html#igraph_community_voronoi">igraph_community_voronoi — Finds communities using Voronoi partitioning.</a>
|
||
</dt>
|
||
<dt id="ientry-id64662">community_walktrap, <a class="indexterm" href="igraph-Community.html#igraph_community_walktrap">igraph_community_walktrap — Community finding using a random walk based similarity measure.</a>
|
||
</dt>
|
||
<dt id="ientry-id63886">compare_communities, <a class="indexterm" href="igraph-Community.html#igraph_compare_communities">igraph_compare_communities — Compares community structures using various metrics.</a>
|
||
</dt>
|
||
<dt id="ientry-id38791">complementer, <a class="indexterm" href="igraph-Operators.html#igraph_complementer">igraph_complementer — Creates the complementer of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id74004">complex_almost_equals, <a class="indexterm" href="igraph-Nongraph.html#igraph_complex_almost_equals">igraph_complex_almost_equals — Compare two complex numbers with a tolerance.</a>
|
||
</dt>
|
||
<dt id="ientry-id38959">compose, <a class="indexterm" href="igraph-Operators.html#igraph_compose">igraph_compose — Calculates the composition of two graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id45699">connected_components, <a class="indexterm" href="igraph-Structural.html#igraph_connected_components">igraph_connected_components — Calculates the (weakly or strongly) connected components in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id39135">connect_neighborhood, <a class="indexterm" href="igraph-Operators.html#igraph_connect_neighborhood">igraph_connect_neighborhood — Connects each vertex to its neighborhood.</a>
|
||
</dt>
|
||
<dt id="ientry-id47679">constraint, <a class="indexterm" href="igraph-Structural.html#igraph_constraint">igraph_constraint — Burt's constraint scores.</a>
|
||
</dt>
|
||
<dt id="ientry-id39198">contract_vertices, <a class="indexterm" href="igraph-Operators.html#igraph_contract_vertices">igraph_contract_vertices — Replace multiple vertices with a single one.</a>
|
||
</dt>
|
||
<dt id="ientry-id48127">convergence_degree, <a class="indexterm" href="igraph-Structural.html#igraph_convergence_degree">igraph_convergence_degree — Calculates the convergence degree of each edge in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id37868">convex_hull_2d, <a class="indexterm" href="igraph-Spatial.html#igraph_convex_hull_2d">igraph_convex_hull_2d — Determines the convex hull of a given set of points in the 2D plane.</a>
|
||
</dt>
|
||
<dt id="ientry-id2335">copy, <a class="indexterm" href="igraph-Basic.html#igraph_copy">igraph_copy — Creates an exact (deep) copy of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id53825">coreness, <a class="indexterm" href="igraph-Structural.html#igraph_coreness">igraph_coreness — The coreness of the vertices in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id33939">correlated_game, <a class="indexterm" href="igraph-Games.html#igraph_correlated_game">igraph_correlated_game — Generates a random graph correlated to an existing graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id34002">correlated_pair_game, <a class="indexterm" href="igraph-Games.html#igraph_correlated_pair_game">igraph_correlated_pair_game — Generates pairs of correlated random graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id58153">count_adjacent_triangles, <a class="indexterm" href="igraph-Motifs.html#igraph_count_adjacent_triangles">igraph_count_adjacent_triangles — Count the number of triangles a vertex is part of.</a>
|
||
</dt>
|
||
<dt id="ientry-id58954">count_automorphisms, <a class="indexterm" href="igraph-Isomorphism.html#igraph_count_automorphisms">igraph_count_automorphisms — Number of automorphisms of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id59297">count_automorphisms_bliss, <a class="indexterm" href="igraph-Isomorphism.html#igraph_count_automorphisms_bliss">igraph_count_automorphisms_bliss — Number of automorphisms using Bliss.</a>
|
||
</dt>
|
||
<dt id="ientry-id59695">count_isomorphisms_vf2, <a class="indexterm" href="igraph-Isomorphism.html#igraph_count_isomorphisms_vf2">igraph_count_isomorphisms_vf2 — Number of isomorphisms via VF2.</a>
|
||
</dt>
|
||
<dt id="ientry-id52392">count_loops, <a class="indexterm" href="igraph-Structural.html#igraph_count_loops">igraph_count_loops — Counts the self-loops in the graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id52680">count_multiple, <a class="indexterm" href="igraph-Structural.html#igraph_count_multiple">igraph_count_multiple — The multiplicity of some edges in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id52737">count_multiple_1, <a class="indexterm" href="igraph-Structural.html#igraph_count_multiple_1">igraph_count_multiple_1 — The multiplicity of a single edge in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id46098">count_reachable, <a class="indexterm" href="igraph-Structural.html#igraph_count_reachable">igraph_count_reachable — The number of vertices reachable from each vertex in the graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id60187">count_subisomorphisms_vf2, <a class="indexterm" href="igraph-Isomorphism.html#igraph_count_subisomorphisms_vf2">igraph_count_subisomorphisms_vf2 — Number of subgraph isomorphisms using VF2</a>
|
||
</dt>
|
||
<dt id="ientry-id58206">count_triangles, <a class="indexterm" href="igraph-Motifs.html#igraph_count_triangles">igraph_count_triangles — Counts triangles in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id29921">create, <a class="indexterm" href="igraph-Generators.html#igraph_create">igraph_create — Creates a graph with the specified edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id36501">create_bipartite, <a class="indexterm" href="igraph-Bipartite.html#igraph_create_bipartite">igraph_create_bipartite — Create a bipartite graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id31153">cycle_graph, <a class="indexterm" href="igraph-Generators.html#igraph_cycle_graph">igraph_cycle_graph — A cycle graph C_n.</a>
|
||
</dt>
|
||
<dt id="ientry-id55407">cycle_handler_t, <a class="indexterm" href="igraph-Cycles.html#igraph_cycle_handler_t">igraph_cycle_handler_t — Type of cycle handler functions.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>D</h3>
|
||
<dl>
|
||
<dt id="ientry-id45911">decompose, <a class="indexterm" href="igraph-Structural.html#igraph_decompose">igraph_decompose — Decomposes a graph into connected components.</a>
|
||
</dt>
|
||
<dt id="ientry-id3352">degree, <a class="indexterm" href="igraph-Basic.html#igraph_degree">igraph_degree — The degree of some vertices in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id3612">degree_1, <a class="indexterm" href="igraph-Basic.html#igraph_degree_1">igraph_degree_1 — The degree of of a single vertex in the graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id53288">degree_correlation_vector, <a class="indexterm" href="igraph-Structural.html#igraph_degree_correlation_vector">igraph_degree_correlation_vector — Degree correlation function.</a>
|
||
</dt>
|
||
<dt id="ientry-id35185">degree_sequence_game, <a class="indexterm" href="igraph-Games.html#igraph_degree_sequence_game">igraph_degree_sequence_game — Generates a random graph with a given degree sequence.</a>
|
||
</dt>
|
||
<dt id="ientry-id29871">DELALL, <a class="indexterm" href="igraph-Attributes.html#DELALL">DELALL — Remove all attributes.</a>
|
||
</dt>
|
||
<dt id="ientry-id37427">delaunay_graph, <a class="indexterm" href="igraph-Spatial.html#igraph_delaunay_graph">igraph_delaunay_graph — Computes the Delaunay graph of a spatial point set.</a>
|
||
</dt>
|
||
<dt id="ientry-id29734">DELEA, <a class="indexterm" href="igraph-Attributes.html#DELEA">DELEA — Remove an edge attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id29851">DELEAS, <a class="indexterm" href="igraph-Attributes.html#DELEAS">DELEAS — Remove all edge attributes.</a>
|
||
</dt>
|
||
<dt id="ientry-id3899">delete_edges, <a class="indexterm" href="igraph-Basic.html#igraph_delete_edges">igraph_delete_edges — Removes edges from a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id3962">delete_vertices, <a class="indexterm" href="igraph-Basic.html#igraph_delete_vertices">igraph_delete_vertices — Removes some vertices (with all their edges) from the graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id4037">delete_vertices_map, <a class="indexterm" href="igraph-Basic.html#igraph_delete_vertices_map">igraph_delete_vertices_map — Removes some vertices (with all their edges) from the graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id29612">DELGA, <a class="indexterm" href="igraph-Attributes.html#DELGA">DELGA — Remove a graph attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id29811">DELGAS, <a class="indexterm" href="igraph-Attributes.html#DELGAS">DELGAS — Remove all graph attributes.</a>
|
||
</dt>
|
||
<dt id="ientry-id29673">DELVA, <a class="indexterm" href="igraph-Attributes.html#DELVA">DELVA — Remove a vertex attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id29831">DELVAS, <a class="indexterm" href="igraph-Attributes.html#DELVAS">DELVAS — Remove all vertex attributes.</a>
|
||
</dt>
|
||
<dt id="ientry-id54399">density, <a class="indexterm" href="igraph-Structural.html#igraph_density">igraph_density — Calculate the density of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id2418">destroy, <a class="indexterm" href="igraph-Basic.html#igraph_destroy">igraph_destroy — Frees the memory allocated for a graph object.</a>
|
||
</dt>
|
||
<dt id="ientry-id32899">de_bruijn, <a class="indexterm" href="igraph-Generators.html#igraph_de_bruijn">igraph_de_bruijn — Generate a de Bruijn graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id40633">dfs, <a class="indexterm" href="igraph-Visitors.html#igraph_dfs">igraph_dfs — Depth-first search.</a>
|
||
</dt>
|
||
<dt id="ientry-id40720">dfshandler_t, <a class="indexterm" href="igraph-Visitors.html#igraph_dfshandler_t">igraph_dfshandler_t — Callback type for the DFS function.</a>
|
||
</dt>
|
||
<dt id="ientry-id43594">diameter, <a class="indexterm" href="igraph-Structural.html#igraph_diameter">igraph_diameter — Calculates the weighted diameter of a graph using Dijkstra's algorithm.</a>
|
||
</dt>
|
||
<dt id="ientry-id38587">difference, <a class="indexterm" href="igraph-Operators.html#igraph_difference">igraph_difference — Calculates the difference of two graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id67063">dim_select, <a class="indexterm" href="igraph-Embedding.html#igraph_dim_select">igraph_dim_select — Dimensionality selection.</a>
|
||
</dt>
|
||
<dt id="ientry-id37915">disjoint_union, <a class="indexterm" href="igraph-Operators.html#igraph_disjoint_union">igraph_disjoint_union — Creates the union of two disjoint graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id38051">disjoint_union_many, <a class="indexterm" href="igraph-Operators.html#igraph_disjoint_union_many">igraph_disjoint_union_many — The disjoint union of many graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id40993">distances, <a class="indexterm" href="igraph-Structural.html#igraph_distances">igraph_distances — Length of the shortest paths between vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id41611">distances_bellman_ford, <a class="indexterm" href="igraph-Structural.html#igraph_distances_bellman_ford">igraph_distances_bellman_ford — Weighted shortest path lengths between vertices, allowing negative weights.</a>
|
||
</dt>
|
||
<dt id="ientry-id41159">distances_cutoff, <a class="indexterm" href="igraph-Structural.html#igraph_distances_cutoff">igraph_distances_cutoff — Length of the shortest paths between vertices, with cutoff.</a>
|
||
</dt>
|
||
<dt id="ientry-id41332">distances_dijkstra, <a class="indexterm" href="igraph-Structural.html#igraph_distances_dijkstra">igraph_distances_dijkstra — Weighted shortest path lengths between vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id41466">distances_dijkstra_cutoff, <a class="indexterm" href="igraph-Structural.html#igraph_distances_dijkstra_cutoff">igraph_distances_dijkstra_cutoff — Weighted shortest path lengths between vertices, with cutoff.</a>
|
||
</dt>
|
||
<dt id="ientry-id41849">distances_floyd_warshall, <a class="indexterm" href="igraph-Structural.html#igraph_distances_floyd_warshall">igraph_distances_floyd_warshall — Weighted all-pairs shortest path lengths with the Floyd-Warshall algorithm.</a>
|
||
</dt>
|
||
<dt id="ientry-id41760">distances_johnson, <a class="indexterm" href="igraph-Structural.html#igraph_distances_johnson">igraph_distances_johnson — Weighted shortest path lengths between vertices, using Johnson's algorithm.</a>
|
||
</dt>
|
||
<dt id="ientry-id54587">diversity, <a class="indexterm" href="igraph-Structural.html#igraph_diversity">igraph_diversity — Structural diversity index of the vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id61646">dominator_tree, <a class="indexterm" href="igraph-Flows.html#igraph_dominator_tree">igraph_dominator_tree — Calculates the dominator tree of a flowgraph.</a>
|
||
</dt>
|
||
<dt id="ientry-id36278">dot_product_game, <a class="indexterm" href="igraph-Games.html#igraph_dot_product_game">igraph_dot_product_game — Generates a random dot product graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id17303">dqueue_back, <a class="indexterm" href="igraph-Data-structures.html#igraph_dqueue_back">igraph_dqueue_back — Tail of the queue.</a>
|
||
</dt>
|
||
<dt id="ientry-id17226">dqueue_clear, <a class="indexterm" href="igraph-Data-structures.html#igraph_dqueue_clear">igraph_dqueue_clear — Remove all elements from the queue.</a>
|
||
</dt>
|
||
<dt id="ientry-id17143">dqueue_destroy, <a class="indexterm" href="igraph-Data-structures.html#igraph_dqueue_destroy">igraph_dqueue_destroy — Destroy a double ended queue.</a>
|
||
</dt>
|
||
<dt id="ientry-id17162">dqueue_empty, <a class="indexterm" href="igraph-Data-structures.html#igraph_dqueue_empty">igraph_dqueue_empty — Decide whether the queue is empty.</a>
|
||
</dt>
|
||
<dt id="ientry-id17192">dqueue_full, <a class="indexterm" href="igraph-Data-structures.html#igraph_dqueue_full">igraph_dqueue_full — Check whether the queue is full.</a>
|
||
</dt>
|
||
<dt id="ientry-id17332">dqueue_get, <a class="indexterm" href="igraph-Data-structures.html#igraph_dqueue_get">igraph_dqueue_get — Access an element in a queue.</a>
|
||
</dt>
|
||
<dt id="ientry-id17274">dqueue_head, <a class="indexterm" href="igraph-Data-structures.html#igraph_dqueue_head">igraph_dqueue_head — Head of the queue.</a>
|
||
</dt>
|
||
<dt id="ientry-id17108">dqueue_init, <a class="indexterm" href="igraph-Data-structures.html#igraph_dqueue_init">igraph_dqueue_init — Initialize a double ended queue (deque).</a>
|
||
</dt>
|
||
<dt id="ientry-id17366">dqueue_pop, <a class="indexterm" href="igraph-Data-structures.html#igraph_dqueue_pop">igraph_dqueue_pop — Remove the head.</a>
|
||
</dt>
|
||
<dt id="ientry-id17395">dqueue_pop_back, <a class="indexterm" href="igraph-Data-structures.html#igraph_dqueue_pop_back">igraph_dqueue_pop_back — Removes the tail.</a>
|
||
</dt>
|
||
<dt id="ientry-id17424">dqueue_push, <a class="indexterm" href="igraph-Data-structures.html#igraph_dqueue_push">igraph_dqueue_push — Appends an element.</a>
|
||
</dt>
|
||
<dt id="ientry-id17245">dqueue_size, <a class="indexterm" href="igraph-Data-structures.html#igraph_dqueue_size">igraph_dqueue_size — Number of elements in the queue.</a>
|
||
</dt>
|
||
<dt id="ientry-id57938">dyad_census, <a class="indexterm" href="igraph-Motifs.html#igraph_dyad_census">igraph_dyad_census — Dyad census, as defined by Holland and Leinhardt.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>E</h3>
|
||
<dl>
|
||
<dt id="ientry-id27902">EAB, <a class="indexterm" href="igraph-Attributes.html#EAB">EAB — Query a boolean edge attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id27986">EABV, <a class="indexterm" href="igraph-Attributes.html#EABV">EABV — Query a boolean edge attribute for all edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id27725">EAN, <a class="indexterm" href="igraph-Attributes.html#EAN">EAN — Query a numeric edge attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id27809">EANV, <a class="indexterm" href="igraph-Attributes.html#EANV">EANV — Query a numeric edge attribute for all edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id28071">EAS, <a class="indexterm" href="igraph-Attributes.html#EAS">EAS — Query a string edge attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id28155">EASV, <a class="indexterm" href="igraph-Attributes.html#EASV">EASV — Query a string edge attribute for all edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id51624">ecc, <a class="indexterm" href="igraph-Structural.html#igraph_ecc">igraph_ecc — Edge clustering coefficient of some edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id43808">eccentricity, <a class="indexterm" href="igraph-Structural.html#igraph_eccentricity">igraph_eccentricity — Eccentricity of some vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id2470">ecount, <a class="indexterm" href="igraph-Basic.html#igraph_ecount">igraph_ecount — The number of edges in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id4105">ECOUNT_MAX, <a class="indexterm" href="igraph-Basic.html#IGRAPH_ECOUNT_MAX">IGRAPH_ECOUNT_MAX — The maximum number of edges supported in igraph graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id2557">edge, <a class="indexterm" href="igraph-Basic.html#igraph_edge">igraph_edge — Returns the head and tail vertices of an edge.</a>
|
||
</dt>
|
||
<dt id="ientry-id46660">edgelist_percolation, <a class="indexterm" href="igraph-Structural.html#igraph_edgelist_percolation">igraph_edgelist_percolation — The size of the largest component as vertex pairs are connected.</a>
|
||
</dt>
|
||
<dt id="ientry-id2624">edges, <a class="indexterm" href="igraph-Basic.html#igraph_edges">igraph_edges — Gives the head and tail vertices of a series of edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id47214">edge_betweenness, <a class="indexterm" href="igraph-Structural.html#igraph_edge_betweenness">igraph_edge_betweenness — Betweenness centrality of the edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id48483">edge_betweenness_cutoff, <a class="indexterm" href="igraph-Structural.html#igraph_edge_betweenness_cutoff">igraph_edge_betweenness_cutoff — Range-limited betweenness centrality of the edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id48645">edge_betweenness_subset, <a class="indexterm" href="igraph-Structural.html#igraph_edge_betweenness_subset">igraph_edge_betweenness_subset — Edge betweenness centrality for a subset of source and target vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id62423">edge_connectivity, <a class="indexterm" href="igraph-Flows.html#igraph_edge_connectivity">igraph_edge_connectivity — The minimum edge connectivity in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id62622">edge_disjoint_paths, <a class="indexterm" href="igraph-Flows.html#igraph_edge_disjoint_paths">igraph_edge_disjoint_paths — The maximum number of edge-disjoint paths between two vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id36462">edge_type_sw_t, <a class="indexterm" href="igraph-Games.html#igraph_edge_type_sw_t">igraph_edge_type_sw_t — What types of non-simple edges to allow?</a>
|
||
</dt>
|
||
<dt id="ientry-id47883">eigenvector_centrality, <a class="indexterm" href="igraph-Structural.html#igraph_eigenvector_centrality">igraph_eigenvector_centrality — Eigenvector centrality of the vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id25231">eit_create, <a class="indexterm" href="igraph-Iterators.html#igraph_eit_create">igraph_eit_create — Creates an edge iterator from an edge selector.</a>
|
||
</dt>
|
||
<dt id="ientry-id25297">eit_destroy, <a class="indexterm" href="igraph-Iterators.html#igraph_eit_destroy">igraph_eit_destroy — Destroys an edge iterator.</a>
|
||
</dt>
|
||
<dt id="ientry-id25361">EIT_END, <a class="indexterm" href="igraph-Iterators.html#IGRAPH_EIT_END">IGRAPH_EIT_END — Are we at the end?</a>
|
||
</dt>
|
||
<dt id="ientry-id25435">EIT_GET, <a class="indexterm" href="igraph-Iterators.html#IGRAPH_EIT_GET">IGRAPH_EIT_GET — Query an edge iterator.</a>
|
||
</dt>
|
||
<dt id="ientry-id25341">EIT_NEXT, <a class="indexterm" href="igraph-Iterators.html#IGRAPH_EIT_NEXT">IGRAPH_EIT_NEXT — Next edge.</a>
|
||
</dt>
|
||
<dt id="ientry-id25417">EIT_RESET, <a class="indexterm" href="igraph-Iterators.html#IGRAPH_EIT_RESET">IGRAPH_EIT_RESET — Reset an edge iterator.</a>
|
||
</dt>
|
||
<dt id="ientry-id25389">EIT_SIZE, <a class="indexterm" href="igraph-Iterators.html#IGRAPH_EIT_SIZE">IGRAPH_EIT_SIZE — Number of edges in the iterator.</a>
|
||
</dt>
|
||
<dt id="ientry-id2165">empty, <a class="indexterm" href="igraph-Basic.html#igraph_empty">igraph_empty — Creates an empty graph with some vertices and no edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id2253">empty_attrs, <a class="indexterm" href="igraph-Basic.html#igraph_empty_attrs">igraph_empty_attrs — Creates an empty graph with some vertices, no edges and some graph attributes.</a>
|
||
</dt>
|
||
<dt id="ientry-id71121">enter_safelocale, <a class="indexterm" href="igraph-Foreign.html#igraph_enter_safelocale">igraph_enter_safelocale — Temporarily set the C locale.</a>
|
||
</dt>
|
||
<dt id="ientry-id33187">erdos_renyi_game_gnm, <a class="indexterm" href="igraph-Games.html#igraph_erdos_renyi_game_gnm">igraph_erdos_renyi_game_gnm — Generates a random (Erdős-Rényi) graph with a fixed number of edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id33314">erdos_renyi_game_gnp, <a class="indexterm" href="igraph-Games.html#igraph_erdos_renyi_game_gnp">igraph_erdos_renyi_game_gnp — Generates a random (Erdős-Rényi) graph with fixed edge probabilities.</a>
|
||
</dt>
|
||
<dt id="ientry-id4799">ERROR, <a class="indexterm" href="igraph-Error.html#IGRAPH_ERROR">IGRAPH_ERROR — Triggers an error.</a>
|
||
</dt>
|
||
<dt id="ientry-id4868">error, <a class="indexterm" href="igraph-Error.html#igraph_error">igraph_error — Reports an error.</a>
|
||
</dt>
|
||
<dt id="ientry-id4831">ERRORF, <a class="indexterm" href="igraph-Error.html#IGRAPH_ERRORF">IGRAPH_ERRORF — Triggers an error, with printf-like syntax.</a>
|
||
</dt>
|
||
<dt id="ientry-id4928">errorf, <a class="indexterm" href="igraph-Error.html#igraph_errorf">igraph_errorf — Reports an error, printf-like version.</a>
|
||
</dt>
|
||
<dt id="ientry-id4303">error_handler_abort, <a class="indexterm" href="igraph-Error.html#igraph_error_handler_abort">igraph_error_handler_abort — Abort program in case of error.</a>
|
||
</dt>
|
||
<dt id="ientry-id4311">error_handler_ignore, <a class="indexterm" href="igraph-Error.html#igraph_error_handler_ignore">igraph_error_handler_ignore — Ignore errors.</a>
|
||
</dt>
|
||
<dt id="ientry-id4319">error_handler_printignore, <a class="indexterm" href="igraph-Error.html#igraph_error_handler_printignore">igraph_error_handler_printignore — Print and ignore errors.</a>
|
||
</dt>
|
||
<dt id="ientry-id4269">error_handler_t, <a class="indexterm" href="igraph-Error.html#igraph_error_handler_t">igraph_error_handler_t — The type of error handler functions.</a>
|
||
</dt>
|
||
<dt id="ientry-id4334">error_t, <a class="indexterm" href="igraph-Error.html#igraph_error_t">igraph_error_t — Return type for functions returning an error code.</a>
|
||
</dt>
|
||
<dt id="ientry-id4345">error_type_t, <a class="indexterm" href="igraph-Error.html#igraph_error_type_t">igraph_error_type_t — Error code type.</a>
|
||
</dt>
|
||
<dt id="ientry-id24908">ess_1, <a class="indexterm" href="igraph-Iterators.html#igraph_ess_1">igraph_ess_1 — Immediate version of the single edge edge selector.</a>
|
||
</dt>
|
||
<dt id="ientry-id24833">ess_all, <a class="indexterm" href="igraph-Iterators.html#igraph_ess_all">igraph_ess_all — Edge set, all edges (immediate version).</a>
|
||
</dt>
|
||
<dt id="ientry-id24876">ess_none, <a class="indexterm" href="igraph-Iterators.html#igraph_ess_none">igraph_ess_none — Immediate empty edge selector.</a>
|
||
</dt>
|
||
<dt id="ientry-id24990">ess_range, <a class="indexterm" href="igraph-Iterators.html#igraph_ess_range">igraph_ess_range — Immediate version of the sequence edge selector.</a>
|
||
</dt>
|
||
<dt id="ientry-id24949">ess_vector, <a class="indexterm" href="igraph-Iterators.html#igraph_ess_vector">igraph_ess_vector — Immediate vector view edge selector.</a>
|
||
</dt>
|
||
<dt id="ientry-id34878">establishment_game, <a class="indexterm" href="igraph-Games.html#igraph_establishment_game">igraph_establishment_game — Generates a graph with a simple growing model with vertex types.</a>
|
||
</dt>
|
||
<dt id="ientry-id24353">es_1, <a class="indexterm" href="igraph-Iterators.html#igraph_es_1">igraph_es_1 — Edge selector containing a single edge.</a>
|
||
</dt>
|
||
<dt id="ientry-id24180">es_all, <a class="indexterm" href="igraph-Iterators.html#igraph_es_all">igraph_es_all — Edge set, all edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id24401">es_all_between, <a class="indexterm" href="igraph-Iterators.html#igraph_es_all_between">igraph_es_all_between — Edge selector, all edge IDs between a pair of vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id25039">es_as_vector, <a class="indexterm" href="igraph-Iterators.html#igraph_es_as_vector">igraph_es_as_vector — Transform edge selector into vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id25079">es_copy, <a class="indexterm" href="igraph-Iterators.html#igraph_es_copy">igraph_es_copy — Creates a copy of an edge selector.</a>
|
||
</dt>
|
||
<dt id="ientry-id25125">es_destroy, <a class="indexterm" href="igraph-Iterators.html#igraph_es_destroy">igraph_es_destroy — Destroys an edge selector object.</a>
|
||
</dt>
|
||
<dt id="ientry-id24246">es_incident, <a class="indexterm" href="igraph-Iterators.html#igraph_es_incident">igraph_es_incident — Edges incident on a given vertex.</a>
|
||
</dt>
|
||
<dt id="ientry-id25145">es_is_all, <a class="indexterm" href="igraph-Iterators.html#igraph_es_is_all">igraph_es_is_all — Check whether an edge selector includes all edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id24310">es_none, <a class="indexterm" href="igraph-Iterators.html#igraph_es_none">igraph_es_none — Empty edge selector.</a>
|
||
</dt>
|
||
<dt id="ientry-id24561">es_pairs, <a class="indexterm" href="igraph-Iterators.html#igraph_es_pairs">igraph_es_pairs — Edge selector, multiple edges defined by their endpoints in a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id24676">es_pairs_small, <a class="indexterm" href="igraph-Iterators.html#igraph_es_pairs_small">igraph_es_pairs_small — Edge selector, multiple edges defined by their endpoints as arguments.</a>
|
||
</dt>
|
||
<dt id="ientry-id24732">es_path, <a class="indexterm" href="igraph-Iterators.html#igraph_es_path">igraph_es_path — Edge selector, edge IDs on a path.</a>
|
||
</dt>
|
||
<dt id="ientry-id24505">es_range, <a class="indexterm" href="igraph-Iterators.html#igraph_es_range">igraph_es_range — Edge selector, a sequence of edge IDs.</a>
|
||
</dt>
|
||
<dt id="ientry-id25181">es_size, <a class="indexterm" href="igraph-Iterators.html#igraph_es_size">igraph_es_size — Returns the size of the edge selector.</a>
|
||
</dt>
|
||
<dt id="ientry-id25220">es_type, <a class="indexterm" href="igraph-Iterators.html#igraph_es_type">igraph_es_type — Returns the type of the edge selector.</a>
|
||
</dt>
|
||
<dt id="ientry-id24457">es_vector, <a class="indexterm" href="igraph-Iterators.html#igraph_es_vector">igraph_es_vector — Handle a vector as an edge selector.</a>
|
||
</dt>
|
||
<dt id="ientry-id24783">es_vector_copy, <a class="indexterm" href="igraph-Iterators.html#igraph_es_vector_copy">igraph_es_vector_copy — Edge set, based on a vector, with copying.</a>
|
||
</dt>
|
||
<dt id="ientry-id56053">eulerian_cycle, <a class="indexterm" href="igraph-Cycles.html#igraph_eulerian_cycle">igraph_eulerian_cycle — Finds an Eulerian cycle.</a>
|
||
</dt>
|
||
<dt id="ientry-id56107">eulerian_path, <a class="indexterm" href="igraph-Cycles.html#igraph_eulerian_path">igraph_eulerian_path — Finds an Eulerian path.</a>
|
||
</dt>
|
||
<dt id="ientry-id63356">even_tarjan_reduction, <a class="indexterm" href="igraph-Separators.html#igraph_even_tarjan_reduction">igraph_even_tarjan_reduction — Even-Tarjan reduction of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id71209">exit_safelocale, <a class="indexterm" href="igraph-Foreign.html#igraph_exit_safelocale">igraph_exit_safelocale — Temporarily set the C locale.</a>
|
||
</dt>
|
||
<dt id="ientry-id4125">expand_path_to_pairs, <a class="indexterm" href="igraph-Basic.html#igraph_expand_path_to_pairs">igraph_expand_path_to_pairs — Helper function to convert a sequence of vertex IDs describing a path into a "pairs" vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id31426">extended_chordal_ring, <a class="indexterm" href="igraph-Generators.html#igraph_extended_chordal_ring">igraph_extended_chordal_ring — Create an extended chordal ring.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>F</h3>
|
||
<dl>
|
||
<dt id="ientry-id32603">famous, <a class="indexterm" href="igraph-Generators.html#igraph_famous">igraph_famous — Create a famous graph by simply providing its name.</a>
|
||
</dt>
|
||
<dt id="ientry-id5311">FATAL, <a class="indexterm" href="igraph-Error.html#IGRAPH_FATAL">IGRAPH_FATAL — Triggers a fatal error.</a>
|
||
</dt>
|
||
<dt id="ientry-id5393">fatal, <a class="indexterm" href="igraph-Error.html#igraph_fatal">igraph_fatal — Triggers a fatal error.</a>
|
||
</dt>
|
||
<dt id="ientry-id5334">FATALF, <a class="indexterm" href="igraph-Error.html#IGRAPH_FATALF">IGRAPH_FATALF — Triggers a fatal error, with printf-like syntax.</a>
|
||
</dt>
|
||
<dt id="ientry-id5426">fatalf, <a class="indexterm" href="igraph-Error.html#igraph_fatalf">igraph_fatalf — Triggers a fatal error, printf-like syntax.</a>
|
||
</dt>
|
||
<dt id="ientry-id5303">fatal_handler_abort, <a class="indexterm" href="igraph-Error.html#igraph_fatal_handler_abort">igraph_fatal_handler_abort — Abort program in case of fatal error.</a>
|
||
</dt>
|
||
<dt id="ientry-id5239">fatal_handler_t, <a class="indexterm" href="igraph-Error.html#igraph_fatal_handler_t">igraph_fatal_handler_t — The type of igraph fatal error handler functions.</a>
|
||
</dt>
|
||
<dt id="ientry-id55640">feedback_arc_set, <a class="indexterm" href="igraph-Cycles.html#igraph_feedback_arc_set">igraph_feedback_arc_set — Feedback arc set of a graph using exact or heuristic methods.</a>
|
||
</dt>
|
||
<dt id="ientry-id55951">feedback_vertex_set, <a class="indexterm" href="igraph-Cycles.html#igraph_feedback_vertex_set">igraph_feedback_vertex_set — Feedback vertex set of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id5068">FINALLY, <a class="indexterm" href="igraph-Error.html#IGRAPH_FINALLY">IGRAPH_FINALLY — Registers an object for deallocation.</a>
|
||
</dt>
|
||
<dt id="ientry-id5098">FINALLY_CLEAN, <a class="indexterm" href="igraph-Error.html#IGRAPH_FINALLY_CLEAN">IGRAPH_FINALLY_CLEAN — Signals clean deallocation of objects.</a>
|
||
</dt>
|
||
<dt id="ientry-id5118">FINALLY_FREE, <a class="indexterm" href="igraph-Error.html#IGRAPH_FINALLY_FREE">IGRAPH_FINALLY_FREE — Deallocates objects registered at the current level.</a>
|
||
</dt>
|
||
<dt id="ientry-id55176">find_cycle, <a class="indexterm" href="igraph-Cycles.html#igraph_find_cycle">igraph_find_cycle — Finds a single cycle in the graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id35093">forest_fire_game, <a class="indexterm" href="igraph-Games.html#igraph_forest_fire_game">igraph_forest_fire_game — Generates a network according to the “forest fire game”.</a>
|
||
</dt>
|
||
<dt id="ientry-id5633">free, <a class="indexterm" href="igraph-Memory.html#igraph_free">igraph_free — Deallocates memory that was allocated by igraph functions.</a>
|
||
</dt>
|
||
<dt id="ientry-id2692">FROM, <a class="indexterm" href="igraph-Basic.html#IGRAPH_FROM">IGRAPH_FROM — The source vertex of an edge.</a>
|
||
</dt>
|
||
<dt id="ientry-id66638">from_hrg_dendrogram, <a class="indexterm" href="igraph-HRG.html#igraph_from_hrg_dendrogram">igraph_from_hrg_dendrogram — Create a graph representation of the dendrogram of a hierarchical random graph model.</a>
|
||
</dt>
|
||
<dt id="ientry-id31936">from_prufer, <a class="indexterm" href="igraph-Generators.html#igraph_from_prufer">igraph_from_prufer — Generates a tree from a Prüfer sequence.</a>
|
||
</dt>
|
||
<dt id="ientry-id32302">full, <a class="indexterm" href="igraph-Generators.html#igraph_full">igraph_full — Creates a full graph (complete graph).</a>
|
||
</dt>
|
||
<dt id="ientry-id36576">full_bipartite, <a class="indexterm" href="igraph-Bipartite.html#igraph_full_bipartite">igraph_full_bipartite — Creates a complete bipartite graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id32418">full_citation, <a class="indexterm" href="igraph-Generators.html#igraph_full_citation">igraph_full_citation — Creates a full citation graph (a complete directed acyclic graph).</a>
|
||
</dt>
|
||
<dt id="ientry-id32472">full_multipartite, <a class="indexterm" href="igraph-Generators.html#igraph_full_multipartite">igraph_full_multipartite — Creates a full multipartite graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id56163">fundamental_cycles, <a class="indexterm" href="igraph-Cycles.html#igraph_fundamental_cycles">igraph_fundamental_cycles — Finds a fundamental cycle basis.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>G</h3>
|
||
<dl>
|
||
<dt id="ientry-id27021">GAB, <a class="indexterm" href="igraph-Attributes.html#GAB">GAB — Query a boolean graph attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id37531">gabriel_graph, <a class="indexterm" href="igraph-Spatial.html#igraph_gabriel_graph">igraph_gabriel_graph — The Gabriel graph of a point set.</a>
|
||
</dt>
|
||
<dt id="ientry-id26940">GAN, <a class="indexterm" href="igraph-Attributes.html#GAN">GAN — Query a numeric graph attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id27104">GAS, <a class="indexterm" href="igraph-Attributes.html#GAS">GAS — Query a string graph attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id33025">generalized_petersen, <a class="indexterm" href="igraph-Generators.html#igraph_generalized_petersen">igraph_generalized_petersen — Creates a Generalized Petersen graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id54738">get_adjacency, <a class="indexterm" href="igraph-Structural.html#igraph_get_adjacency">igraph_get_adjacency — The adjacency matrix of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id54835">get_adjacency_sparse, <a class="indexterm" href="igraph-Structural.html#igraph_get_adjacency_sparse">igraph_get_adjacency_sparse — Returns the adjacency matrix of a graph in a sparse matrix format.</a>
|
||
</dt>
|
||
<dt id="ientry-id3129">get_all_eids_between, <a class="indexterm" href="igraph-Basic.html#igraph_get_all_eids_between">igraph_get_all_eids_between — Returns all edge IDs between a pair of vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id42874">get_all_shortest_paths, <a class="indexterm" href="igraph-Structural.html#igraph_get_all_shortest_paths">igraph_get_all_shortest_paths — All shortest paths (geodesics) from a vertex.</a>
|
||
</dt>
|
||
<dt id="ientry-id42979">get_all_shortest_paths_dijkstra, <a class="indexterm" href="igraph-Structural.html#igraph_get_all_shortest_paths_dijkstra">igraph_get_all_shortest_paths_dijkstra — All weighted shortest paths (geodesics) from a vertex.</a>
|
||
</dt>
|
||
<dt id="ientry-id43290">get_all_simple_paths, <a class="indexterm" href="igraph-Structural.html#igraph_get_all_simple_paths">igraph_get_all_simple_paths — List all simple paths from one source.</a>
|
||
</dt>
|
||
<dt id="ientry-id37111">get_biadjacency, <a class="indexterm" href="igraph-Bipartite.html#igraph_get_biadjacency">igraph_get_biadjacency — Converts a bipartite graph into a bipartite adjacency matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id55054">get_edgelist, <a class="indexterm" href="igraph-Structural.html#igraph_get_edgelist">igraph_get_edgelist — The list of edges in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id2842">get_eid, <a class="indexterm" href="igraph-Basic.html#igraph_get_eid">igraph_get_eid — Get the edge ID from the endpoints of an edge.</a>
|
||
</dt>
|
||
<dt id="ientry-id2968">get_eids, <a class="indexterm" href="igraph-Basic.html#igraph_get_eids">igraph_get_eids — Return edge IDs based on the adjacent vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id59788">get_isomorphisms_vf2, <a class="indexterm" href="igraph-Isomorphism.html#igraph_get_isomorphisms_vf2">igraph_get_isomorphisms_vf2 — Collect all isomorphic mappings of two graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id59877">get_isomorphisms_vf2_callback, <a class="indexterm" href="igraph-Isomorphism.html#igraph_get_isomorphisms_vf2_callback">igraph_get_isomorphisms_vf2_callback — The generic VF2 interface</a>
|
||
</dt>
|
||
<dt id="ientry-id43150">get_k_shortest_paths, <a class="indexterm" href="igraph-Structural.html#igraph_get_k_shortest_paths">igraph_get_k_shortest_paths — k shortest paths between two vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id51850">get_laplacian, <a class="indexterm" href="igraph-Structural.html#igraph_get_laplacian">igraph_get_laplacian — Returns the Laplacian matrix of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id51945">get_laplacian_sparse, <a class="indexterm" href="igraph-Structural.html#igraph_get_laplacian_sparse">igraph_get_laplacian_sparse — Returns the Laplacian of a graph in a sparse matrix format.</a>
|
||
</dt>
|
||
<dt id="ientry-id42185">get_shortest_path, <a class="indexterm" href="igraph-Structural.html#igraph_get_shortest_path">igraph_get_shortest_path — Shortest path from one vertex to another one.</a>
|
||
</dt>
|
||
<dt id="ientry-id41967">get_shortest_paths, <a class="indexterm" href="igraph-Structural.html#igraph_get_shortest_paths">igraph_get_shortest_paths — Shortest paths from a vertex.</a>
|
||
</dt>
|
||
<dt id="ientry-id42525">get_shortest_paths_bellman_ford, <a class="indexterm" href="igraph-Structural.html#igraph_get_shortest_paths_bellman_ford">igraph_get_shortest_paths_bellman_ford — Weighted shortest paths from a vertex, allowing negative weights.</a>
|
||
</dt>
|
||
<dt id="ientry-id42263">get_shortest_paths_dijkstra, <a class="indexterm" href="igraph-Structural.html#igraph_get_shortest_paths_dijkstra">igraph_get_shortest_paths_dijkstra — Weighted shortest paths from a vertex.</a>
|
||
</dt>
|
||
<dt id="ientry-id42721">get_shortest_path_astar, <a class="indexterm" href="igraph-Structural.html#igraph_get_shortest_path_astar">igraph_get_shortest_path_astar — A* gives the shortest path from one vertex to another, with heuristic.</a>
|
||
</dt>
|
||
<dt id="ientry-id42644">get_shortest_path_bellman_ford, <a class="indexterm" href="igraph-Structural.html#igraph_get_shortest_path_bellman_ford">igraph_get_shortest_path_bellman_ford — Weighted shortest path from one vertex to another one (Bellman-Ford).</a>
|
||
</dt>
|
||
<dt id="ientry-id42446">get_shortest_path_dijkstra, <a class="indexterm" href="igraph-Structural.html#igraph_get_shortest_path_dijkstra">igraph_get_shortest_path_dijkstra — Weighted shortest path from one vertex to another one (Dijkstra).</a>
|
||
</dt>
|
||
<dt id="ientry-id54932">get_stochastic, <a class="indexterm" href="igraph-Structural.html#igraph_get_stochastic">igraph_get_stochastic — Stochastic adjacency matrix of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id54993">get_stochastic_sparse, <a class="indexterm" href="igraph-Structural.html#igraph_get_stochastic_sparse">igraph_get_stochastic_sparse — The stochastic adjacency matrix of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id60272">get_subisomorphisms_vf2, <a class="indexterm" href="igraph-Isomorphism.html#igraph_get_subisomorphisms_vf2">igraph_get_subisomorphisms_vf2 — Return all subgraph isomorphic mappings.</a>
|
||
</dt>
|
||
<dt id="ientry-id60361">get_subisomorphisms_vf2_callback, <a class="indexterm" href="igraph-Isomorphism.html#igraph_get_subisomorphisms_vf2_callback">igraph_get_subisomorphisms_vf2_callback — Generic VF2 function for subgraph isomorphism problems.</a>
|
||
</dt>
|
||
<dt id="ientry-id44283">get_widest_path, <a class="indexterm" href="igraph-Structural.html#igraph_get_widest_path">igraph_get_widest_path — Widest path from one vertex to another one.</a>
|
||
</dt>
|
||
<dt id="ientry-id44378">get_widest_paths, <a class="indexterm" href="igraph-Structural.html#igraph_get_widest_paths">igraph_get_widest_paths — Widest paths from a single vertex.</a>
|
||
</dt>
|
||
<dt id="ientry-id43719">girth, <a class="indexterm" href="igraph-Structural.html#igraph_girth">igraph_girth — The girth of a graph is the length of the shortest cycle in it.</a>
|
||
</dt>
|
||
<dt id="ientry-id44663">global_efficiency, <a class="indexterm" href="igraph-Structural.html#igraph_global_efficiency">igraph_global_efficiency — Calculates the global efficiency of a network.</a>
|
||
</dt>
|
||
<dt id="ientry-id62291">gomory_hu_tree, <a class="indexterm" href="igraph-Flows.html#igraph_gomory_hu_tree">igraph_gomory_hu_tree — Gomory-Hu tree of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id66103">graphlets, <a class="indexterm" href="igraph-Graphlets.html#igraph_graphlets">igraph_graphlets — Calculate graphlets basis and project the graph on it.</a>
|
||
</dt>
|
||
<dt id="ientry-id66160">graphlets_candidate_basis, <a class="indexterm" href="igraph-Graphlets.html#igraph_graphlets_candidate_basis">igraph_graphlets_candidate_basis — Calculate a candidate graphlets basis</a>
|
||
</dt>
|
||
<dt id="ientry-id66208">graphlets_project, <a class="indexterm" href="igraph-Graphlets.html#igraph_graphlets_project">igraph_graphlets_project — Project a graph on a graphlets basis.</a>
|
||
</dt>
|
||
<dt id="ientry-id43969">graph_center, <a class="indexterm" href="igraph-Structural.html#igraph_graph_center">igraph_graph_center — Central vertices of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id60819">graph_count, <a class="indexterm" href="igraph-Isomorphism.html#igraph_graph_count">igraph_graph_count — The number of unlabelled graphs on the given number of vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id39324">graph_power, <a class="indexterm" href="igraph-Operators.html#igraph_graph_power">igraph_graph_power — The k-th power of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id36144">grg_game, <a class="indexterm" href="igraph-Games.html#igraph_grg_game">igraph_grg_game — Generates a geometric random graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id34749">growing_random_game, <a class="indexterm" href="igraph-Games.html#igraph_growing_random_game">igraph_growing_random_game — Generates a growing random graph.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>H</h3>
|
||
<dl>
|
||
<dt id="ientry-id47026">harmonic_centrality, <a class="indexterm" href="igraph-Structural.html#igraph_harmonic_centrality">igraph_harmonic_centrality — Harmonic centrality for some vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id48297">harmonic_centrality_cutoff, <a class="indexterm" href="igraph-Structural.html#igraph_harmonic_centrality_cutoff">igraph_harmonic_centrality_cutoff — Range limited harmonic centrality.</a>
|
||
</dt>
|
||
<dt id="ientry-id52306">has_loop, <a class="indexterm" href="igraph-Structural.html#igraph_has_loop">igraph_has_loop — Returns whether the graph has at least one loop edge.</a>
|
||
</dt>
|
||
<dt id="ientry-id52562">has_multiple, <a class="indexterm" href="igraph-Structural.html#igraph_has_multiple">igraph_has_multiple — Check whether the graph has at least one multiple edge.</a>
|
||
</dt>
|
||
<dt id="ientry-id54694">has_mutual, <a class="indexterm" href="igraph-Structural.html#igraph_has_mutual">igraph_has_mutual — Check whether a directed graph has any mutual edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id17555">heap_clear, <a class="indexterm" href="igraph-Data-structures.html#igraph_heap_clear">igraph_heap_clear — Removes all elements from a heap.</a>
|
||
</dt>
|
||
<dt id="ientry-id17670">heap_delete_top, <a class="indexterm" href="igraph-Data-structures.html#igraph_heap_delete_top">igraph_heap_delete_top — Removes and returns the top element.</a>
|
||
</dt>
|
||
<dt id="ientry-id17536">heap_destroy, <a class="indexterm" href="igraph-Data-structures.html#igraph_heap_destroy">igraph_heap_destroy — Destroys an initialized heap object.</a>
|
||
</dt>
|
||
<dt id="ientry-id17576">heap_empty, <a class="indexterm" href="igraph-Data-structures.html#igraph_heap_empty">igraph_heap_empty — Decides whether a heap object is empty.</a>
|
||
</dt>
|
||
<dt id="ientry-id17460">heap_init, <a class="indexterm" href="igraph-Data-structures.html#igraph_heap_init">igraph_heap_init — Initializes an empty heap object.</a>
|
||
</dt>
|
||
<dt id="ientry-id17496">heap_init_array, <a class="indexterm" href="igraph-Data-structures.html#igraph_heap_init_array">igraph_heap_init_array — Build a heap from an array.</a>
|
||
</dt>
|
||
<dt id="ientry-id17607">heap_push, <a class="indexterm" href="igraph-Data-structures.html#igraph_heap_push">igraph_heap_push — Add an element.</a>
|
||
</dt>
|
||
<dt id="ientry-id17728">heap_reserve, <a class="indexterm" href="igraph-Data-structures.html#igraph_heap_reserve">igraph_heap_reserve — Reserves memory for a heap.</a>
|
||
</dt>
|
||
<dt id="ientry-id17699">heap_size, <a class="indexterm" href="igraph-Data-structures.html#igraph_heap_size">igraph_heap_size — Number of elements in the heap.</a>
|
||
</dt>
|
||
<dt id="ientry-id17641">heap_top, <a class="indexterm" href="igraph-Data-structures.html#igraph_heap_top">igraph_heap_top — Top element.</a>
|
||
</dt>
|
||
<dt id="ientry-id30918">hexagonal_lattice, <a class="indexterm" href="igraph-Generators.html#igraph_hexagonal_lattice">igraph_hexagonal_lattice — A hexagonal lattice with the given shape.</a>
|
||
</dt>
|
||
<dt id="ientry-id66505">hrg_consensus, <a class="indexterm" href="igraph-HRG.html#igraph_hrg_consensus">igraph_hrg_consensus — Calculate a consensus tree for a HRG.</a>
|
||
</dt>
|
||
<dt id="ientry-id66682">hrg_create, <a class="indexterm" href="igraph-HRG.html#igraph_hrg_create">igraph_hrg_create — Create a HRG from an igraph graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id66788">hrg_dendrogram, <a class="indexterm" href="igraph-HRG.html#igraph_hrg_dendrogram">igraph_hrg_dendrogram — Create a dendrogram from a hierarchical random graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id66372">hrg_destroy, <a class="indexterm" href="igraph-HRG.html#igraph_hrg_destroy">igraph_hrg_destroy — Deallocate memory for an HRG.</a>
|
||
</dt>
|
||
<dt id="ientry-id66460">hrg_fit, <a class="indexterm" href="igraph-HRG.html#igraph_hrg_fit">igraph_hrg_fit — Fit a hierarchical random graph model to a network.</a>
|
||
</dt>
|
||
<dt id="ientry-id66600">hrg_game, <a class="indexterm" href="igraph-HRG.html#igraph_hrg_game">igraph_hrg_game — Generate a hierarchical random graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id66336">hrg_init, <a class="indexterm" href="igraph-HRG.html#igraph_hrg_init">igraph_hrg_init — Allocate memory for a HRG.</a>
|
||
</dt>
|
||
<dt id="ientry-id66725">hrg_predict, <a class="indexterm" href="igraph-HRG.html#igraph_hrg_predict">igraph_hrg_predict — Predict missing edges in a graph, based on HRG models.</a>
|
||
</dt>
|
||
<dt id="ientry-id66422">hrg_resize, <a class="indexterm" href="igraph-HRG.html#igraph_hrg_resize">igraph_hrg_resize — Resize a HRG.</a>
|
||
</dt>
|
||
<dt id="ientry-id66566">hrg_sample, <a class="indexterm" href="igraph-HRG.html#igraph_hrg_sample">igraph_hrg_sample — Sample from a hierarchical random graph model.</a>
|
||
</dt>
|
||
<dt id="ientry-id66393">hrg_size, <a class="indexterm" href="igraph-HRG.html#igraph_hrg_size">igraph_hrg_size — Returns the size of the HRG, the number of leaf nodes.</a>
|
||
</dt>
|
||
<dt id="ientry-id66294">hrg_t, <a class="indexterm" href="igraph-HRG.html#igraph_hrg_t">igraph_hrg_t — Data structure to store a hierarchical random graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id33614">hsbm_game, <a class="indexterm" href="igraph-Games.html#igraph_hsbm_game">igraph_hsbm_game — Hierarchical stochastic block model.</a>
|
||
</dt>
|
||
<dt id="ientry-id33683">hsbm_list_game, <a class="indexterm" href="igraph-Games.html#igraph_hsbm_list_game">igraph_hsbm_list_game — Hierarchical stochastic block model, more general version.</a>
|
||
</dt>
|
||
<dt id="ientry-id48029">hub_and_authority_scores, <a class="indexterm" href="igraph-Structural.html#igraph_hub_and_authority_scores">igraph_hub_and_authority_scores — Kleinberg's hub and authority scores (HITS).</a>
|
||
</dt>
|
||
<dt id="ientry-id30700">hypercube, <a class="indexterm" href="igraph-Generators.html#igraph_hypercube">igraph_hypercube — The n-dimensional hypercube graph.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>I</h3>
|
||
<dl>
|
||
<dt id="ientry-id33460">iea_game, <a class="indexterm" href="igraph-Games.html#igraph_iea_game">igraph_iea_game — Generates a random multigraph through independent edge assignment.</a>
|
||
</dt>
|
||
<dt id="ientry-id2102">igraph_bool_t, <a class="indexterm" href="igraph-Basic.html#basic-data-types">Atomic data types</a>
|
||
</dt>
|
||
<dt id="ientry-id2108">IGRAPH_INTEGER_MAX, <a class="indexterm" href="igraph-Basic.html#basic-data-types">Atomic data types</a>
|
||
</dt>
|
||
<dt id="ientry-id2110">IGRAPH_INTEGER_MIN, <a class="indexterm" href="igraph-Basic.html#basic-data-types">Atomic data types</a>
|
||
</dt>
|
||
<dt id="ientry-id2063">igraph_int_t, <a class="indexterm" href="igraph-Basic.html#basic-data-types">Atomic data types</a>
|
||
</dt>
|
||
<dt id="ientry-id2095">igraph_real_t, <a class="indexterm" href="igraph-Basic.html#basic-data-types">Atomic data types</a>
|
||
</dt>
|
||
<dt id="ientry-id2112">IGRAPH_UINT_MAX, <a class="indexterm" href="igraph-Basic.html#basic-data-types">Atomic data types</a>
|
||
</dt>
|
||
<dt id="ientry-id2114">IGRAPH_UINT_MIN, <a class="indexterm" href="igraph-Basic.html#basic-data-types">Atomic data types</a>
|
||
</dt>
|
||
<dt id="ientry-id2085">igraph_uint_t, <a class="indexterm" href="igraph-Basic.html#basic-data-types">Atomic data types</a>
|
||
</dt>
|
||
<dt id="ientry-id3290">incident, <a class="indexterm" href="igraph-Basic.html#igraph_incident">igraph_incident — Gives the incident edges of a vertex.</a>
|
||
</dt>
|
||
<dt id="ientry-id20404">inclist_clear, <a class="indexterm" href="igraph-Data-structures.html#igraph_inclist_clear">igraph_inclist_clear — Removes all edges from an incidence list.</a>
|
||
</dt>
|
||
<dt id="ientry-id20321">inclist_destroy, <a class="indexterm" href="igraph-Data-structures.html#igraph_inclist_destroy">igraph_inclist_destroy — Frees all memory allocated for an incidence list.</a>
|
||
</dt>
|
||
<dt id="ientry-id20340">inclist_get, <a class="indexterm" href="igraph-Data-structures.html#igraph_inclist_get">igraph_inclist_get — Query a vector in an incidence list.</a>
|
||
</dt>
|
||
<dt id="ientry-id20251">inclist_init, <a class="indexterm" href="igraph-Data-structures.html#igraph_inclist_init">igraph_inclist_init — Initializes an incidence list.</a>
|
||
</dt>
|
||
<dt id="ientry-id20375">inclist_size, <a class="indexterm" href="igraph-Data-structures.html#igraph_inclist_size">igraph_inclist_size — Returns the number of vertices in an incidence list.</a>
|
||
</dt>
|
||
<dt id="ientry-id57887">independence_number, <a class="indexterm" href="igraph-Cliques.html#igraph_independence_number">igraph_independence_number — Finds the independence number of the graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id57637">independent_vertex_sets, <a class="indexterm" href="igraph-Cliques.html#igraph_independent_vertex_sets">igraph_independent_vertex_sets — Finds all independent vertex sets in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id39629">induced_subgraph, <a class="indexterm" href="igraph-Operators.html#igraph_induced_subgraph">igraph_induced_subgraph — Creates a subgraph induced by the specified vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id39790">induced_subgraph_edges, <a class="indexterm" href="igraph-Operators.html#igraph_induced_subgraph_edges">igraph_induced_subgraph_edges — The edges contained within an induced sugraph.</a>
|
||
</dt>
|
||
<dt id="ientry-id39698">induced_subgraph_map, <a class="indexterm" href="igraph-Operators.html#igraph_induced_subgraph_map">igraph_induced_subgraph_map — Creates an induced subraph and returns the mapping from the original.</a>
|
||
</dt>
|
||
<dt id="ientry-id38312">intersection, <a class="indexterm" href="igraph-Operators.html#igraph_intersection">igraph_intersection — Collect the common edges from two graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id38519">intersection_many, <a class="indexterm" href="igraph-Operators.html#igraph_intersection_many">igraph_intersection_many — The intersection of more than two graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id4158">invalidate_cache, <a class="indexterm" href="igraph-Basic.html#igraph_invalidate_cache">igraph_invalidate_cache — Invalidates the internal cache of an igraph graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id60879">invert_permutation, <a class="indexterm" href="igraph-Isomorphism.html#igraph_invert_permutation">igraph_invert_permutation — Inverts a permutation.</a>
|
||
</dt>
|
||
<dt id="ientry-id60632">isoclass, <a class="indexterm" href="igraph-Isomorphism.html#igraph_isoclass">igraph_isoclass — Determine the isomorphism class of small graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id60753">isoclass_create, <a class="indexterm" href="igraph-Isomorphism.html#igraph_isoclass_create">igraph_isoclass_create — Creates a graph from the given isomorphism class.</a>
|
||
</dt>
|
||
<dt id="ientry-id60694">isoclass_subgraph, <a class="indexterm" href="igraph-Isomorphism.html#igraph_isoclass_subgraph">igraph_isoclass_subgraph — The isomorphism class of a subgraph of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id60029">isocompat_t, <a class="indexterm" href="igraph-Isomorphism.html#igraph_isocompat_t">igraph_isocompat_t — Callback type, called to check whether two vertices or edges are compatible</a>
|
||
</dt>
|
||
<dt id="ientry-id59984">isohandler_t, <a class="indexterm" href="igraph-Isomorphism.html#igraph_isohandler_t">igraph_isohandler_t — Callback type, called when an isomorphism was found</a>
|
||
</dt>
|
||
<dt id="ientry-id58831">isomorphic, <a class="indexterm" href="igraph-Isomorphism.html#igraph_isomorphic">igraph_isomorphic — Are two graphs isomorphic?</a>
|
||
</dt>
|
||
<dt id="ientry-id59206">isomorphic_bliss, <a class="indexterm" href="igraph-Isomorphism.html#igraph_isomorphic_bliss">igraph_isomorphic_bliss — Graph isomorphism via Bliss.</a>
|
||
</dt>
|
||
<dt id="ientry-id59478">isomorphic_vf2, <a class="indexterm" href="igraph-Isomorphism.html#igraph_isomorphic_vf2">igraph_isomorphic_vf2 — Isomorphism via VF2.</a>
|
||
</dt>
|
||
<dt id="ientry-id55503">is_acyclic, <a class="indexterm" href="igraph-Cycles.html#igraph_is_acyclic">igraph_is_acyclic — Checks whether a graph is acyclic or not.</a>
|
||
</dt>
|
||
<dt id="ientry-id46450">is_biconnected, <a class="indexterm" href="igraph-Structural.html#igraph_is_biconnected">igraph_is_biconnected — Checks whether a graph is biconnected.</a>
|
||
</dt>
|
||
<dt id="ientry-id46821">is_bigraphical, <a class="indexterm" href="igraph-Structural.html#igraph_is_bigraphical">igraph_is_bigraphical — Is there a bipartite graph with the given bi-degree-sequence?</a>
|
||
</dt>
|
||
<dt id="ientry-id37348">is_bipartite, <a class="indexterm" href="igraph-Bipartite.html#igraph_is_bipartite">igraph_is_bipartite — Check whether a graph is bipartite.</a>
|
||
</dt>
|
||
<dt id="ientry-id61205">is_bipartite_coloring, <a class="indexterm" href="igraph-Coloring.html#igraph_is_bipartite_coloring">igraph_is_bipartite_coloring — Checks whether a bipartite vertex coloring is valid.</a>
|
||
</dt>
|
||
<dt id="ientry-id53979">is_chordal, <a class="indexterm" href="igraph-Structural.html#igraph_is_chordal">igraph_is_chordal — Decides whether a graph is chordal.</a>
|
||
</dt>
|
||
<dt id="ientry-id56346">is_clique, <a class="indexterm" href="igraph-Cliques.html#igraph_is_clique">igraph_is_clique — Does a set of vertices form a clique?</a>
|
||
</dt>
|
||
<dt id="ientry-id56311">is_complete, <a class="indexterm" href="igraph-Cliques.html#igraph_is_complete">igraph_is_complete — Decides whether the graph is complete.</a>
|
||
</dt>
|
||
<dt id="ientry-id45849">is_connected, <a class="indexterm" href="igraph-Structural.html#igraph_is_connected">igraph_is_connected — Decides whether the graph is (weakly or strongly) connected.</a>
|
||
</dt>
|
||
<dt id="ientry-id55453">is_dag, <a class="indexterm" href="igraph-Cycles.html#igraph_is_dag">igraph_is_dag — Checks whether a graph is a directed acyclic graph (DAG).</a>
|
||
</dt>
|
||
<dt id="ientry-id2499">is_directed, <a class="indexterm" href="igraph-Basic.html#igraph_is_directed">igraph_is_directed — Is this a directed graph?</a>
|
||
</dt>
|
||
<dt id="ientry-id61263">is_edge_coloring, <a class="indexterm" href="igraph-Coloring.html#igraph_is_edge_coloring">igraph_is_edge_coloring — Checks whether an edge coloring is valid.</a>
|
||
</dt>
|
||
<dt id="ientry-id56011">is_eulerian, <a class="indexterm" href="igraph-Cycles.html#igraph_is_eulerian">igraph_is_eulerian — Checks whether an Eulerian path or cycle exists.</a>
|
||
</dt>
|
||
<dt id="ientry-id51165">is_forest, <a class="indexterm" href="igraph-Structural.html#igraph_is_forest">igraph_is_forest — Decides whether the graph is a forest.</a>
|
||
</dt>
|
||
<dt id="ientry-id46724">is_graphical, <a class="indexterm" href="igraph-Structural.html#igraph_is_graphical">igraph_is_graphical — Is there a graph with the given degree sequence?</a>
|
||
</dt>
|
||
<dt id="ientry-id57580">is_independent_vertex_set, <a class="indexterm" href="igraph-Cliques.html#igraph_is_independent_vertex_set">igraph_is_independent_vertex_set — Does a set of vertices form an independent set?</a>
|
||
</dt>
|
||
<dt id="ientry-id52215">is_loop, <a class="indexterm" href="igraph-Structural.html#igraph_is_loop">igraph_is_loop — Find the loop edges in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id54060">is_matching, <a class="indexterm" href="igraph-Structural.html#igraph_is_matching">igraph_is_matching — Checks whether the given matching is valid for the given graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id54144">is_maximal_matching, <a class="indexterm" href="igraph-Structural.html#igraph_is_maximal_matching">igraph_is_maximal_matching — Checks whether a matching in a graph is maximal.</a>
|
||
</dt>
|
||
<dt id="ientry-id63096">is_minimal_separator, <a class="indexterm" href="igraph-Separators.html#igraph_is_minimal_separator">igraph_is_minimal_separator — Decides whether a set of vertices is a minimal separator.</a>
|
||
</dt>
|
||
<dt id="ientry-id52464">is_multiple, <a class="indexterm" href="igraph-Structural.html#igraph_is_multiple">igraph_is_multiple — Find the multiple edges in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id54645">is_mutual, <a class="indexterm" href="igraph-Structural.html#igraph_is_mutual">igraph_is_mutual — Check whether some edges of a directed graph are mutual.</a>
|
||
</dt>
|
||
<dt id="ientry-id61302">is_perfect, <a class="indexterm" href="igraph-Coloring.html#igraph_is_perfect">igraph_is_perfect — Checks if the graph is perfect.</a>
|
||
</dt>
|
||
<dt id="ientry-id4183">is_same_graph, <a class="indexterm" href="igraph-Basic.html#igraph_is_same_graph">igraph_is_same_graph — Are two graphs identical as labelled graphs?</a>
|
||
</dt>
|
||
<dt id="ientry-id62969">is_separator, <a class="indexterm" href="igraph-Separators.html#igraph_is_separator">igraph_is_separator — Would removing this set of vertices disconnect the graph?</a>
|
||
</dt>
|
||
<dt id="ientry-id52156">is_simple, <a class="indexterm" href="igraph-Structural.html#igraph_is_simple">igraph_is_simple — Decides whether the input graph is a simple graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id51068">is_tree, <a class="indexterm" href="igraph-Structural.html#igraph_is_tree">igraph_is_tree — Decides whether the graph is a tree.</a>
|
||
</dt>
|
||
<dt id="ientry-id61132">is_vertex_coloring, <a class="indexterm" href="igraph-Coloring.html#igraph_is_vertex_coloring">igraph_is_vertex_coloring — Checks whether a vertex coloring is valid.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>J</h3>
|
||
<dl>
|
||
<dt id="ientry-id38103">join, <a class="indexterm" href="igraph-Operators.html#igraph_join">igraph_join — Creates the join of two disjoint graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id53501">joint_degree_distribution, <a class="indexterm" href="igraph-Structural.html#igraph_joint_degree_distribution">igraph_joint_degree_distribution — The joint degree distribution of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id53647">joint_degree_matrix, <a class="indexterm" href="igraph-Structural.html#igraph_joint_degree_matrix">igraph_joint_degree_matrix — The joint degree matrix of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id53393">joint_type_distribution, <a class="indexterm" href="igraph-Structural.html#igraph_joint_type_distribution">igraph_joint_type_distribution — Mixing matrix for vertex categories.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>K</h3>
|
||
<dl>
|
||
<dt id="ientry-id31500">kary_tree, <a class="indexterm" href="igraph-Generators.html#igraph_kary_tree">igraph_kary_tree — Creates a k-ary tree in which almost all vertices have k children.</a>
|
||
</dt>
|
||
<dt id="ientry-id32962">kautz, <a class="indexterm" href="igraph-Generators.html#igraph_kautz">igraph_kautz — Generate a Kautz graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id35443">k_regular_game, <a class="indexterm" href="igraph-Games.html#igraph_k_regular_game">igraph_k_regular_game — Generates a random graph where each vertex has the same degree.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>L</h3>
|
||
<dl>
|
||
<dt id="ientry-id72189">lapack_dgeev, <a class="indexterm" href="igraph-Linalg.html#igraph_lapack_dgeev">igraph_lapack_dgeev — Eigenvalues and optionally eigenvectors of a non-symmetric matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id72301">lapack_dgeevx, <a class="indexterm" href="igraph-Linalg.html#igraph_lapack_dgeevx">igraph_lapack_dgeevx — Eigenvalues/vectors of nonsymmetric matrices, expert mode.</a>
|
||
</dt>
|
||
<dt id="ientry-id71805">lapack_dgesv, <a class="indexterm" href="igraph-Linalg.html#igraph_lapack_dgesv">igraph_lapack_dgesv — Solve system of linear equations with LU factorization.</a>
|
||
</dt>
|
||
<dt id="ientry-id71714">lapack_dgetrf, <a class="indexterm" href="igraph-Linalg.html#igraph_lapack_dgetrf">igraph_lapack_dgetrf — LU factorization of a general M-by-N matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id71755">lapack_dgetrs, <a class="indexterm" href="igraph-Linalg.html#igraph_lapack_dgetrs">igraph_lapack_dgetrs — Solve general system of linear equations using LU factorization.</a>
|
||
</dt>
|
||
<dt id="ientry-id72026">lapack_dsyevr, <a class="indexterm" href="igraph-Linalg.html#igraph_lapack_dsyevr">igraph_lapack_dsyevr — Selected eigenvalues and optionally eigenvectors of a symmetric matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id52110">laplacian_normalization_t, <a class="indexterm" href="igraph-Structural.html#igraph_laplacian_normalization_t">igraph_laplacian_normalization_t — Normalization methods for a Laplacian matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id66934">laplacian_spectral_embedding, <a class="indexterm" href="igraph-Embedding.html#igraph_laplacian_spectral_embedding">igraph_laplacian_spectral_embedding — Spectral embedding of the Laplacian of a graph</a>
|
||
</dt>
|
||
<dt id="ientry-id56768">largest_cliques, <a class="indexterm" href="igraph-Cliques.html#igraph_largest_cliques">igraph_largest_cliques — Finds the largest clique(s) in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id57766">largest_independent_vertex_sets, <a class="indexterm" href="igraph-Cliques.html#igraph_largest_independent_vertex_sets">igraph_largest_independent_vertex_sets — Finds the largest independent vertex set(s) in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id57459">largest_weighted_cliques, <a class="indexterm" href="igraph-Cliques.html#igraph_largest_weighted_cliques">igraph_largest_weighted_cliques — Finds the largest weight clique(s) in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id34664">lastcit_game, <a class="indexterm" href="igraph-Games.html#igraph_lastcit_game">igraph_lastcit_game — Simulates a citation network, based on time passed since the last citation.</a>
|
||
</dt>
|
||
<dt id="ientry-id69186">layout_align, <a class="indexterm" href="igraph-Layout.html#igraph_layout_align">igraph_layout_align — Aligns a graph layout with the coordinate axes.</a>
|
||
</dt>
|
||
<dt id="ientry-id67366">layout_bipartite, <a class="indexterm" href="igraph-Layout.html#igraph_layout_bipartite">igraph_layout_bipartite — Simple layout for bipartite graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id67152">layout_circle, <a class="indexterm" href="igraph-Layout.html#igraph_layout_circle">igraph_layout_circle — Places the vertices uniformly on a circle in arbitrary order.</a>
|
||
</dt>
|
||
<dt id="ientry-id68045">layout_davidson_harel, <a class="indexterm" href="igraph-Layout.html#igraph_layout_davidson_harel">igraph_layout_davidson_harel — Davidson-Harel layout algorithm.</a>
|
||
</dt>
|
||
<dt id="ientry-id67661">layout_drl, <a class="indexterm" href="igraph-Layout.html#igraph_layout_drl">igraph_layout_drl — The DrL layout generator</a>
|
||
</dt>
|
||
<dt id="ientry-id67711">layout_drl_3d, <a class="indexterm" href="igraph-Layout.html#igraph_layout_drl_3d">igraph_layout_drl_3d — The DrL layout generator, 3d version.</a>
|
||
</dt>
|
||
<dt id="ientry-id67584">layout_drl_default_t, <a class="indexterm" href="igraph-Layout.html#igraph_layout_drl_default_t">igraph_layout_drl_default_t — Predefined parameter templates for the DrL layout generator</a>
|
||
</dt>
|
||
<dt id="ientry-id67622">layout_drl_options_init, <a class="indexterm" href="igraph-Layout.html#igraph_layout_drl_options_init">igraph_layout_drl_options_init — Initialize parameters for the DrL layout generator</a>
|
||
</dt>
|
||
<dt id="ientry-id67445">layout_drl_options_t, <a class="indexterm" href="igraph-Layout.html#igraph_layout_drl_options_t">igraph_layout_drl_options_t — Parameters for the DrL layout generator</a>
|
||
</dt>
|
||
<dt id="ientry-id67774">layout_fruchterman_reingold, <a class="indexterm" href="igraph-Layout.html#igraph_layout_fruchterman_reingold">igraph_layout_fruchterman_reingold — Places the vertices on a plane according to the Fruchterman-Reingold algorithm.</a>
|
||
</dt>
|
||
<dt id="ientry-id68845">layout_fruchterman_reingold_3d, <a class="indexterm" href="igraph-Layout.html#igraph_layout_fruchterman_reingold_3d">igraph_layout_fruchterman_reingold_3d — 3D Fruchterman-Reingold algorithm.</a>
|
||
</dt>
|
||
<dt id="ientry-id67983">layout_gem, <a class="indexterm" href="igraph-Layout.html#igraph_layout_gem">igraph_layout_gem — Layout graph according to GEM algorithm.</a>
|
||
</dt>
|
||
<dt id="ientry-id67288">layout_graphopt, <a class="indexterm" href="igraph-Layout.html#igraph_layout_graphopt">igraph_layout_graphopt — Optimizes vertex layout via the graphopt algorithm.</a>
|
||
</dt>
|
||
<dt id="ientry-id67249">layout_grid, <a class="indexterm" href="igraph-Layout.html#igraph_layout_grid">igraph_layout_grid — Places the vertices on a regular grid on the plane.</a>
|
||
</dt>
|
||
<dt id="ientry-id68801">layout_grid_3d, <a class="indexterm" href="igraph-Layout.html#igraph_layout_grid_3d">igraph_layout_grid_3d — Places the vertices on a regular grid in the 3D space.</a>
|
||
</dt>
|
||
<dt id="ientry-id67884">layout_kamada_kawai, <a class="indexterm" href="igraph-Layout.html#igraph_layout_kamada_kawai">igraph_layout_kamada_kawai — Places the vertices on a plane according to the Kamada-Kawai algorithm.</a>
|
||
</dt>
|
||
<dt id="ientry-id68949">layout_kamada_kawai_3d, <a class="indexterm" href="igraph-Layout.html#igraph_layout_kamada_kawai_3d">igraph_layout_kamada_kawai_3d — 3D version of the Kamada-Kawai layout generator.</a>
|
||
</dt>
|
||
<dt id="ientry-id68183">layout_lgl, <a class="indexterm" href="igraph-Layout.html#igraph_layout_lgl">igraph_layout_lgl — Force based layout algorithm for large graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id68132">layout_mds, <a class="indexterm" href="igraph-Layout.html#igraph_layout_mds">igraph_layout_mds — Place the vertices on a plane using multidimensional scaling.</a>
|
||
</dt>
|
||
<dt id="ientry-id69145">layout_merge_dla, <a class="indexterm" href="igraph-Layout.html#igraph_layout_merge_dla">igraph_layout_merge_dla — Merges multiple layouts by using a DLA algorithm.</a>
|
||
</dt>
|
||
<dt id="ientry-id67118">layout_random, <a class="indexterm" href="igraph-Layout.html#igraph_layout_random">igraph_layout_random — Places the vertices uniformly randomly within a square.</a>
|
||
</dt>
|
||
<dt id="ientry-id68727">layout_random_3d, <a class="indexterm" href="igraph-Layout.html#igraph_layout_random_3d">igraph_layout_random_3d — Places the vertices uniformly randomly in a cube.</a>
|
||
</dt>
|
||
<dt id="ientry-id68260">layout_reingold_tilford, <a class="indexterm" href="igraph-Layout.html#igraph_layout_reingold_tilford">igraph_layout_reingold_tilford — Reingold-Tilford layout for tree graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id68362">layout_reingold_tilford_circular, <a class="indexterm" href="igraph-Layout.html#igraph_layout_reingold_tilford_circular">igraph_layout_reingold_tilford_circular — Circular Reingold-Tilford layout for trees.</a>
|
||
</dt>
|
||
<dt id="ientry-id68762">layout_sphere, <a class="indexterm" href="igraph-Layout.html#igraph_layout_sphere">igraph_layout_sphere — Places vertices (more or less) uniformly on a sphere.</a>
|
||
</dt>
|
||
<dt id="ientry-id67193">layout_star, <a class="indexterm" href="igraph-Layout.html#igraph_layout_star">igraph_layout_star — Generates a star-like layout.</a>
|
||
</dt>
|
||
<dt id="ientry-id68492">layout_sugiyama, <a class="indexterm" href="igraph-Layout.html#igraph_layout_sugiyama">igraph_layout_sugiyama — Sugiyama layout algorithm for layered directed acyclic graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id68563">layout_umap, <a class="indexterm" href="igraph-Layout.html#igraph_layout_umap">igraph_layout_umap — Layout using Uniform Manifold Approximation and Projection (UMAP).</a>
|
||
</dt>
|
||
<dt id="ientry-id69060">layout_umap_3d, <a class="indexterm" href="igraph-Layout.html#igraph_layout_umap_3d">igraph_layout_umap_3d — 3D layout using UMAP.</a>
|
||
</dt>
|
||
<dt id="ientry-id68651">layout_umap_compute_weights, <a class="indexterm" href="igraph-Layout.html#igraph_layout_umap_compute_weights">igraph_layout_umap_compute_weights — Compute weights for a UMAP layout starting from distances.</a>
|
||
</dt>
|
||
<dt id="ientry-id20631">lazy_adjlist_clear, <a class="indexterm" href="igraph-Data-structures.html#igraph_lazy_adjlist_clear">igraph_lazy_adjlist_clear — Removes all edges from a lazy adjacency list.</a>
|
||
</dt>
|
||
<dt id="ientry-id20504">lazy_adjlist_destroy, <a class="indexterm" href="igraph-Data-structures.html#igraph_lazy_adjlist_destroy">igraph_lazy_adjlist_destroy — Deallocate a lazt adjacency list.</a>
|
||
</dt>
|
||
<dt id="ientry-id20523">lazy_adjlist_get, <a class="indexterm" href="igraph-Data-structures.html#igraph_lazy_adjlist_get">igraph_lazy_adjlist_get — Query neighbor vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id20569">lazy_adjlist_has, <a class="indexterm" href="igraph-Data-structures.html#igraph_lazy_adjlist_has">igraph_lazy_adjlist_has — Are adjacenct vertices already stored in a lazy adjacency list?</a>
|
||
</dt>
|
||
<dt id="ientry-id20425">lazy_adjlist_init, <a class="indexterm" href="igraph-Data-structures.html#igraph_lazy_adjlist_init">igraph_lazy_adjlist_init — Initializes a lazy adjacency list.</a>
|
||
</dt>
|
||
<dt id="ientry-id20602">lazy_adjlist_size, <a class="indexterm" href="igraph-Data-structures.html#igraph_lazy_adjlist_size">igraph_lazy_adjlist_size — Returns the number of vertices in a lazy adjacency list.</a>
|
||
</dt>
|
||
<dt id="ientry-id20848">lazy_inclist_clear, <a class="indexterm" href="igraph-Data-structures.html#igraph_lazy_inclist_clear">igraph_lazy_inclist_clear — Removes all edges from a lazy incidence list.</a>
|
||
</dt>
|
||
<dt id="ientry-id20720">lazy_inclist_destroy, <a class="indexterm" href="igraph-Data-structures.html#igraph_lazy_inclist_destroy">igraph_lazy_inclist_destroy — Deallocates a lazy incidence list.</a>
|
||
</dt>
|
||
<dt id="ientry-id20739">lazy_inclist_get, <a class="indexterm" href="igraph-Data-structures.html#igraph_lazy_inclist_get">igraph_lazy_inclist_get — Query incident edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id20786">lazy_inclist_has, <a class="indexterm" href="igraph-Data-structures.html#igraph_lazy_inclist_has">igraph_lazy_inclist_has — Are incident edges already stored in a lazy inclist?</a>
|
||
</dt>
|
||
<dt id="ientry-id20652">lazy_inclist_init, <a class="indexterm" href="igraph-Data-structures.html#igraph_lazy_inclist_init">igraph_lazy_inclist_init — Initializes a lazy incidence list of edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id20819">lazy_inclist_size, <a class="indexterm" href="igraph-Data-structures.html#igraph_lazy_inclist_size">igraph_lazy_inclist_size — Returns the number of vertices in a lazy incidence list.</a>
|
||
</dt>
|
||
<dt id="ientry-id31204">lcf, <a class="indexterm" href="igraph-Generators.html#igraph_lcf">igraph_lcf — Creates a graph from LCF notation.</a>
|
||
</dt>
|
||
<dt id="ientry-id31263">lcf_small, <a class="indexterm" href="igraph-Generators.html#igraph_lcf_small">igraph_lcf_small — Shorthand to create a graph from LCF notation, giving shifts as the arguments.</a>
|
||
</dt>
|
||
<dt id="ientry-id64581">le_community_to_membership, <a class="indexterm" href="igraph-Community.html#igraph_le_community_to_membership">igraph_le_community_to_membership — Cut an incomplete dendrogram after a given number of merges, starting with an initial cluster assignment.</a>
|
||
</dt>
|
||
<dt id="ientry-id39833">linegraph, <a class="indexterm" href="igraph-Operators.html#igraph_linegraph">igraph_linegraph — Create the line graph of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id58257">list_triangles, <a class="indexterm" href="igraph-Motifs.html#igraph_list_triangles">igraph_list_triangles — Find all triangles in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id44739">local_efficiency, <a class="indexterm" href="igraph-Structural.html#igraph_local_efficiency">igraph_local_efficiency — Calculates the local efficiency around each vertex in a network.</a>
|
||
</dt>
|
||
<dt id="ientry-id45161">local_scan_0, <a class="indexterm" href="igraph-Structural.html#igraph_local_scan_0">igraph_local_scan_0 — Local scan-statistics, k=0</a>
|
||
</dt>
|
||
<dt id="ientry-id45315">local_scan_0_them, <a class="indexterm" href="igraph-Structural.html#igraph_local_scan_0_them">igraph_local_scan_0_them — Local THEM scan-statistics, k=0</a>
|
||
</dt>
|
||
<dt id="ientry-id45212">local_scan_1_ecount, <a class="indexterm" href="igraph-Structural.html#igraph_local_scan_1_ecount">igraph_local_scan_1_ecount — Local scan-statistics, k=1, edge count and sum of weights</a>
|
||
</dt>
|
||
<dt id="ientry-id45371">local_scan_1_ecount_them, <a class="indexterm" href="igraph-Structural.html#igraph_local_scan_1_ecount_them">igraph_local_scan_1_ecount_them — Local THEM scan-statistics, k=1, edge count and sum of weights</a>
|
||
</dt>
|
||
<dt id="ientry-id45259">local_scan_k_ecount, <a class="indexterm" href="igraph-Structural.html#igraph_local_scan_k_ecount">igraph_local_scan_k_ecount — Sum the number of edges or the weights in k-neighborhood of every vertex.</a>
|
||
</dt>
|
||
<dt id="ientry-id45430">local_scan_k_ecount_them, <a class="indexterm" href="igraph-Structural.html#igraph_local_scan_k_ecount_them">igraph_local_scan_k_ecount_them — Local THEM scan-statistics, edge count or sum of weights.</a>
|
||
</dt>
|
||
<dt id="ientry-id45503">local_scan_neighborhood_ecount, <a class="indexterm" href="igraph-Structural.html#igraph_local_scan_neighborhood_ecount">igraph_local_scan_neighborhood_ecount — Local scan-statistics with pre-calculated neighborhoods</a>
|
||
</dt>
|
||
<dt id="ientry-id45553">local_scan_subset_ecount, <a class="indexterm" href="igraph-Structural.html#igraph_local_scan_subset_ecount">igraph_local_scan_subset_ecount — Local scan-statistics of subgraphs induced by subsets of vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id55111">loops_t, <a class="indexterm" href="igraph-Structural.html#igraph_loops_t">igraph_loops_t — How to interpret self-loops in undirected graphs?</a>
|
||
</dt>
|
||
<dt id="ientry-id37641">lune_beta_skeleton, <a class="indexterm" href="igraph-Spatial.html#igraph_lune_beta_skeleton">igraph_lune_beta_skeleton — The lune based β-skeleton of a spatial point set.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>M</h3>
|
||
<dl>
|
||
<dt id="ientry-id5484">malloc, <a class="indexterm" href="igraph-Memory.html#igraph_malloc">igraph_malloc — Allocates memory that can be safely deallocated by igraph functions.</a>
|
||
</dt>
|
||
<dt id="ientry-id10346">MATRIX, <a class="indexterm" href="igraph-Data-structures.html#MATRIX">MATRIX — Accessing an element of a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id11094">matrix_add, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_add">igraph_matrix_add — Add two matrices.</a>
|
||
</dt>
|
||
<dt id="ientry-id12423">matrix_add_cols, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_add_cols">igraph_matrix_add_cols — Adds columns to a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id11045">matrix_add_constant, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_add_constant">igraph_matrix_add_constant — Add a constant to every element.</a>
|
||
</dt>
|
||
<dt id="ientry-id12388">matrix_add_rows, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_add_rows">igraph_matrix_add_rows — Adds rows to a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id11437">matrix_all_almost_e, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_all_almost_e">igraph_matrix_all_almost_e — Are all elements almost equal?</a>
|
||
</dt>
|
||
<dt id="ientry-id11399">matrix_all_e, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_all_e">igraph_matrix_all_e — Are all elements equal?</a>
|
||
</dt>
|
||
<dt id="ientry-id11514">matrix_all_g, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_all_g">igraph_matrix_all_g — Are all elements greater?</a>
|
||
</dt>
|
||
<dt id="ientry-id11586">matrix_all_ge, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_all_ge">igraph_matrix_all_ge — Are all elements greater or equal?</a>
|
||
</dt>
|
||
<dt id="ientry-id11478">matrix_all_l, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_all_l">igraph_matrix_all_l — Are all elements less?</a>
|
||
</dt>
|
||
<dt id="ientry-id11550">matrix_all_le, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_all_le">igraph_matrix_all_le — Are all elements less or equal?</a>
|
||
</dt>
|
||
<dt id="ientry-id16580">matrix_as_sparsemat, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_as_sparsemat">igraph_matrix_as_sparsemat — Converts a dense matrix to a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id12045">matrix_capacity, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_capacity">igraph_matrix_capacity — Returns the number of elements allocated for a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id11712">matrix_cbind, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_cbind">igraph_matrix_cbind — Combine matrices columnwise.</a>
|
||
</dt>
|
||
<dt id="ientry-id11334">matrix_colsum, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_colsum">igraph_matrix_colsum — Columnwise sum.</a>
|
||
</dt>
|
||
<dt id="ientry-id12713">matrix_complex_all_almost_e, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_complex_all_almost_e">igraph_matrix_complex_all_almost_e — Are all elements almost equal?</a>
|
||
</dt>
|
||
<dt id="ientry-id12635">matrix_complex_create, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_complex_create">igraph_matrix_complex_create — Creates a complex matrix from a real and imaginary part.</a>
|
||
</dt>
|
||
<dt id="ientry-id12674">matrix_complex_create_polar, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_complex_create_polar">igraph_matrix_complex_create_polar — Creates a complex matrix from a magnitude and an angle.</a>
|
||
</dt>
|
||
<dt id="ientry-id12562">matrix_complex_imag, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_complex_imag">igraph_matrix_complex_imag — Gives the imaginary part of a complex matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id12528">matrix_complex_real, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_complex_real">igraph_matrix_complex_real — Gives the real part of a complex matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id12596">matrix_complex_realimag, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_complex_realimag">igraph_matrix_complex_realimag — Gives the real and imaginary parts of a complex matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id12754">matrix_complex_zapsmall, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_complex_zapsmall">igraph_matrix_complex_zapsmall — Replaces small elements of a complex matrix by exact zeros.</a>
|
||
</dt>
|
||
<dt id="ientry-id12219">matrix_contains, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_contains">igraph_matrix_contains — Search for an element.</a>
|
||
</dt>
|
||
<dt id="ientry-id10577">matrix_copy_to, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_copy_to">igraph_matrix_copy_to — Copies a matrix to a regular C array.</a>
|
||
</dt>
|
||
<dt id="ientry-id10279">matrix_destroy, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_destroy">igraph_matrix_destroy — Destroys a matrix object.</a>
|
||
</dt>
|
||
<dt id="ientry-id11205">matrix_div_elements, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_div_elements">igraph_matrix_div_elements — Elementwise division.</a>
|
||
</dt>
|
||
<dt id="ientry-id11953">matrix_empty, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_empty">igraph_matrix_empty — Is the matrix empty?</a>
|
||
</dt>
|
||
<dt id="ientry-id10320">matrix_fill, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_fill">igraph_matrix_fill — Fill with an element.</a>
|
||
</dt>
|
||
<dt id="ientry-id10374">matrix_get, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_get">igraph_matrix_get — Extract an element from a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id10722">matrix_get_col, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_get_col">igraph_matrix_get_col — Select a column.</a>
|
||
</dt>
|
||
<dt id="ientry-id10415">matrix_get_ptr, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_get_ptr">igraph_matrix_get_ptr — Pointer to an element of a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id10683">matrix_get_row, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_get_row">igraph_matrix_get_row — Extract a row.</a>
|
||
</dt>
|
||
<dt id="ientry-id10146">matrix_init, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_init">igraph_matrix_init — Initializes a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id10188">matrix_init_array, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_init_array">igraph_matrix_init_array — Initializes a matrix from an ordinary C array (constructor).</a>
|
||
</dt>
|
||
<dt id="ientry-id10243">matrix_init_copy, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_init_copy">igraph_matrix_init_copy — Copies a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id11984">matrix_isnull, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_isnull">igraph_matrix_isnull — Checks for a null matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id12150">matrix_is_symmetric, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_is_symmetric">igraph_matrix_is_symmetric — Is the matrix symmetric?</a>
|
||
</dt>
|
||
<dt id="ientry-id11781">matrix_max, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_max">igraph_matrix_max — Largest element of a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id12181">matrix_maxdifference, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_maxdifference">igraph_matrix_maxdifference — Maximum absolute difference between two matrices.</a>
|
||
</dt>
|
||
<dt id="ientry-id11751">matrix_min, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_min">igraph_matrix_min — Smallest element of a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id11875">matrix_minmax, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_minmax">igraph_matrix_minmax — Minimum and maximum elements of a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id11168">matrix_mul_elements, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_mul_elements">igraph_matrix_mul_elements — Elementwise matrix multiplication.</a>
|
||
</dt>
|
||
<dt id="ientry-id12121">matrix_ncol, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_ncol">igraph_matrix_ncol — The number of columns in a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id12092">matrix_nrow, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_nrow">igraph_matrix_nrow — The number of rows in a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id10301">matrix_null, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_null">igraph_matrix_null — Sets all elements in a matrix to zero.</a>
|
||
</dt>
|
||
<dt id="ientry-id11271">matrix_prod, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_prod">igraph_matrix_prod — Product of all matrix elements.</a>
|
||
</dt>
|
||
<dt id="ientry-id11675">matrix_rbind, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_rbind">igraph_matrix_rbind — Combine two matrices rowwise.</a>
|
||
</dt>
|
||
<dt id="ientry-id12492">matrix_remove_col, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_remove_col">igraph_matrix_remove_col — Removes a column from a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id12458">matrix_remove_row, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_remove_row">igraph_matrix_remove_row — Remove a row.</a>
|
||
</dt>
|
||
<dt id="ientry-id12317">matrix_resize, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_resize">igraph_matrix_resize — Resizes a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id12357">matrix_resize_min, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_resize_min">igraph_matrix_resize_min — Deallocates unused memory for a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id11300">matrix_rowsum, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_rowsum">igraph_matrix_rowsum — Rowwise sum.</a>
|
||
</dt>
|
||
<dt id="ientry-id11069">matrix_scale, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_scale">igraph_matrix_scale — Multiplies each element of the matrix by a constant.</a>
|
||
</dt>
|
||
<dt id="ientry-id12256">matrix_search, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_search">igraph_matrix_search — Search from a given position.</a>
|
||
</dt>
|
||
<dt id="ientry-id10960">matrix_select_cols, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_select_cols">igraph_matrix_select_cols — Select some columns of a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id10921">matrix_select_rows, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_select_rows">igraph_matrix_select_rows — Select some rows of a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id10999">matrix_select_rows_cols, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_select_rows_cols">igraph_matrix_select_rows_cols — Select some rows and columns of a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id10454">matrix_set, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_set">igraph_matrix_set — Set an element.</a>
|
||
</dt>
|
||
<dt id="ientry-id10802">matrix_set_col, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_set_col">igraph_matrix_set_col — Set a column from a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id10761">matrix_set_row, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_set_row">igraph_matrix_set_row — Set a row from a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id12016">matrix_size, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_size">igraph_matrix_size — The number of elements in a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id11131">matrix_sub, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_sub">igraph_matrix_sub — Difference of two matrices.</a>
|
||
</dt>
|
||
<dt id="ientry-id11242">matrix_sum, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_sum">igraph_matrix_sum — Sum of elements.</a>
|
||
</dt>
|
||
<dt id="ientry-id10657">matrix_swap, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_swap">igraph_matrix_swap — Swap two matrices.</a>
|
||
</dt>
|
||
<dt id="ientry-id10882">matrix_swap_cols, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_swap_cols">igraph_matrix_swap_cols — Swap two columns.</a>
|
||
</dt>
|
||
<dt id="ientry-id10843">matrix_swap_rows, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_swap_rows">igraph_matrix_swap_rows — Swap two rows.</a>
|
||
</dt>
|
||
<dt id="ientry-id11368">matrix_transpose, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_transpose">igraph_matrix_transpose — Transpose of a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id10620">matrix_update, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_update">igraph_matrix_update — Update from another matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id10490">matrix_view, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_view">igraph_matrix_view — Creates a matrix view into an existing array.</a>
|
||
</dt>
|
||
<dt id="ientry-id10534">matrix_view_from_vector, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_view_from_vector">igraph_matrix_view_from_vector — Creates a matrix view that treats an existing vector as a matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id11844">matrix_which_max, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_which_max">igraph_matrix_which_max — Indices of the largest element.</a>
|
||
</dt>
|
||
<dt id="ientry-id11813">matrix_which_min, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_which_min">igraph_matrix_which_min — Indices of the smallest element.</a>
|
||
</dt>
|
||
<dt id="ientry-id11906">matrix_which_minmax, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_which_minmax">igraph_matrix_which_minmax — Indices of the minimum and maximum elements.</a>
|
||
</dt>
|
||
<dt id="ientry-id11622">matrix_zapsmall, <a class="indexterm" href="igraph-Data-structures.html#igraph_matrix_zapsmall">igraph_matrix_zapsmall — Replaces small elements of a matrix by exact zeros.</a>
|
||
</dt>
|
||
<dt id="ientry-id47733">maxdegree, <a class="indexterm" href="igraph-Structural.html#igraph_maxdegree">igraph_maxdegree — The maximum degree in a graph (or set of vertices).</a>
|
||
</dt>
|
||
<dt id="ientry-id61341">maxflow, <a class="indexterm" href="igraph-Flows.html#igraph_maxflow">igraph_maxflow — Maximum network flow between a pair of vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id61743">maxflow_stats_t, <a class="indexterm" href="igraph-Flows.html#igraph_maxflow_stats_t">igraph_maxflow_stats_t — Data structure holding statistics from the push-relabel maximum flow solver.</a>
|
||
</dt>
|
||
<dt id="ientry-id61566">maxflow_value, <a class="indexterm" href="igraph-Flows.html#igraph_maxflow_value">igraph_maxflow_value — Maximum flow in a network with the push/relabel algorithm.</a>
|
||
</dt>
|
||
<dt id="ientry-id56822">maximal_cliques, <a class="indexterm" href="igraph-Cliques.html#igraph_maximal_cliques">igraph_maximal_cliques — Finds all maximal cliques in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id57253">maximal_cliques_callback, <a class="indexterm" href="igraph-Cliques.html#igraph_maximal_cliques_callback">igraph_maximal_cliques_callback — Finds maximal cliques in a graph and calls a function for each one.</a>
|
||
</dt>
|
||
<dt id="ientry-id56941">maximal_cliques_count, <a class="indexterm" href="igraph-Cliques.html#igraph_maximal_cliques_count">igraph_maximal_cliques_count — Count the number of maximal cliques in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id57045">maximal_cliques_file, <a class="indexterm" href="igraph-Cliques.html#igraph_maximal_cliques_file">igraph_maximal_cliques_file — Find maximal cliques and write them to a file.</a>
|
||
</dt>
|
||
<dt id="ientry-id57194">maximal_cliques_hist, <a class="indexterm" href="igraph-Cliques.html#igraph_maximal_cliques_hist">igraph_maximal_cliques_hist — Counts the number of maximal cliques of each size in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id57110">maximal_cliques_subset, <a class="indexterm" href="igraph-Cliques.html#igraph_maximal_cliques_subset">igraph_maximal_cliques_subset — Maximal cliques for a subset of initial vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id57816">maximal_independent_vertex_sets, <a class="indexterm" href="igraph-Cliques.html#igraph_maximal_independent_vertex_sets">igraph_maximal_independent_vertex_sets — Finds all maximal independent vertex sets of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id54238">maximum_bipartite_matching, <a class="indexterm" href="igraph-Structural.html#igraph_maximum_bipartite_matching">igraph_maximum_bipartite_matching — Calculates a maximum matching in a bipartite graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id53917">maximum_cardinality_search, <a class="indexterm" href="igraph-Structural.html#igraph_maximum_cardinality_search">igraph_maximum_cardinality_search — Maximum cardinality search.</a>
|
||
</dt>
|
||
<dt id="ientry-id54451">mean_degree, <a class="indexterm" href="igraph-Structural.html#igraph_mean_degree">igraph_mean_degree — The mean degree of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id37402">metric_t, <a class="indexterm" href="igraph-Spatial.html#igraph_metric_t">igraph_metric_t — Metric functions for use with spatial computation.</a>
|
||
</dt>
|
||
<dt id="ientry-id62079">mincut, <a class="indexterm" href="igraph-Flows.html#igraph_mincut">igraph_mincut — Calculates the minimum cut in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id62231">mincut_value, <a class="indexterm" href="igraph-Flows.html#igraph_mincut_value">igraph_mincut_value — The minimum edge cut in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id56230">minimum_cycle_basis, <a class="indexterm" href="igraph-Cycles.html#igraph_minimum_cycle_basis">igraph_minimum_cycle_basis — Computes a minimum weight cycle basis.</a>
|
||
</dt>
|
||
<dt id="ientry-id63293">minimum_size_separators, <a class="indexterm" href="igraph-Separators.html#igraph_minimum_size_separators">igraph_minimum_size_separators — Find all minimum size separating vertex sets.</a>
|
||
</dt>
|
||
<dt id="ientry-id50864">minimum_spanning_tree, <a class="indexterm" href="igraph-Structural.html#igraph_minimum_spanning_tree">igraph_minimum_spanning_tree — Calculates a minimum spanning tree of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id63459">modularity, <a class="indexterm" href="igraph-Community.html#igraph_modularity">igraph_modularity — Calculates the modularity of a graph with respect to some clusters or vertex types.</a>
|
||
</dt>
|
||
<dt id="ientry-id63568">modularity_matrix, <a class="indexterm" href="igraph-Community.html#igraph_modularity_matrix">igraph_modularity_matrix — Calculates the modularity matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id58743">motifs_handler_t, <a class="indexterm" href="igraph-Motifs.html#igraph_motifs_handler_t">igraph_motifs_handler_t — Callback type for igraph_motifs_randesu_callback.</a>
|
||
</dt>
|
||
<dt id="ientry-id58337">motifs_randesu, <a class="indexterm" href="igraph-Motifs.html#igraph_motifs_randesu">igraph_motifs_randesu — Count the number of motifs in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id58622">motifs_randesu_callback, <a class="indexterm" href="igraph-Motifs.html#igraph_motifs_randesu_callback">igraph_motifs_randesu_callback — Finds motifs in a graph and calls a function for each of them.</a>
|
||
</dt>
|
||
<dt id="ientry-id58539">motifs_randesu_estimate, <a class="indexterm" href="igraph-Motifs.html#igraph_motifs_randesu_estimate">igraph_motifs_randesu_estimate — Estimate the total number of motifs in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id58476">motifs_randesu_no, <a class="indexterm" href="igraph-Motifs.html#igraph_motifs_randesu_no">igraph_motifs_randesu_no — Count the total number of motifs in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id39874">mycielskian, <a class="indexterm" href="igraph-Operators.html#igraph_mycielskian">igraph_mycielskian — Generate the Mycielskian of a graph with k iterations.</a>
|
||
</dt>
|
||
<dt id="ientry-id33099">mycielski_graph, <a class="indexterm" href="igraph-Generators.html#igraph_mycielski_graph">igraph_mycielski_graph — The Mycielski graph of order k.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>N</h3>
|
||
<dl>
|
||
<dt id="ientry-id37468">nearest_neighbor_graph, <a class="indexterm" href="igraph-Spatial.html#igraph_nearest_neighbor_graph">igraph_nearest_neighbor_graph — Computes the nearest neighbor graph for a spatial point set.</a>
|
||
</dt>
|
||
<dt id="ientry-id45004">neighborhood, <a class="indexterm" href="igraph-Structural.html#igraph_neighborhood">igraph_neighborhood — Calculate the neighborhood of vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id45080">neighborhood_graphs, <a class="indexterm" href="igraph-Structural.html#igraph_neighborhood_graphs">igraph_neighborhood_graphs — Create graphs from the neighborhood(s) of some vertex/vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id44930">neighborhood_size, <a class="indexterm" href="igraph-Structural.html#igraph_neighborhood_size">igraph_neighborhood_size — Calculates the size of the neighborhood of a given vertex.</a>
|
||
</dt>
|
||
<dt id="ientry-id3193">neighbors, <a class="indexterm" href="igraph-Basic.html#igraph_neighbors">igraph_neighbors — Adjacent vertices to a vertex.</a>
|
||
</dt>
|
||
<dt id="ientry-id55145">neimode_t, <a class="indexterm" href="igraph-Structural.html#igraph_neimode_t">igraph_neimode_t — How to interpret edge directions in directed graphs?</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>O</h3>
|
||
<dl><dt id="ientry-id2788">OTHER, <a class="indexterm" href="igraph-Basic.html#IGRAPH_OTHER">IGRAPH_OTHER — The other endpoint of an edge.</a>
|
||
</dt></dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>P</h3>
|
||
<dl>
|
||
<dt id="ientry-id47313">pagerank, <a class="indexterm" href="igraph-Structural.html#igraph_pagerank">igraph_pagerank — Calculates the Google PageRank for the specified vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id47290">pagerank_algo_t, <a class="indexterm" href="igraph-Structural.html#igraph_pagerank_algo_t">igraph_pagerank_algo_t — PageRank algorithm implementation.</a>
|
||
</dt>
|
||
<dt id="ientry-id31103">path_graph, <a class="indexterm" href="igraph-Generators.html#igraph_path_graph">igraph_path_graph — A path graph P_n.</a>
|
||
</dt>
|
||
<dt id="ientry-id43536">path_length_hist, <a class="indexterm" href="igraph-Structural.html#igraph_path_length_hist">igraph_path_length_hist — Create a histogram of all shortest path lengths.</a>
|
||
</dt>
|
||
<dt id="ientry-id60916">permute_vertices, <a class="indexterm" href="igraph-Isomorphism.html#igraph_permute_vertices">igraph_permute_vertices — Permute the vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id47464">personalized_pagerank, <a class="indexterm" href="igraph-Structural.html#igraph_personalized_pagerank">igraph_personalized_pagerank — Calculates the personalized Google PageRank for the specified vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id47573">personalized_pagerank_vs, <a class="indexterm" href="igraph-Structural.html#igraph_personalized_pagerank_vs">igraph_personalized_pagerank_vs — Calculates the personalized Google PageRank for the specified vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id73870">plfit_result_calculate_p_value, <a class="indexterm" href="igraph-Nongraph.html#igraph_plfit_result_calculate_p_value">igraph_plfit_result_calculate_p_value — Calculates the p-value of a fitted power-law model.</a>
|
||
</dt>
|
||
<dt id="ientry-id73689">plfit_result_t, <a class="indexterm" href="igraph-Nongraph.html#igraph_plfit_result_t">igraph_plfit_result_t — Result of fitting a power-law distribution to a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id73742">power_law_fit, <a class="indexterm" href="igraph-Nongraph.html#igraph_power_law_fit">igraph_power_law_fit — Fits a power-law distribution to a vector of numbers.</a>
|
||
</dt>
|
||
<dt id="ientry-id33753">preference_game, <a class="indexterm" href="igraph-Games.html#igraph_preference_game">igraph_preference_game — Generates a graph with vertex types and connection preferences.</a>
|
||
</dt>
|
||
<dt id="ientry-id39391">product, <a class="indexterm" href="igraph-Operators.html#igraph_product">igraph_product — The graph product of two graphs, according to the chosen product type.</a>
|
||
</dt>
|
||
<dt id="ientry-id74203">PROGRESS, <a class="indexterm" href="igraph-Advanced.html#IGRAPH_PROGRESS">IGRAPH_PROGRESS — Report the progress of a calculation from an igraph function (macro variant).</a>
|
||
</dt>
|
||
<dt id="ientry-id74281">progress, <a class="indexterm" href="igraph-Advanced.html#igraph_progress">igraph_progress — Report the progress of a calculation from an igraph function.</a>
|
||
</dt>
|
||
<dt id="ientry-id74246">PROGRESSF, <a class="indexterm" href="igraph-Advanced.html#IGRAPH_PROGRESSF">IGRAPH_PROGRESSF — Report the progress of a calculation from an igraph function, printf-like (macro variant).</a>
|
||
</dt>
|
||
<dt id="ientry-id74324">progressf, <a class="indexterm" href="igraph-Advanced.html#igraph_progressf">igraph_progressf — Report the progress of a calculation from an igraph function, printf-like.</a>
|
||
</dt>
|
||
<dt id="ientry-id74159">progress_handler_stderr, <a class="indexterm" href="igraph-Advanced.html#igraph_progress_handler_stderr">igraph_progress_handler_stderr — A simple predefined progress handler.</a>
|
||
</dt>
|
||
<dt id="ientry-id74080">progress_handler_t, <a class="indexterm" href="igraph-Advanced.html#igraph_progress_handler_t">igraph_progress_handler_t — Type of progress handler functions</a>
|
||
</dt>
|
||
<dt id="ientry-id44035">pseudo_diameter, <a class="indexterm" href="igraph-Structural.html#igraph_pseudo_diameter">igraph_pseudo_diameter — Approximation and lower bound of the diameter of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id20909">psumtree_destroy, <a class="indexterm" href="igraph-Data-structures.html#igraph_psumtree_destroy">igraph_psumtree_destroy — Destroys a partial prefix sum tree.</a>
|
||
</dt>
|
||
<dt id="ientry-id20962">psumtree_get, <a class="indexterm" href="igraph-Data-structures.html#igraph_psumtree_get">igraph_psumtree_get — Retrieves the value corresponding to an item in the tree.</a>
|
||
</dt>
|
||
<dt id="ientry-id20873">psumtree_init, <a class="indexterm" href="igraph-Data-structures.html#igraph_psumtree_init">igraph_psumtree_init — Initializes a partial prefix sum tree.</a>
|
||
</dt>
|
||
<dt id="ientry-id21110">psumtree_reset, <a class="indexterm" href="igraph-Data-structures.html#igraph_psumtree_reset">igraph_psumtree_reset — Resets all the values in the tree to zero.</a>
|
||
</dt>
|
||
<dt id="ientry-id21026">psumtree_search, <a class="indexterm" href="igraph-Data-structures.html#igraph_psumtree_search">igraph_psumtree_search — Finds an item in the tree, given a value.</a>
|
||
</dt>
|
||
<dt id="ientry-id20933">psumtree_size, <a class="indexterm" href="igraph-Data-structures.html#igraph_psumtree_size">igraph_psumtree_size — Returns the size of the tree.</a>
|
||
</dt>
|
||
<dt id="ientry-id20997">psumtree_sum, <a class="indexterm" href="igraph-Data-structures.html#igraph_psumtree_sum">igraph_psumtree_sum — Returns the sum of the values of the leaves in the tree.</a>
|
||
</dt>
|
||
<dt id="ientry-id21069">psumtree_update, <a class="indexterm" href="igraph-Data-structures.html#igraph_psumtree_update">igraph_psumtree_update — Updates the value associated to an item in the tree.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>R</h3>
|
||
<dl>
|
||
<dt id="ientry-id43904">radius, <a class="indexterm" href="igraph-Structural.html#igraph_radius">igraph_radius — Radius of a graph, using weighted edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id73421">random_sample, <a class="indexterm" href="igraph-Nongraph.html#igraph_random_sample">igraph_random_sample — Generates an increasing random sequence of integers.</a>
|
||
</dt>
|
||
<dt id="ientry-id51008">random_spanning_tree, <a class="indexterm" href="igraph-Structural.html#igraph_random_spanning_tree">igraph_random_spanning_tree — Uniformly samples the spanning trees of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id40785">random_walk, <a class="indexterm" href="igraph-Visitors.html#igraph_random_walk">igraph_random_walk — Performs a random walk on a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id46016">reachability, <a class="indexterm" href="igraph-Structural.html#igraph_reachability">igraph_reachability — Calculates which vertices are reachable from each vertex in the graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id69872">read_graph_dimacs_flow, <a class="indexterm" href="igraph-Foreign.html#igraph_read_graph_dimacs_flow">igraph_read_graph_dimacs_flow — Read a graph in DIMACS format.</a>
|
||
</dt>
|
||
<dt id="ientry-id70907">read_graph_dl, <a class="indexterm" href="igraph-Foreign.html#igraph_read_graph_dl">igraph_read_graph_dl — Reads a file in the DL format of UCINET.</a>
|
||
</dt>
|
||
<dt id="ientry-id69348">read_graph_edgelist, <a class="indexterm" href="igraph-Foreign.html#igraph_read_graph_edgelist">igraph_read_graph_edgelist — Reads an edge list from a file and creates a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id70329">read_graph_gml, <a class="indexterm" href="igraph-Foreign.html#igraph_read_graph_gml">igraph_read_graph_gml — Read a graph in GML format.</a>
|
||
</dt>
|
||
<dt id="ientry-id70033">read_graph_graphdb, <a class="indexterm" href="igraph-Foreign.html#igraph_read_graph_graphdb">igraph_read_graph_graphdb — Read a graph in the binary graph database format.</a>
|
||
</dt>
|
||
<dt id="ientry-id70107">read_graph_graphml, <a class="indexterm" href="igraph-Foreign.html#igraph_read_graph_graphml">igraph_read_graph_graphml — Reads a graph from a GraphML file.</a>
|
||
</dt>
|
||
<dt id="ientry-id69591">read_graph_lgl, <a class="indexterm" href="igraph-Foreign.html#igraph_read_graph_lgl">igraph_read_graph_lgl — Reads a graph from an .lgl file.</a>
|
||
</dt>
|
||
<dt id="ientry-id69434">read_graph_ncol, <a class="indexterm" href="igraph-Foreign.html#igraph_read_graph_ncol">igraph_read_graph_ncol — Reads an .ncol file used by LGL.</a>
|
||
</dt>
|
||
<dt id="ientry-id70574">read_graph_pajek, <a class="indexterm" href="igraph-Foreign.html#igraph_read_graph_pajek">igraph_read_graph_pajek — Reads a file in Pajek format.</a>
|
||
</dt>
|
||
<dt id="ientry-id32206">realize_bipartite_degree_sequence, <a class="indexterm" href="igraph-Generators.html#igraph_realize_bipartite_degree_sequence">igraph_realize_bipartite_degree_sequence — Generates a bipartite graph with the given bidegree sequence.</a>
|
||
</dt>
|
||
<dt id="ientry-id32004">realize_degree_sequence, <a class="indexterm" href="igraph-Generators.html#igraph_realize_degree_sequence">igraph_realize_degree_sequence — Generates a graph with the given degree sequence.</a>
|
||
</dt>
|
||
<dt id="ientry-id5583">realloc, <a class="indexterm" href="igraph-Memory.html#igraph_realloc">igraph_realloc — Reallocate memory that can be safely deallocated by igraph functions.</a>
|
||
</dt>
|
||
<dt id="ientry-id34574">recent_degree_aging_game, <a class="indexterm" href="igraph-Games.html#igraph_recent_degree_aging_game">igraph_recent_degree_aging_game — Preferential attachment based on the number of edges gained recently, with aging of vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id34501">recent_degree_game, <a class="indexterm" href="igraph-Games.html#igraph_recent_degree_game">igraph_recent_degree_game — Stochastic graph generator based on the number of incident edges a node has gained recently.</a>
|
||
</dt>
|
||
<dt id="ientry-id54490">reciprocity, <a class="indexterm" href="igraph-Structural.html#igraph_reciprocity">igraph_reciprocity — Calculates the reciprocity of a directed graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id31725">regular_tree, <a class="indexterm" href="igraph-Generators.html#igraph_regular_tree">igraph_regular_tree — Creates a regular tree.</a>
|
||
</dt>
|
||
<dt id="ientry-id63843">reindex_membership, <a class="indexterm" href="igraph-Community.html#igraph_reindex_membership">igraph_reindex_membership — Makes the IDs in a membership vector contiguous.</a>
|
||
</dt>
|
||
<dt id="ientry-id37585">relative_neighborhood_graph, <a class="indexterm" href="igraph-Spatial.html#igraph_relative_neighborhood_graph">igraph_relative_neighborhood_graph — The relative neighborhood graph of a point set.</a>
|
||
</dt>
|
||
<dt id="ientry-id40209">reverse_edges, <a class="indexterm" href="igraph-Operators.html#igraph_reverse_edges">igraph_reverse_edges — Reverses some edges of a directed graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id35500">rewire, <a class="indexterm" href="igraph-Games.html#igraph_rewire">igraph_rewire — Randomly rewires a graph while preserving its degree sequence.</a>
|
||
</dt>
|
||
<dt id="ientry-id36060">rewire_directed_edges, <a class="indexterm" href="igraph-Games.html#igraph_rewire_directed_edges">igraph_rewire_directed_edges — Rewires the chosen endpoint of directed edges.</a>
|
||
</dt>
|
||
<dt id="ientry-id36002">rewire_edges, <a class="indexterm" href="igraph-Games.html#igraph_rewire_edges">igraph_rewire_edges — Rewires the edges of a graph with constant probability.</a>
|
||
</dt>
|
||
<dt id="ientry-id53735">rich_club_sequence, <a class="indexterm" href="igraph-Structural.html#igraph_rich_club_sequence">igraph_rich_club_sequence — Density sequence of subgraphs formed by sequential vertex removal.</a>
|
||
</dt>
|
||
<dt id="ientry-id30998">ring, <a class="indexterm" href="igraph-Generators.html#igraph_ring">igraph_ring — Creates a cycle graph or a path graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id22768">rngtype_glibc2, <a class="indexterm" href="igraph-Random.html#igraph_rngtype_glibc2">igraph_rngtype_glibc2 — The random number generator introduced in GNU libc 2.</a>
|
||
</dt>
|
||
<dt id="ientry-id22752">rngtype_mt19937, <a class="indexterm" href="igraph-Random.html#igraph_rngtype_mt19937">igraph_rngtype_mt19937 — The MT19937 random number generator.</a>
|
||
</dt>
|
||
<dt id="ientry-id22776">rngtype_pcg32, <a class="indexterm" href="igraph-Random.html#igraph_rngtype_pcg32">igraph_rngtype_pcg32 — The PCG random number generator (32-bit version).</a>
|
||
</dt>
|
||
<dt id="ientry-id22787">rngtype_pcg64, <a class="indexterm" href="igraph-Random.html#igraph_rngtype_pcg64">igraph_rngtype_pcg64 — The PCG random number generator (64-bit version).</a>
|
||
</dt>
|
||
<dt id="ientry-id22258">rng_bits, <a class="indexterm" href="igraph-Random.html#igraph_rng_bits">igraph_rng_bits — The number of random bits that a random number generator can produces in a single round.</a>
|
||
</dt>
|
||
<dt id="ientry-id22094">rng_default, <a class="indexterm" href="igraph-Random.html#igraph_rng_default">igraph_rng_default — Query the default random number generator.</a>
|
||
</dt>
|
||
<dt id="ientry-id22205">rng_destroy, <a class="indexterm" href="igraph-Random.html#igraph_rng_destroy">igraph_rng_destroy — Deallocates memory associated with a random number generator.</a>
|
||
</dt>
|
||
<dt id="ientry-id22624">rng_get_binom, <a class="indexterm" href="igraph-Random.html#igraph_rng_get_binom">igraph_rng_get_binom — Samples from a binomial distribution.</a>
|
||
</dt>
|
||
<dt id="ientry-id22350">rng_get_bool, <a class="indexterm" href="igraph-Random.html#igraph_rng_get_bool">igraph_rng_get_bool — Generate a random boolean.</a>
|
||
</dt>
|
||
<dt id="ientry-id22543">rng_get_exp, <a class="indexterm" href="igraph-Random.html#igraph_rng_get_exp">igraph_rng_get_exp — Samples from an exponential distribution.</a>
|
||
</dt>
|
||
<dt id="ientry-id22581">rng_get_gamma, <a class="indexterm" href="igraph-Random.html#igraph_rng_get_gamma">igraph_rng_get_gamma — Samples from a gamma distribution.</a>
|
||
</dt>
|
||
<dt id="ientry-id22669">rng_get_geom, <a class="indexterm" href="igraph-Random.html#igraph_rng_get_geom">igraph_rng_get_geom — Samples from a geometric distribution.</a>
|
||
</dt>
|
||
<dt id="ientry-id22381">rng_get_integer, <a class="indexterm" href="igraph-Random.html#igraph_rng_get_integer">igraph_rng_get_integer — Generate an integer random number from an interval.</a>
|
||
</dt>
|
||
<dt id="ientry-id22500">rng_get_normal, <a class="indexterm" href="igraph-Random.html#igraph_rng_get_normal">igraph_rng_get_normal — Samples from a normal distribution.</a>
|
||
</dt>
|
||
<dt id="ientry-id22709">rng_get_pois, <a class="indexterm" href="igraph-Random.html#igraph_rng_get_pois">igraph_rng_get_pois — Samples from a Poisson distribution.</a>
|
||
</dt>
|
||
<dt id="ientry-id22458">rng_get_unif, <a class="indexterm" href="igraph-Random.html#igraph_rng_get_unif">igraph_rng_get_unif — Samples real numbers from a given interval.</a>
|
||
</dt>
|
||
<dt id="ientry-id22426">rng_get_unif01, <a class="indexterm" href="igraph-Random.html#igraph_rng_get_unif01">igraph_rng_get_unif01 — Samples uniformly from the unit interval.</a>
|
||
</dt>
|
||
<dt id="ientry-id22163">rng_init, <a class="indexterm" href="igraph-Random.html#igraph_rng_init">igraph_rng_init — Initializes a random number generator.</a>
|
||
</dt>
|
||
<dt id="ientry-id22287">rng_max, <a class="indexterm" href="igraph-Random.html#igraph_rng_max">igraph_rng_max — The maximum possible integer for a random number generator.</a>
|
||
</dt>
|
||
<dt id="ientry-id22319">rng_name, <a class="indexterm" href="igraph-Random.html#igraph_rng_name">igraph_rng_name — The type of a random number generator.</a>
|
||
</dt>
|
||
<dt id="ientry-id73629">rng_sample_dirichlet, <a class="indexterm" href="igraph-Nongraph.html#igraph_rng_sample_dirichlet">igraph_rng_sample_dirichlet — Sample points from a Dirichlet distribution.</a>
|
||
</dt>
|
||
<dt id="ientry-id73493">rng_sample_sphere_surface, <a class="indexterm" href="igraph-Nongraph.html#igraph_rng_sample_sphere_surface">igraph_rng_sample_sphere_surface — Sample points uniformly from the surface of a sphere.</a>
|
||
</dt>
|
||
<dt id="ientry-id73561">rng_sample_sphere_volume, <a class="indexterm" href="igraph-Nongraph.html#igraph_rng_sample_sphere_volume">igraph_rng_sample_sphere_volume — Sample points uniformly from the volume of a sphere.</a>
|
||
</dt>
|
||
<dt id="ientry-id22224">rng_seed, <a class="indexterm" href="igraph-Random.html#igraph_rng_seed">igraph_rng_seed — Seeds a random number generator.</a>
|
||
</dt>
|
||
<dt id="ientry-id22125">rng_set_default, <a class="indexterm" href="igraph-Random.html#igraph_rng_set_default">igraph_rng_set_default — Set the default igraph random number generator.</a>
|
||
</dt>
|
||
<dt id="ientry-id39547">rooted_product, <a class="indexterm" href="igraph-Operators.html#igraph_rooted_product">igraph_rooted_product — The rooted graph product of two graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id68433">roots_for_tree_layout, <a class="indexterm" href="igraph-Layout.html#igraph_roots_for_tree_layout">igraph_roots_for_tree_layout — Roots suitable for a nice tree layout.</a>
|
||
</dt>
|
||
<dt id="ientry-id73378">running_mean, <a class="indexterm" href="igraph-Nongraph.html#igraph_running_mean">igraph_running_mean — Calculates the running mean of a vector.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>S</h3>
|
||
<dl>
|
||
<dt id="ientry-id33544">sbm_game, <a class="indexterm" href="igraph-Games.html#igraph_sbm_game">igraph_sbm_game — Sample from a stochastic block model.</a>
|
||
</dt>
|
||
<dt id="ientry-id28910">SETEAB, <a class="indexterm" href="igraph-Attributes.html#SETEAB">SETEAB — Set a boolean edge attribute</a>
|
||
</dt>
|
||
<dt id="ientry-id29463">SETEABV, <a class="indexterm" href="igraph-Attributes.html#SETEABV">SETEABV — Set a boolean edge attribute for all edges</a>
|
||
</dt>
|
||
<dt id="ientry-id28807">SETEAN, <a class="indexterm" href="igraph-Attributes.html#SETEAN">SETEAN — Set a numeric edge attribute</a>
|
||
</dt>
|
||
<dt id="ientry-id29382">SETEANV, <a class="indexterm" href="igraph-Attributes.html#SETEANV">SETEANV — Set a numeric edge attribute for all edges</a>
|
||
</dt>
|
||
<dt id="ientry-id29013">SETEAS, <a class="indexterm" href="igraph-Attributes.html#SETEAS">SETEAS — Set a string edge attribute</a>
|
||
</dt>
|
||
<dt id="ientry-id29544">SETEASV, <a class="indexterm" href="igraph-Attributes.html#SETEASV">SETEASV — Set a string edge attribute for all edges</a>
|
||
</dt>
|
||
<dt id="ientry-id28319">SETGAB, <a class="indexterm" href="igraph-Attributes.html#SETGAB">SETGAB — Set a boolean graph attribute</a>
|
||
</dt>
|
||
<dt id="ientry-id28238">SETGAN, <a class="indexterm" href="igraph-Attributes.html#SETGAN">SETGAN — Set a numeric graph attribute</a>
|
||
</dt>
|
||
<dt id="ientry-id28400">SETGAS, <a class="indexterm" href="igraph-Attributes.html#SETGAS">SETGAS — Set a string graph attribute</a>
|
||
</dt>
|
||
<dt id="ientry-id2131">setup, <a class="indexterm" href="igraph-Basic.html#igraph_setup">igraph_setup — Initializes the igraph library.</a>
|
||
</dt>
|
||
<dt id="ientry-id28601">SETVAB, <a class="indexterm" href="igraph-Attributes.html#SETVAB">SETVAB — Set a boolean vertex attribute</a>
|
||
</dt>
|
||
<dt id="ientry-id29200">SETVABV, <a class="indexterm" href="igraph-Attributes.html#SETVABV">SETVABV — Set a boolean vertex attribute for all vertices</a>
|
||
</dt>
|
||
<dt id="ientry-id28498">SETVAN, <a class="indexterm" href="igraph-Attributes.html#SETVAN">SETVAN — Set a numeric vertex attribute</a>
|
||
</dt>
|
||
<dt id="ientry-id29109">SETVANV, <a class="indexterm" href="igraph-Attributes.html#SETVANV">SETVANV — Set a numeric vertex attribute for all vertices</a>
|
||
</dt>
|
||
<dt id="ientry-id28704">SETVAS, <a class="indexterm" href="igraph-Attributes.html#SETVAS">SETVAS — Set a string vertex attribute</a>
|
||
</dt>
|
||
<dt id="ientry-id29291">SETVASV, <a class="indexterm" href="igraph-Attributes.html#SETVASV">SETVASV — Set a string vertex attribute for all vertices</a>
|
||
</dt>
|
||
<dt id="ientry-id25637">set_attribute_table, <a class="indexterm" href="igraph-Attributes.html#igraph_set_attribute_table">igraph_set_attribute_table — Attach an attribute table.</a>
|
||
</dt>
|
||
<dt id="ientry-id4753">set_error_handler, <a class="indexterm" href="igraph-Error.html#igraph_set_error_handler">igraph_set_error_handler — Sets a new error handler.</a>
|
||
</dt>
|
||
<dt id="ientry-id5270">set_fatal_handler, <a class="indexterm" href="igraph-Error.html#igraph_set_fatal_handler">igraph_set_fatal_handler — Installs a fatal error handler.</a>
|
||
</dt>
|
||
<dt id="ientry-id74126">set_progress_handler, <a class="indexterm" href="igraph-Advanced.html#igraph_set_progress_handler">igraph_set_progress_handler — Install a progress handler, or remove the current handler.</a>
|
||
</dt>
|
||
<dt id="ientry-id74466">set_status_handler, <a class="indexterm" href="igraph-Advanced.html#igraph_set_status_handler">igraph_set_status_handler — Install of uninstall a status handler function.</a>
|
||
</dt>
|
||
<dt id="ientry-id4528">set_warning_handler, <a class="indexterm" href="igraph-Error.html#igraph_set_warning_handler">igraph_set_warning_handler — Installs a warning handler.</a>
|
||
</dt>
|
||
<dt id="ientry-id50194">similarity_dice, <a class="indexterm" href="igraph-Structural.html#igraph_similarity_dice">igraph_similarity_dice — Dice similarity coefficient.</a>
|
||
</dt>
|
||
<dt id="ientry-id50542">similarity_dice_es, <a class="indexterm" href="igraph-Structural.html#igraph_similarity_dice_es">igraph_similarity_dice_es — Dice similarity coefficient for a given edge selector.</a>
|
||
</dt>
|
||
<dt id="ientry-id50368">similarity_dice_pairs, <a class="indexterm" href="igraph-Structural.html#igraph_similarity_dice_pairs">igraph_similarity_dice_pairs — Dice similarity coefficient for given vertex pairs.</a>
|
||
</dt>
|
||
<dt id="ientry-id50718">similarity_inverse_log_weighted, <a class="indexterm" href="igraph-Structural.html#igraph_similarity_inverse_log_weighted">igraph_similarity_inverse_log_weighted — Vertex similarity based on the inverse logarithm of vertex degrees.</a>
|
||
</dt>
|
||
<dt id="ientry-id49672">similarity_jaccard, <a class="indexterm" href="igraph-Structural.html#igraph_similarity_jaccard">igraph_similarity_jaccard — Jaccard similarity coefficient for the given vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id50018">similarity_jaccard_es, <a class="indexterm" href="igraph-Structural.html#igraph_similarity_jaccard_es">igraph_similarity_jaccard_es — Jaccard similarity coefficient for a given edge selector.</a>
|
||
</dt>
|
||
<dt id="ientry-id49846">similarity_jaccard_pairs, <a class="indexterm" href="igraph-Structural.html#igraph_similarity_jaccard_pairs">igraph_similarity_jaccard_pairs — Jaccard similarity coefficient for given vertex pairs.</a>
|
||
</dt>
|
||
<dt id="ientry-id55237">simple_cycles, <a class="indexterm" href="igraph-Cycles.html#igraph_simple_cycles">igraph_simple_cycles — Finds all simple cycles.</a>
|
||
</dt>
|
||
<dt id="ientry-id55325">simple_cycles_callback, <a class="indexterm" href="igraph-Cycles.html#igraph_simple_cycles_callback">igraph_simple_cycles_callback — Finds all simple cycles (callback version).</a>
|
||
</dt>
|
||
<dt id="ientry-id36334">simple_interconnected_islands_game, <a class="indexterm" href="igraph-Games.html#igraph_simple_interconnected_islands_game">igraph_simple_interconnected_islands_game — Generates a random graph made of several interconnected islands, each island being a random graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id39979">simplify, <a class="indexterm" href="igraph-Operators.html#igraph_simplify">igraph_simplify — Removes loop and/or multiple edges from the graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id60957">simplify_and_colorize, <a class="indexterm" href="igraph-Isomorphism.html#igraph_simplify_and_colorize">igraph_simplify_and_colorize — Simplify the graph and compute self-loop and edge multiplicities.</a>
|
||
</dt>
|
||
<dt id="ientry-id69225">sir, <a class="indexterm" href="igraph-Processes.html#igraph_sir">igraph_sir — Performs a number of SIR epidemics model runs on a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id69315">sir_destroy, <a class="indexterm" href="igraph-Processes.html#igraph_sir_destroy">igraph_sir_destroy — Deallocates memory associated with a SIR simulation run.</a>
|
||
</dt>
|
||
<dt id="ientry-id69281">sir_t, <a class="indexterm" href="igraph-Processes.html#igraph_sir_t">igraph_sir_t — The result of one SIR model simulation.</a>
|
||
</dt>
|
||
<dt id="ientry-id46522">site_percolation, <a class="indexterm" href="igraph-Structural.html#igraph_site_percolation">igraph_site_percolation — The size of the largest component as vertices are added to a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id30032">small, <a class="indexterm" href="igraph-Generators.html#igraph_small">igraph_small — Shorthand to create a small graph, giving the edges as arguments.</a>
|
||
</dt>
|
||
<dt id="ientry-id40926">spanner, <a class="indexterm" href="igraph-Structural.html#igraph_spanner">igraph_spanner — Calculates a spanner of a graph with a given stretch factor.</a>
|
||
</dt>
|
||
<dt id="ientry-id15276">sparsemat_add, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_add">igraph_sparsemat_add — Sum of two sparse matrices.</a>
|
||
</dt>
|
||
<dt id="ientry-id15442">sparsemat_add_cols, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_add_cols">igraph_sparsemat_add_cols — Adds columns to a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id15408">sparsemat_add_rows, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_add_rows">igraph_sparsemat_add_rows — Adds rows to a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id16518">sparsemat_arpack_rnsolve, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_arpack_rnsolve">igraph_sparsemat_arpack_rnsolve — Eigenvalues and eigenvectors of a nonsymmetric sparse matrix via ARPACK.</a>
|
||
</dt>
|
||
<dt id="ientry-id16440">sparsemat_arpack_rssolve, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_arpack_rssolve">igraph_sparsemat_arpack_rssolve — Eigenvalues and eigenvectors of a symmetric sparse matrix via ARPACK.</a>
|
||
</dt>
|
||
<dt id="ientry-id16632">sparsemat_as_matrix, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_as_matrix">igraph_sparsemat_as_matrix — Converts a sparse matrix to a dense matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id16108">sparsemat_cholsol, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_cholsol">igraph_sparsemat_cholsol — Solves a symmetric linear system via Cholesky decomposition.</a>
|
||
</dt>
|
||
<dt id="ientry-id14938">sparsemat_colsums, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_colsums">igraph_sparsemat_colsums — Column-wise sums.</a>
|
||
</dt>
|
||
<dt id="ientry-id15797">sparsemat_compress, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_compress">igraph_sparsemat_compress — Converts a sparse matrix to column-compressed format.</a>
|
||
</dt>
|
||
<dt id="ientry-id14840">sparsemat_count_nonzero, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_count_nonzero">igraph_sparsemat_count_nonzero — Counts nonzero elements of a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id14869">sparsemat_count_nonzerotol, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_count_nonzerotol">igraph_sparsemat_count_nonzerotol — Counts nonzero elements of a sparse matrix, ignoring elements close to zero.</a>
|
||
</dt>
|
||
<dt id="ientry-id14338">sparsemat_destroy, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_destroy">igraph_sparsemat_destroy — Deallocates memory used by a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id15128">sparsemat_droptol, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_droptol">igraph_sparsemat_droptol — Drops the almost zero elements from a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id15099">sparsemat_dropzeros, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_dropzeros">igraph_sparsemat_dropzeros — Drops the zero elements from a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id15833">sparsemat_dupl, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_dupl">igraph_sparsemat_dupl — Removes duplicate elements from a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id15007">sparsemat_entry, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_entry">igraph_sparsemat_entry — Adds an element to a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id15053">sparsemat_fkeep, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_fkeep">igraph_sparsemat_fkeep — Filters the elements of a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id15368">sparsemat_gaxpy, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_gaxpy">igraph_sparsemat_gaxpy — Matrix-vector product, added to another vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id14592">sparsemat_get, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_get">igraph_sparsemat_get — Return the value of a single element from a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id14631">sparsemat_getelements, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_getelements">igraph_sparsemat_getelements — Returns all elements of a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id14684">sparsemat_getelements_sorted, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_getelements_sorted">igraph_sparsemat_getelements_sorted — Returns all elements of a sparse matrix, sorted by row and column indices.</a>
|
||
</dt>
|
||
<dt id="ientry-id14359">sparsemat_index, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_index">igraph_sparsemat_index — Extracts a submatrix or a single element.</a>
|
||
</dt>
|
||
<dt id="ientry-id14125">sparsemat_init, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_init">igraph_sparsemat_init — Initializes a sparse matrix, in triplet format.</a>
|
||
</dt>
|
||
<dt id="ientry-id14176">sparsemat_init_copy, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_init_copy">igraph_sparsemat_init_copy — Copies a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id14211">sparsemat_init_diag, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_init_diag">igraph_sparsemat_init_diag — Creates a sparse diagonal matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id14255">sparsemat_init_eye, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_init_eye">igraph_sparsemat_init_eye — Creates a sparse identity matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id14528">sparsemat_is_cc, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_is_cc">igraph_sparsemat_is_cc — Is this sparse matrix in column-compressed format?</a>
|
||
</dt>
|
||
<dt id="ientry-id14557">sparsemat_is_symmetric, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_is_symmetric">igraph_sparsemat_is_symmetric — Returns whether a sparse matrix is symmetric.</a>
|
||
</dt>
|
||
<dt id="ientry-id14499">sparsemat_is_triplet, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_is_triplet">igraph_sparsemat_is_triplet — Is this sparse matrix in triplet format?</a>
|
||
</dt>
|
||
<dt id="ientry-id15679">sparsemat_iterator_col, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_iterator_col">igraph_sparsemat_iterator_col — Return the column of the iterator.</a>
|
||
</dt>
|
||
<dt id="ientry-id15621">sparsemat_iterator_end, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_iterator_end">igraph_sparsemat_iterator_end — Query if the iterator is past the last element.</a>
|
||
</dt>
|
||
<dt id="ientry-id15708">sparsemat_iterator_get, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_iterator_get">igraph_sparsemat_iterator_get — Return the element at the current iterator position.</a>
|
||
</dt>
|
||
<dt id="ientry-id15766">sparsemat_iterator_idx, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_iterator_idx">igraph_sparsemat_iterator_idx — Returns the element vector index of a sparse matrix iterator.</a>
|
||
</dt>
|
||
<dt id="ientry-id15556">sparsemat_iterator_init, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_iterator_init">igraph_sparsemat_iterator_init — Initialize a sparse matrix iterator.</a>
|
||
</dt>
|
||
<dt id="ientry-id15737">sparsemat_iterator_next, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_iterator_next">igraph_sparsemat_iterator_next — Let a sparse matrix iterator go to the next element.</a>
|
||
</dt>
|
||
<dt id="ientry-id15591">sparsemat_iterator_reset, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_iterator_reset">igraph_sparsemat_iterator_reset — Reset a sparse matrix iterator to the first element.</a>
|
||
</dt>
|
||
<dt id="ientry-id15650">sparsemat_iterator_row, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_iterator_row">igraph_sparsemat_iterator_row — Return the row of the iterator.</a>
|
||
</dt>
|
||
<dt id="ientry-id15950">sparsemat_lsolve, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_lsolve">igraph_sparsemat_lsolve — Solves a lower-triangular linear system.</a>
|
||
</dt>
|
||
<dt id="ientry-id15989">sparsemat_ltsolve, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_ltsolve">igraph_sparsemat_ltsolve — Solves an upper-triangular linear system.</a>
|
||
</dt>
|
||
<dt id="ientry-id16201">sparsemat_lu, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_lu">igraph_sparsemat_lu — LU decomposition of a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id16296">sparsemat_luresol, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_luresol">igraph_sparsemat_luresol — Solves a linear system using a precomputed LU decomposition.</a>
|
||
</dt>
|
||
<dt id="ientry-id16152">sparsemat_lusol, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_lusol">igraph_sparsemat_lusol — Solves a linear system via LU decomposition.</a>
|
||
</dt>
|
||
<dt id="ientry-id14769">sparsemat_max, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_max">igraph_sparsemat_max — Maximum of a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id14739">sparsemat_min, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_min">igraph_sparsemat_min — Minimum of a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id14799">sparsemat_minmax, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_minmax">igraph_sparsemat_minmax — Minimum and maximum of a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id15329">sparsemat_multiply, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_multiply">igraph_sparsemat_multiply — Matrix multiplication.</a>
|
||
</dt>
|
||
<dt id="ientry-id14438">sparsemat_ncol, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_ncol">igraph_sparsemat_ncol — Number of columns.</a>
|
||
</dt>
|
||
<dt id="ientry-id14972">sparsemat_nonzero_storage, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_nonzero_storage">igraph_sparsemat_nonzero_storage — Returns number of stored entries of a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id14408">sparsemat_nrow, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_nrow">igraph_sparsemat_nrow — Number of rows.</a>
|
||
</dt>
|
||
<dt id="ientry-id16415">sparsemat_numeric_destroy, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_numeric_destroy">igraph_sparsemat_numeric_destroy — Deallocates memory after a numeric decomposition.</a>
|
||
</dt>
|
||
<dt id="ientry-id15198">sparsemat_permute, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_permute">igraph_sparsemat_permute — Permutes the rows and columns of a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id16680">sparsemat_print, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_print">igraph_sparsemat_print — Prints a sparse matrix to a file.</a>
|
||
</dt>
|
||
<dt id="ientry-id16251">sparsemat_qr, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_qr">igraph_sparsemat_qr — QR decomposition of a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id16344">sparsemat_qrresol, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_qrresol">igraph_sparsemat_qrresol — Solves a linear system using a precomputed QR decomposition.</a>
|
||
</dt>
|
||
<dt id="ientry-id14304">sparsemat_realloc, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_realloc">igraph_sparsemat_realloc — Allocates more (or less) memory for a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id15476">sparsemat_resize, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_resize">igraph_sparsemat_resize — Resizes a sparse matrix and clears all the elements.</a>
|
||
</dt>
|
||
<dt id="ientry-id14904">sparsemat_rowsums, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_rowsums">igraph_sparsemat_rowsums — Row-wise sums.</a>
|
||
</dt>
|
||
<dt id="ientry-id15164">sparsemat_scale, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_scale">igraph_sparsemat_scale — Scales a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id15520">sparsemat_sort, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_sort">igraph_sparsemat_sort — Sorts all elements of a sparse matrix by row and column indices.</a>
|
||
</dt>
|
||
<dt id="ientry-id15864">sparsemat_symblu, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_symblu">igraph_sparsemat_symblu — Symbolic LU decomposition.</a>
|
||
</dt>
|
||
<dt id="ientry-id16392">sparsemat_symbolic_destroy, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_symbolic_destroy">igraph_sparsemat_symbolic_destroy — Deallocates memory after a symbolic decomposition.</a>
|
||
</dt>
|
||
<dt id="ientry-id15907">sparsemat_symbqr, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_symbqr">igraph_sparsemat_symbqr — Symbolic QR decomposition.</a>
|
||
</dt>
|
||
<dt id="ientry-id15242">sparsemat_transpose, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_transpose">igraph_sparsemat_transpose — Transposes a sparse matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id14468">sparsemat_type, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_type">igraph_sparsemat_type — Type of a sparse matrix (triplet or column-compressed).</a>
|
||
</dt>
|
||
<dt id="ientry-id16028">sparsemat_usolve, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_usolve">igraph_sparsemat_usolve — Solves an upper-triangular linear system.</a>
|
||
</dt>
|
||
<dt id="ientry-id16067">sparsemat_utsolve, <a class="indexterm" href="igraph-Data-structures.html#igraph_sparsemat_utsolve">igraph_sparsemat_utsolve — Solves a lower-triangular linear system.</a>
|
||
</dt>
|
||
<dt id="ientry-id30383">sparse_adjacency, <a class="indexterm" href="igraph-Generators.html#igraph_sparse_adjacency">igraph_sparse_adjacency — Creates a graph from a sparse adjacency matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id30395">sparse_weighted_adjacency, <a class="indexterm" href="igraph-Generators.html#igraph_sparse_weighted_adjacency">igraph_sparse_weighted_adjacency — Creates a graph from a weighted sparse adjacency matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id37797">spatial_edge_lengths, <a class="indexterm" href="igraph-Spatial.html#igraph_spatial_edge_lengths">igraph_spatial_edge_lengths — Edge lengths based on spatial vertex coordinates.</a>
|
||
</dt>
|
||
<dt id="ientry-id63989">split_join_distance, <a class="indexterm" href="igraph-Community.html#igraph_split_join_distance">igraph_split_join_distance — Calculates the split-join distance of two community structures.</a>
|
||
</dt>
|
||
<dt id="ientry-id30754">square_lattice, <a class="indexterm" href="igraph-Generators.html#igraph_square_lattice">igraph_square_lattice — Arbitrary dimensional square lattices.</a>
|
||
</dt>
|
||
<dt id="ientry-id16866">stack_clear, <a class="indexterm" href="igraph-Data-structures.html#igraph_stack_clear">igraph_stack_clear — Removes all elements from a stack.</a>
|
||
</dt>
|
||
<dt id="ientry-id16751">stack_destroy, <a class="indexterm" href="igraph-Data-structures.html#igraph_stack_destroy">igraph_stack_destroy — Destroys a stack object.</a>
|
||
</dt>
|
||
<dt id="ientry-id16806">stack_empty, <a class="indexterm" href="igraph-Data-structures.html#igraph_stack_empty">igraph_stack_empty — Decides whether a stack object is empty.</a>
|
||
</dt>
|
||
<dt id="ientry-id16716">stack_init, <a class="indexterm" href="igraph-Data-structures.html#igraph_stack_init">igraph_stack_init — Initializes a stack.</a>
|
||
</dt>
|
||
<dt id="ientry-id16919">stack_pop, <a class="indexterm" href="igraph-Data-structures.html#igraph_stack_pop">igraph_stack_pop — Removes and returns an element from the top of a stack.</a>
|
||
</dt>
|
||
<dt id="ientry-id16885">stack_push, <a class="indexterm" href="igraph-Data-structures.html#igraph_stack_push">igraph_stack_push — Places an element on the top of a stack.</a>
|
||
</dt>
|
||
<dt id="ientry-id16772">stack_reserve, <a class="indexterm" href="igraph-Data-structures.html#igraph_stack_reserve">igraph_stack_reserve — Reserve memory.</a>
|
||
</dt>
|
||
<dt id="ientry-id16837">stack_size, <a class="indexterm" href="igraph-Data-structures.html#igraph_stack_size">igraph_stack_size — Returns the number of elements in a stack.</a>
|
||
</dt>
|
||
<dt id="ientry-id16950">stack_top, <a class="indexterm" href="igraph-Data-structures.html#igraph_stack_top">igraph_stack_top — Query top element.</a>
|
||
</dt>
|
||
<dt id="ientry-id30473">star, <a class="indexterm" href="igraph-Generators.html#igraph_star">igraph_star — Creates a star graph, every vertex connects only to the center.</a>
|
||
</dt>
|
||
<dt id="ientry-id35726">static_fitness_game, <a class="indexterm" href="igraph-Games.html#igraph_static_fitness_game">igraph_static_fitness_game — Non-growing random graph with edge probabilities proportional to node fitness scores.</a>
|
||
</dt>
|
||
<dt id="ientry-id35829">static_power_law_game, <a class="indexterm" href="igraph-Games.html#igraph_static_power_law_game">igraph_static_power_law_game — Generates a non-growing random graph with expected power-law degree distributions.</a>
|
||
</dt>
|
||
<dt id="ientry-id74531">STATUS, <a class="indexterm" href="igraph-Advanced.html#IGRAPH_STATUS">IGRAPH_STATUS — Report the status of an igraph function.</a>
|
||
</dt>
|
||
<dt id="ientry-id74600">status, <a class="indexterm" href="igraph-Advanced.html#igraph_status">igraph_status — Reports status from an igraph function.</a>
|
||
</dt>
|
||
<dt id="ientry-id74565">STATUSF, <a class="indexterm" href="igraph-Advanced.html#IGRAPH_STATUSF">IGRAPH_STATUSF — Report the status from an igraph function</a>
|
||
</dt>
|
||
<dt id="ientry-id74639">statusf, <a class="indexterm" href="igraph-Advanced.html#igraph_statusf">igraph_statusf — Report status, more flexible printf-like version.</a>
|
||
</dt>
|
||
<dt id="ientry-id74495">status_handler_stderr, <a class="indexterm" href="igraph-Advanced.html#igraph_status_handler_stderr">igraph_status_handler_stderr — A simple predefined status handler function.</a>
|
||
</dt>
|
||
<dt id="ientry-id74432">status_handler_t, <a class="indexterm" href="igraph-Advanced.html#igraph_status_handler_t">igraph_status_handler_t — The type of the igraph status handler functions</a>
|
||
</dt>
|
||
<dt id="ientry-id17947">STR, <a class="indexterm" href="igraph-Data-structures.html#STR">STR — Indexing string vectors.</a>
|
||
</dt>
|
||
<dt id="ientry-id47806">strength, <a class="indexterm" href="igraph-Structural.html#igraph_strength">igraph_strength — Strength of the vertices, also called weighted vertex degree.</a>
|
||
</dt>
|
||
<dt id="ientry-id4466">strerror, <a class="indexterm" href="igraph-Error.html#igraph_strerror">igraph_strerror — Textual description of an error.</a>
|
||
</dt>
|
||
<dt id="ientry-id18259">strvector_append, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_append">igraph_strvector_append — Concatenates two string vectors.</a>
|
||
</dt>
|
||
<dt id="ientry-id18572">strvector_capacity, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_capacity">igraph_strvector_capacity — Returns the capacity of a string vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id18427">strvector_clear, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_clear">igraph_strvector_clear — Removes all elements from a string vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id17926">strvector_destroy, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_destroy">igraph_strvector_destroy — Frees the memory allocated for the string vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id17990">strvector_get, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_get">igraph_strvector_get — Retrieves an element of a string vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id17856">strvector_init, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_init">igraph_strvector_init — Initializes a string vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id17891">strvector_init_copy, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_init_copy">igraph_strvector_init_copy — Initialization by copying.</a>
|
||
</dt>
|
||
<dt id="ientry-id18311">strvector_merge, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_merge">igraph_strvector_merge — Moves the contents of a string vector to the end of another.</a>
|
||
</dt>
|
||
<dt id="ientry-id18101">strvector_push_back, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_push_back">igraph_strvector_push_back — Adds an element to the back of a string vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id18135">strvector_push_back_len, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_push_back_len">igraph_strvector_push_back_len — Adds a string of the given length to the back of a string vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id18204">strvector_remove, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_remove">igraph_strvector_remove — Removes a single element from a string vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id18228">strvector_remove_section, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_remove_section">igraph_strvector_remove_section — Removes a section from a string vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id18480">strvector_reserve, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_reserve">igraph_strvector_reserve — Reserves memory for a string vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id18446">strvector_resize, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_resize">igraph_strvector_resize — Resizes a string vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id18520">strvector_resize_min, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_resize_min">igraph_strvector_resize_min — Deallocates the unused memory of a string vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id18014">strvector_set, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_set">igraph_strvector_set — Sets an element of the string vector from a string.</a>
|
||
</dt>
|
||
<dt id="ientry-id18055">strvector_set_len, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_set_len">igraph_strvector_set_len — Sets an element of the string vector given a buffer and its size.</a>
|
||
</dt>
|
||
<dt id="ientry-id18543">strvector_size, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_size">igraph_strvector_size — Returns the size of a string vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id18365">strvector_swap, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_swap">igraph_strvector_swap — Swaps all elements of two string vectors.</a>
|
||
</dt>
|
||
<dt id="ientry-id18175">strvector_swap_elements, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_swap_elements">igraph_strvector_swap_elements — Swap two elements in a string vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id18389">strvector_update, <a class="indexterm" href="igraph-Data-structures.html#igraph_strvector_update">igraph_strvector_update — Updates a string vector from another one.</a>
|
||
</dt>
|
||
<dt id="ientry-id62354">st_edge_connectivity, <a class="indexterm" href="igraph-Flows.html#igraph_st_edge_connectivity">igraph_st_edge_connectivity — Edge connectivity of a pair of vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id61783">st_mincut, <a class="indexterm" href="igraph-Flows.html#igraph_st_mincut">igraph_st_mincut — Minimum cut between a source and a target vertex.</a>
|
||
</dt>
|
||
<dt id="ientry-id61864">st_mincut_value, <a class="indexterm" href="igraph-Flows.html#igraph_st_mincut_value">igraph_st_mincut_value — The minimum s-t cut in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id62483">st_vertex_connectivity, <a class="indexterm" href="igraph-Flows.html#igraph_st_vertex_connectivity">igraph_st_vertex_connectivity — The vertex connectivity of a pair of vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id45600">subcomponent, <a class="indexterm" href="igraph-Structural.html#igraph_subcomponent">igraph_subcomponent — The vertices reachable from a given vertex.</a>
|
||
</dt>
|
||
<dt id="ientry-id40143">subgraph_from_edges, <a class="indexterm" href="igraph-Operators.html#igraph_subgraph_from_edges">igraph_subgraph_from_edges — Creates a subgraph with the specified edges and their endpoints.</a>
|
||
</dt>
|
||
<dt id="ientry-id58909">subisomorphic, <a class="indexterm" href="igraph-Isomorphism.html#igraph_subisomorphic">igraph_subisomorphic — Decide subgraph isomorphism.</a>
|
||
</dt>
|
||
<dt id="ientry-id60478">subisomorphic_lad, <a class="indexterm" href="igraph-Isomorphism.html#igraph_subisomorphic_lad">igraph_subisomorphic_lad — Check subgraph isomorphism with the LAD algorithm</a>
|
||
</dt>
|
||
<dt id="ientry-id60084">subisomorphic_vf2, <a class="indexterm" href="igraph-Isomorphism.html#igraph_subisomorphic_vf2">igraph_subisomorphic_vf2 — Decide subgraph isomorphism using VF2</a>
|
||
</dt>
|
||
<dt id="ientry-id31619">symmetric_tree, <a class="indexterm" href="igraph-Generators.html#igraph_symmetric_tree">igraph_symmetric_tree — Creates a symmetric tree with the specified number of branches at each level.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>T</h3>
|
||
<dl>
|
||
<dt id="ientry-id74053">THREAD_SAFE, <a class="indexterm" href="igraph-Advanced.html#IGRAPH_THREAD_SAFE">IGRAPH_THREAD_SAFE — Specifies whether igraph was built in thread-safe mode.</a>
|
||
</dt>
|
||
<dt id="ientry-id2740">TO, <a class="indexterm" href="igraph-Basic.html#IGRAPH_TO">IGRAPH_TO — The target vertex of an edge.</a>
|
||
</dt>
|
||
<dt id="ientry-id55554">topological_sorting, <a class="indexterm" href="igraph-Cycles.html#igraph_topological_sorting">igraph_topological_sorting — Calculate a possible topological sorting of the graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id51712">to_directed, <a class="indexterm" href="igraph-Structural.html#igraph_to_directed">igraph_to_directed — Convert an undirected graph to a directed one.</a>
|
||
</dt>
|
||
<dt id="ientry-id51241">to_prufer, <a class="indexterm" href="igraph-Structural.html#igraph_to_prufer">igraph_to_prufer — Converts a tree to its Prüfer sequence.</a>
|
||
</dt>
|
||
<dt id="ientry-id51767">to_undirected, <a class="indexterm" href="igraph-Structural.html#igraph_to_undirected">igraph_to_undirected — Convert a directed graph to an undirected one.</a>
|
||
</dt>
|
||
<dt id="ientry-id46159">transitive_closure, <a class="indexterm" href="igraph-Structural.html#igraph_transitive_closure">igraph_transitive_closure — Computes the transitive closure of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id51484">transitivity_avglocal_undirected, <a class="indexterm" href="igraph-Structural.html#igraph_transitivity_avglocal_undirected">igraph_transitivity_avglocal_undirected — Average local transitivity (clustering coefficient).</a>
|
||
</dt>
|
||
<dt id="ientry-id51548">transitivity_barrat, <a class="indexterm" href="igraph-Structural.html#igraph_transitivity_barrat">igraph_transitivity_barrat — Weighted local transitivity of some vertices, as defined by A. Barrat.</a>
|
||
</dt>
|
||
<dt id="ientry-id51417">transitivity_local_undirected, <a class="indexterm" href="igraph-Structural.html#igraph_transitivity_local_undirected">igraph_transitivity_local_undirected — The local transitivity (clustering coefficient) of some vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id51300">transitivity_undirected, <a class="indexterm" href="igraph-Structural.html#igraph_transitivity_undirected">igraph_transitivity_undirected — Calculates the transitivity (clustering coefficient) of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id31835">tree_from_parent_vector, <a class="indexterm" href="igraph-Generators.html#igraph_tree_from_parent_vector">igraph_tree_from_parent_vector — Constructs a tree or forest from a vector encoding the parent of each vertex.</a>
|
||
</dt>
|
||
<dt id="ientry-id36387">tree_game, <a class="indexterm" href="igraph-Games.html#igraph_tree_game">igraph_tree_game — Generates a random tree with the given number of nodes.</a>
|
||
</dt>
|
||
<dt id="ientry-id58007">triad_census, <a class="indexterm" href="igraph-Motifs.html#igraph_triad_census">igraph_triad_census — Triad census, as defined by Davis and Leinhardt.</a>
|
||
</dt>
|
||
<dt id="ientry-id30840">triangular_lattice, <a class="indexterm" href="igraph-Generators.html#igraph_triangular_lattice">igraph_triangular_lattice — A triangular lattice with the given shape.</a>
|
||
</dt>
|
||
<dt id="ientry-id53869">trussness, <a class="indexterm" href="igraph-Structural.html#igraph_trussness">igraph_trussness — Finding the "trussness" of the edges in a network.</a>
|
||
</dt>
|
||
<dt id="ientry-id32538">turan, <a class="indexterm" href="igraph-Generators.html#igraph_turan">igraph_turan — Creates a Turán graph.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>U</h3>
|
||
<dl>
|
||
<dt id="ientry-id54345">unfold_tree, <a class="indexterm" href="igraph-Structural.html#igraph_unfold_tree">igraph_unfold_tree — Unfolding a graph into a tree, by possibly multiplicating its vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id38145">union, <a class="indexterm" href="igraph-Operators.html#igraph_union">igraph_union — Calculates the union of two graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id38248">union_many, <a class="indexterm" href="igraph-Operators.html#igraph_union_many">igraph_union_many — Creates the union of many graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id4116">UNLIMITED, <a class="indexterm" href="igraph-Basic.html#IGRAPH_UNLIMITED">IGRAPH_UNLIMITED — Constant for "do not limit results".</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>V</h3>
|
||
<dl>
|
||
<dt id="ientry-id27369">VAB, <a class="indexterm" href="igraph-Attributes.html#VAB">VAB — Query a boolean vertex attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id27453">VABV, <a class="indexterm" href="igraph-Attributes.html#VABV">VABV — Query a boolean vertex attribute for all vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id27192">VAN, <a class="indexterm" href="igraph-Attributes.html#VAN">VAN — Query a numeric vertex attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id27276">VANV, <a class="indexterm" href="igraph-Attributes.html#VANV">VANV — Query a numeric vertex attribute for all vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id27548">VAS, <a class="indexterm" href="igraph-Attributes.html#VAS">VAS — Query a string vertex attribute.</a>
|
||
</dt>
|
||
<dt id="ientry-id27632">VASV, <a class="indexterm" href="igraph-Attributes.html#VASV">VASV — Query a string vertex attribute for all vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id2441">vcount, <a class="indexterm" href="igraph-Basic.html#igraph_vcount">igraph_vcount — The number of vertices in a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id4094">VCOUNT_MAX, <a class="indexterm" href="igraph-Basic.html#IGRAPH_VCOUNT_MAX">IGRAPH_VCOUNT_MAX — The maximum number of vertices supported in igraph graphs.</a>
|
||
</dt>
|
||
<dt id="ientry-id6159">VECTOR, <a class="indexterm" href="igraph-Data-structures.html#VECTOR">VECTOR — Accessing an element of a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id6978">vector_add, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_add">igraph_vector_add — Add two vectors.</a>
|
||
</dt>
|
||
<dt id="ientry-id6917">vector_add_constant, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_add_constant">igraph_vector_add_constant — Add a constant to the vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id7200">vector_all_almost_e, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_all_almost_e">igraph_vector_all_almost_e — Are all elements almost equal?</a>
|
||
</dt>
|
||
<dt id="ientry-id7162">vector_all_e, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_all_e">igraph_vector_all_e — Are all elements equal?</a>
|
||
</dt>
|
||
<dt id="ientry-id7277">vector_all_g, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_all_g">igraph_vector_all_g — Are all elements greater?</a>
|
||
</dt>
|
||
<dt id="ientry-id7349">vector_all_ge, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_all_ge">igraph_vector_all_ge — Are all elements greater or equal?</a>
|
||
</dt>
|
||
<dt id="ientry-id7241">vector_all_l, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_all_l">igraph_vector_all_l — Are all elements less?</a>
|
||
</dt>
|
||
<dt id="ientry-id7313">vector_all_le, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_all_le">igraph_vector_all_le — Are all elements less or equal?</a>
|
||
</dt>
|
||
<dt id="ientry-id6544">vector_append, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_append">igraph_vector_append — Append a vector to another one.</a>
|
||
</dt>
|
||
<dt id="ientry-id8428">vector_binsearch, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_binsearch">igraph_vector_binsearch — Finds an element by binary searching a sorted vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id8478">vector_binsearch_slice, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_binsearch_slice">igraph_vector_binsearch_slice — Finds an element by binary searching a sorted slice of a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id8058">vector_capacity, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_capacity">igraph_vector_capacity — Returns the allocated capacity of the vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id8584">vector_clear, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_clear">igraph_vector_clear — Removes all elements from a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id7644">vector_colex_cmp, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_colex_cmp">igraph_vector_colex_cmp — Colexicographical comparison of two vectors.</a>
|
||
</dt>
|
||
<dt id="ientry-id7758">vector_colex_cmp_untyped, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_colex_cmp_untyped">igraph_vector_colex_cmp_untyped — Colexicographical comparison of two vectors.</a>
|
||
</dt>
|
||
<dt id="ientry-id9074">vector_complex_all_almost_e, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_complex_all_almost_e">igraph_vector_complex_all_almost_e — Are all elements almost equal?</a>
|
||
</dt>
|
||
<dt id="ientry-id8996">vector_complex_create, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_complex_create">igraph_vector_complex_create — Creates a complex vector from a real and imaginary part.</a>
|
||
</dt>
|
||
<dt id="ientry-id9035">vector_complex_create_polar, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_complex_create_polar">igraph_vector_complex_create_polar — Creates a complex matrix from a magnitude and an angle.</a>
|
||
</dt>
|
||
<dt id="ientry-id8923">vector_complex_imag, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_complex_imag">igraph_vector_complex_imag — Gives the imaginary part of a complex vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id8889">vector_complex_real, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_complex_real">igraph_vector_complex_real — Gives the real part of a complex vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id8957">vector_complex_realimag, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_complex_realimag">igraph_vector_complex_realimag — Gives the real and imaginary parts of a complex vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id9115">vector_complex_zapsmall, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_complex_zapsmall">igraph_vector_complex_zapsmall — Replaces small elements of a complex vector by exact zeros.</a>
|
||
</dt>
|
||
<dt id="ientry-id8339">vector_contains, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_contains">igraph_vector_contains — Linear search in a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id8545">vector_contains_sorted, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_contains_sorted">igraph_vector_contains_sorted — Binary search in a sorted vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id6480">vector_copy_to, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_copy_to">igraph_vector_copy_to — Copies the contents of a vector to a C array.</a>
|
||
</dt>
|
||
<dt id="ientry-id6023">vector_destroy, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_destroy">igraph_vector_destroy — Destroys a vector object.</a>
|
||
</dt>
|
||
<dt id="ientry-id9380">vector_difference_and_intersection_sorted, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_difference_and_intersection_sorted">igraph_vector_difference_and_intersection_sorted — Simultaneous difference and intersection of two sorted vectors.</a>
|
||
</dt>
|
||
<dt id="ientry-id9347">vector_difference_sorted, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_difference_sorted">igraph_vector_difference_sorted — Set difference of two sorted vectors.</a>
|
||
</dt>
|
||
<dt id="ientry-id7088">vector_div, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_div">igraph_vector_div — Divide a vector by another one.</a>
|
||
</dt>
|
||
<dt id="ientry-id8000">vector_empty, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_empty">igraph_vector_empty — Decides whether the size of the vector is zero.</a>
|
||
</dt>
|
||
<dt id="ientry-id6075">vector_fill, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_fill">igraph_vector_fill — Fill a vector with a constant element.</a>
|
||
</dt>
|
||
<dt id="ientry-id7125">vector_floor, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_floor">igraph_vector_floor — Transform a real vector to an integer vector by flooring each element.</a>
|
||
</dt>
|
||
<dt id="ientry-id6181">vector_get, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_get">igraph_vector_get — Access an element of a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id6232">vector_get_ptr, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_get_ptr">igraph_vector_get_ptr — Get the address of an element of a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id6356">vector_index, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_index">igraph_vector_index — Extract elements from a vector at specific indices.</a>
|
||
</dt>
|
||
<dt id="ientry-id6397">vector_index_in_place, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_index_in_place">igraph_vector_index_in_place — Extract elements from a vector at specific indices in-place.</a>
|
||
</dt>
|
||
<dt id="ientry-id5858">vector_init, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_init">igraph_vector_init — Initializes a vector object (constructor).</a>
|
||
</dt>
|
||
<dt id="ientry-id5902">vector_init_array, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_init_array">igraph_vector_init_array — Initializes a vector from an ordinary C array (constructor).</a>
|
||
</dt>
|
||
<dt id="ientry-id5943">vector_init_copy, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_init_copy">igraph_vector_init_copy — Initializes a vector from another vector object (constructor).</a>
|
||
</dt>
|
||
<dt id="ientry-id5979">vector_init_range, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_init_range">igraph_vector_init_range — Initializes a vector with a range.</a>
|
||
</dt>
|
||
<dt id="ientry-id8803">vector_insert, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_insert">igraph_vector_insert — Inserts a single element into a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id9305">vector_intersection_size_sorted, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_intersection_size_sorted">igraph_vector_intersection_size_sorted — Intersection size of two sorted vectors.</a>
|
||
</dt>
|
||
<dt id="ientry-id9258">vector_intersect_sorted, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_intersect_sorted">igraph_vector_intersect_sorted — Set intersection of two sorted vectors.</a>
|
||
</dt>
|
||
<dt id="ientry-id8160">vector_isininterval, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_isininterval">igraph_vector_isininterval — Checks if all elements of a vector are in the given interval.</a>
|
||
</dt>
|
||
<dt id="ientry-id8307">vector_is_all_finite, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_is_all_finite">igraph_vector_is_all_finite — Check if all elements are finite.</a>
|
||
</dt>
|
||
<dt id="ientry-id8277">vector_is_any_nan, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_is_any_nan">igraph_vector_is_any_nan — Check if any element is NaN.</a>
|
||
</dt>
|
||
<dt id="ientry-id7385">vector_is_equal, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_is_equal">igraph_vector_is_equal — Are all elements equal?</a>
|
||
</dt>
|
||
<dt id="ientry-id8239">vector_is_nan, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_is_nan">igraph_vector_is_nan — Check for each element if it is NaN.</a>
|
||
</dt>
|
||
<dt id="ientry-id7474">vector_lex_cmp, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_lex_cmp">igraph_vector_lex_cmp — Lexicographical comparison of two vectors (type-safe variant).</a>
|
||
</dt>
|
||
<dt id="ientry-id7587">vector_lex_cmp_untyped, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_lex_cmp_untyped">igraph_vector_lex_cmp_untyped — Lexicographical comparison of two vectors (non-type-safe).</a>
|
||
</dt>
|
||
<dt id="ientry-id18998">vector_list_capacity, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_capacity">igraph_vector_list_capacity — Returns the allocated capacity of the list.</a>
|
||
</dt>
|
||
<dt id="ientry-id19043">vector_list_clear, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_clear">igraph_vector_list_clear — Removes all elements from a list of vectors.</a>
|
||
</dt>
|
||
<dt id="ientry-id18759">vector_list_destroy, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_destroy">igraph_vector_list_destroy — Destroys a list of vectors object.</a>
|
||
</dt>
|
||
<dt id="ientry-id19518">vector_list_discard, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_discard">igraph_vector_list_discard — Discards the item at the given index in the vector list.</a>
|
||
</dt>
|
||
<dt id="ientry-id19556">vector_list_discard_back, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_discard_back">igraph_vector_list_discard_back — Discards the last item in the vector list.</a>
|
||
</dt>
|
||
<dt id="ientry-id19575">vector_list_discard_fast, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_discard_fast">igraph_vector_list_discard_fast — Discards the item at the given index in the vector list and moves the last item to its place.</a>
|
||
</dt>
|
||
<dt id="ientry-id18940">vector_list_empty, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_empty">igraph_vector_list_empty — Decides whether the size of the list is zero.</a>
|
||
</dt>
|
||
<dt id="ientry-id18802">vector_list_get_ptr, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_get_ptr">igraph_vector_list_get_ptr — The address of a vector in the vector list.</a>
|
||
</dt>
|
||
<dt id="ientry-id18682">vector_list_init, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_init">igraph_vector_list_init — Initializes a list of vectors (constructor).</a>
|
||
</dt>
|
||
<dt id="ientry-id18723">vector_list_init_copy, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_init_copy">igraph_vector_list_init_copy — Initializes a list of vectors from another list of vectors (constructor).</a>
|
||
</dt>
|
||
<dt id="ientry-id19296">vector_list_insert, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_insert">igraph_vector_list_insert — Inserts an existing vector into the list, transferring ownership.</a>
|
||
</dt>
|
||
<dt id="ientry-id19339">vector_list_insert_copy, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_insert_copy">igraph_vector_list_insert_copy — Inserts the copy of a vector to the list.</a>
|
||
</dt>
|
||
<dt id="ientry-id19382">vector_list_insert_new, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_insert_new">igraph_vector_list_insert_new — Inserts a new vector into the list.</a>
|
||
</dt>
|
||
<dt id="ientry-id19616">vector_list_permute, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_permute">igraph_vector_list_permute — Permutes the elements of a list in place according to an index vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id19269">vector_list_pop_back, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_pop_back">igraph_vector_list_pop_back — Removes the last item from the vector list and transfer ownership to the caller.</a>
|
||
</dt>
|
||
<dt id="ientry-id19152">vector_list_push_back, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_push_back">igraph_vector_list_push_back — Appends an existing vector to the list, transferring ownership.</a>
|
||
</dt>
|
||
<dt id="ientry-id19193">vector_list_push_back_copy, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_push_back_copy">igraph_vector_list_push_back_copy — Appends the copy of a vector to the list.</a>
|
||
</dt>
|
||
<dt id="ientry-id19230">vector_list_push_back_new, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_push_back_new">igraph_vector_list_push_back_new — Appends a new vector to the list.</a>
|
||
</dt>
|
||
<dt id="ientry-id19426">vector_list_remove, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_remove">igraph_vector_list_remove — Removes the item at the given index from the vector list and transfer ownership to the caller.</a>
|
||
</dt>
|
||
<dt id="ientry-id19472">vector_list_remove_fast, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_remove_fast">igraph_vector_list_remove_fast — Removes the item at the given index in the vector list, move the last item to its place and transfer ownership to the caller.</a>
|
||
</dt>
|
||
<dt id="ientry-id18901">vector_list_replace, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_replace">igraph_vector_list_replace — Replaces the vector at the given index in the list with another one.</a>
|
||
</dt>
|
||
<dt id="ientry-id19062">vector_list_reserve, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_reserve">igraph_vector_list_reserve — Reserves memory for a list.</a>
|
||
</dt>
|
||
<dt id="ientry-id19102">vector_list_resize, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_resize">igraph_vector_list_resize — Resizes the list of vectors.</a>
|
||
</dt>
|
||
<dt id="ientry-id18866">vector_list_set, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_set">igraph_vector_list_set — Sets the vector at the given index in the list.</a>
|
||
</dt>
|
||
<dt id="ientry-id18969">vector_list_size, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_size">igraph_vector_list_size — The size of the vector list.</a>
|
||
</dt>
|
||
<dt id="ientry-id19652">vector_list_sort, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_sort">igraph_vector_list_sort — Sorts the elements of the list into ascending order.</a>
|
||
</dt>
|
||
<dt id="ientry-id19686">vector_list_sort_ind, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_sort_ind">igraph_vector_list_sort_ind — Returns a permutation of indices that sorts the list.</a>
|
||
</dt>
|
||
<dt id="ientry-id19728">vector_list_swap, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_swap">igraph_vector_list_swap — Swaps all elements of two vector lists.</a>
|
||
</dt>
|
||
<dt id="ientry-id19762">vector_list_swap_elements, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_swap_elements">igraph_vector_list_swap_elements — Swap two elements in a vector list.</a>
|
||
</dt>
|
||
<dt id="ientry-id18836">vector_list_tail_ptr, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_list_tail_ptr">igraph_vector_list_tail_ptr — The address of the last vector in the vector list.</a>
|
||
</dt>
|
||
<dt id="ientry-id7848">vector_max, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_max">igraph_vector_max — Largest element of a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id8201">vector_maxdifference, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_maxdifference">igraph_vector_maxdifference — The maximum absolute difference of m1 and m2.</a>
|
||
</dt>
|
||
<dt id="ientry-id7818">vector_min, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_min">igraph_vector_min — Smallest element of a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id7936">vector_minmax, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_minmax">igraph_vector_minmax — Minimum and maximum elements of a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id7052">vector_mul, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_mul">igraph_vector_mul — Multiply two vectors.</a>
|
||
</dt>
|
||
<dt id="ientry-id6051">vector_null, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_null">igraph_vector_null — Sets each element in the vector to zero.</a>
|
||
</dt>
|
||
<dt id="ientry-id6867">vector_permute, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_permute">igraph_vector_permute — Permutes the elements of a vector in place according to an index vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id8774">vector_pop_back, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_pop_back">igraph_vector_pop_back — Removes and returns the last element of a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id8130">vector_prod, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_prod">igraph_vector_prod — Calculates the product of the elements in the vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id9636">vector_ptr_capacity, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_capacity">igraph_vector_ptr_capacity — Returns the allocated capacity of the pointer vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id9665">vector_ptr_clear, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_clear">igraph_vector_ptr_clear — Removes all elements from a pointer vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id9539">vector_ptr_destroy, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_destroy">igraph_vector_ptr_destroy — Destroys a pointer vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id9582">vector_ptr_destroy_all, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_destroy_all">igraph_vector_ptr_destroy_all — Frees all the elements and destroys the pointer vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id9560">vector_ptr_free_all, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_free_all">igraph_vector_ptr_free_all — Frees all the elements of a pointer vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id9887">vector_ptr_get, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_get">igraph_vector_ptr_get — Access an element of a pointer vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id10074">vector_ptr_get_item_destructor, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_get_item_destructor">igraph_vector_ptr_get_item_destructor — Gets the current item destructor for this pointer vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id9461">vector_ptr_init, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_init">igraph_vector_ptr_init — Initialize a pointer vector (constructor).</a>
|
||
</dt>
|
||
<dt id="ientry-id9502">vector_ptr_init_copy, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_init_copy">igraph_vector_ptr_init_copy — Initializes a pointer vector from another one (constructor).</a>
|
||
</dt>
|
||
<dt id="ientry-id9858">vector_ptr_insert, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_insert">igraph_vector_ptr_insert — Inserts a single element into a pointer vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id10025">vector_ptr_permute, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_permute">igraph_vector_ptr_permute — Permutes the elements of a pointer vector in place according to an index vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id9828">vector_ptr_pop_back, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_pop_back">igraph_vector_ptr_pop_back — Removes and returns the last element of a pointer vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id9782">vector_ptr_push_back, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_push_back">igraph_vector_ptr_push_back — Appends an element to the back of a pointer vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id9690">vector_ptr_reserve, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_reserve">igraph_vector_ptr_reserve — Reserves memory for a pointer vector for later use.</a>
|
||
</dt>
|
||
<dt id="ientry-id9709">vector_ptr_resize, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_resize">igraph_vector_ptr_resize — Resizes a pointer vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id9745">vector_ptr_resize_min, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_resize_min">igraph_vector_ptr_resize_min — Deallocate the unused memory of a pointer vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id9922">vector_ptr_set, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_set">igraph_vector_ptr_set — Assign to an element of a pointer vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id10097">vector_ptr_set_item_destructor, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_set_item_destructor">igraph_vector_ptr_set_item_destructor — Sets the item destructor for this pointer vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id10120">VECTOR_PTR_SET_ITEM_DESTRUCTOR, <a class="indexterm" href="igraph-Data-structures.html#IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR">IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR — Sets the item destructor for this pointer vector (macro version).</a>
|
||
</dt>
|
||
<dt id="ientry-id9607">vector_ptr_size, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_size">igraph_vector_ptr_size — Gives the number of elements in the pointer vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id9951">vector_ptr_sort, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_sort">igraph_vector_ptr_sort — Sorts the pointer vector based on an external comparison function.</a>
|
||
</dt>
|
||
<dt id="ientry-id9983">vector_ptr_sort_ind, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_ptr_sort_ind">igraph_vector_ptr_sort_ind — Returns a permutation of indices that sorts a vector of pointers.</a>
|
||
</dt>
|
||
<dt id="ientry-id8735">vector_push_back, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_push_back">igraph_vector_push_back — Appends one element to a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id6099">vector_range, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_range">igraph_vector_range — Updates a vector to store a range.</a>
|
||
</dt>
|
||
<dt id="ientry-id8832">vector_remove, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_remove">igraph_vector_remove — Removes a single element from a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id8856">vector_remove_section, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_remove_section">igraph_vector_remove_section — Deletes a section from a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id8606">vector_reserve, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_reserve">igraph_vector_reserve — Reserves memory for a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id8646">vector_resize, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_resize">igraph_vector_resize — Resize the vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id8698">vector_resize_min, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_resize_min">igraph_vector_resize_min — Deallocate the unused memory of a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id6634">vector_reverse, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_reverse">igraph_vector_reverse — Reverse the elements of a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id6663">vector_reverse_section, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_reverse_section">igraph_vector_reverse_section — Reverse the elements in a section of a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id9190">vector_reverse_sort, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_reverse_sort">igraph_vector_reverse_sort — Sorts the elements of the vector into descending order.</a>
|
||
</dt>
|
||
<dt id="ientry-id6703">vector_rotate_left, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_rotate_left">igraph_vector_rotate_left — Rotates the elements of a vector to the left.</a>
|
||
</dt>
|
||
<dt id="ientry-id6943">vector_scale, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_scale">igraph_vector_scale — Multiplies all elements of a vector by a constant.</a>
|
||
</dt>
|
||
<dt id="ientry-id8375">vector_search, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_search">igraph_vector_search — Searches in a vector from a given position.</a>
|
||
</dt>
|
||
<dt id="ientry-id6283">vector_set, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_set">igraph_vector_set — Assignment to an element of a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id6730">vector_shuffle, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_shuffle">igraph_vector_shuffle — Shuffles a vector in-place using the Fisher-Yates method.</a>
|
||
</dt>
|
||
<dt id="ientry-id8029">vector_size, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_size">igraph_vector_size — The size of the vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id9170">vector_sort, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_sort">igraph_vector_sort — Sorts the elements of the vector into ascending order.</a>
|
||
</dt>
|
||
<dt id="ientry-id9210">vector_sort_ind, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_sort_ind">igraph_vector_sort_ind — Returns a permutation of indices that sorts a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id7015">vector_sub, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_sub">igraph_vector_sub — Subtract a vector from another one.</a>
|
||
</dt>
|
||
<dt id="ientry-id8101">vector_sum, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_sum">igraph_vector_sum — Calculates the sum of the elements in the vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id6579">vector_swap, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_swap">igraph_vector_swap — Swap all elements of two vectors.</a>
|
||
</dt>
|
||
<dt id="ientry-id6605">vector_swap_elements, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_swap_elements">igraph_vector_swap_elements — Swap two elements in a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id6327">vector_tail, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_tail">igraph_vector_tail — Returns the last element in a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id6505">vector_update, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_update">igraph_vector_update — Update a vector from another one.</a>
|
||
</dt>
|
||
<dt id="ientry-id6436">vector_view, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_view">igraph_vector_view — Handle a regular C array as a igraph_vector_t.</a>
|
||
</dt>
|
||
<dt id="ientry-id7907">vector_which_max, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_which_max">igraph_vector_which_max — Gives the index of the maximum element of the vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id7878">vector_which_min, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_which_min">igraph_vector_which_min — Index of the smallest element.</a>
|
||
</dt>
|
||
<dt id="ientry-id7967">vector_which_minmax, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_which_minmax">igraph_vector_which_minmax — Index of the minimum and maximum elements.</a>
|
||
</dt>
|
||
<dt id="ientry-id7423">vector_zapsmall, <a class="indexterm" href="igraph-Data-structures.html#igraph_vector_zapsmall">igraph_vector_zapsmall — Replaces small elements of a vector by exact zeros.</a>
|
||
</dt>
|
||
<dt id="ientry-id73317">version, <a class="indexterm" href="igraph-Nongraph.html#igraph_version">igraph_version — The version of the igraph C library.</a>
|
||
</dt>
|
||
<dt id="ientry-id61020">vertex_coloring_greedy, <a class="indexterm" href="igraph-Coloring.html#igraph_vertex_coloring_greedy">igraph_vertex_coloring_greedy — Computes a vertex coloring using a greedy algorithm.</a>
|
||
</dt>
|
||
<dt id="ientry-id62562">vertex_connectivity, <a class="indexterm" href="igraph-Flows.html#igraph_vertex_connectivity">igraph_vertex_connectivity — The vertex connectivity of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id62685">vertex_disjoint_paths, <a class="indexterm" href="igraph-Flows.html#igraph_vertex_disjoint_paths">igraph_vertex_disjoint_paths — Maximum number of vertex-disjoint paths between two vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id44224">vertex_path_from_edge_path, <a class="indexterm" href="igraph-Structural.html#igraph_vertex_path_from_edge_path">igraph_vertex_path_from_edge_path — Converts a walk of edge IDs to the traversed vertex IDs.</a>
|
||
</dt>
|
||
<dt id="ientry-id23929">vit_create, <a class="indexterm" href="igraph-Iterators.html#igraph_vit_create">igraph_vit_create — Creates a vertex iterator from a vertex selector.</a>
|
||
</dt>
|
||
<dt id="ientry-id24004">vit_destroy, <a class="indexterm" href="igraph-Iterators.html#igraph_vit_destroy">igraph_vit_destroy — Destroys a vertex iterator.</a>
|
||
</dt>
|
||
<dt id="ientry-id24076">VIT_END, <a class="indexterm" href="igraph-Iterators.html#IGRAPH_VIT_END">IGRAPH_VIT_END — Are we at the end?</a>
|
||
</dt>
|
||
<dt id="ientry-id24150">VIT_GET, <a class="indexterm" href="igraph-Iterators.html#IGRAPH_VIT_GET">IGRAPH_VIT_GET — Query the current position.</a>
|
||
</dt>
|
||
<dt id="ientry-id24056">VIT_NEXT, <a class="indexterm" href="igraph-Iterators.html#IGRAPH_VIT_NEXT">IGRAPH_VIT_NEXT — Next vertex.</a>
|
||
</dt>
|
||
<dt id="ientry-id24132">VIT_RESET, <a class="indexterm" href="igraph-Iterators.html#IGRAPH_VIT_RESET">IGRAPH_VIT_RESET — Reset a vertex iterator.</a>
|
||
</dt>
|
||
<dt id="ientry-id24104">VIT_SIZE, <a class="indexterm" href="igraph-Iterators.html#IGRAPH_VIT_SIZE">IGRAPH_VIT_SIZE — Size of a vertex iterator.</a>
|
||
</dt>
|
||
<dt id="ientry-id44120">voronoi, <a class="indexterm" href="igraph-Structural.html#igraph_voronoi">igraph_voronoi — Voronoi partitioning of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id23793">vss_1, <a class="indexterm" href="igraph-Iterators.html#igraph_vss_1">igraph_vss_1 — Vertex set with a single vertex (immediate version).</a>
|
||
</dt>
|
||
<dt id="ientry-id23731">vss_all, <a class="indexterm" href="igraph-Iterators.html#igraph_vss_all">igraph_vss_all — All vertices of a graph (immediate version).</a>
|
||
</dt>
|
||
<dt id="ientry-id23762">vss_none, <a class="indexterm" href="igraph-Iterators.html#igraph_vss_none">igraph_vss_none — Empty vertex set (immediate version).</a>
|
||
</dt>
|
||
<dt id="ientry-id23878">vss_range, <a class="indexterm" href="igraph-Iterators.html#igraph_vss_range">igraph_vss_range — An interval of vertices (immediate version).</a>
|
||
</dt>
|
||
<dt id="ientry-id23834">vss_vector, <a class="indexterm" href="igraph-Iterators.html#igraph_vss_vector">igraph_vss_vector — Vertex set based on a vector (immediate version).</a>
|
||
</dt>
|
||
<dt id="ientry-id23224">vs_1, <a class="indexterm" href="igraph-Iterators.html#igraph_vs_1">igraph_vs_1 — Vertex set with a single vertex.</a>
|
||
</dt>
|
||
<dt id="ientry-id22951">vs_adj, <a class="indexterm" href="igraph-Iterators.html#igraph_vs_adj">igraph_vs_adj — Adjacent vertices of a vertex.</a>
|
||
</dt>
|
||
<dt id="ientry-id22906">vs_all, <a class="indexterm" href="igraph-Iterators.html#igraph_vs_all">igraph_vs_all — Vertex set, all vertices of a graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id23591">vs_copy, <a class="indexterm" href="igraph-Iterators.html#igraph_vs_copy">igraph_vs_copy — Creates a copy of a vertex selector.</a>
|
||
</dt>
|
||
<dt id="ientry-id23625">vs_destroy, <a class="indexterm" href="igraph-Iterators.html#igraph_vs_destroy">igraph_vs_destroy — Destroy a vertex set.</a>
|
||
</dt>
|
||
<dt id="ientry-id23645">vs_is_all, <a class="indexterm" href="igraph-Iterators.html#igraph_vs_is_all">igraph_vs_is_all — Check whether all vertices are included.</a>
|
||
</dt>
|
||
<dt id="ientry-id23042">vs_nonadj, <a class="indexterm" href="igraph-Iterators.html#igraph_vs_nonadj">igraph_vs_nonadj — Non-adjacent vertices of a vertex.</a>
|
||
</dt>
|
||
<dt id="ientry-id23181">vs_none, <a class="indexterm" href="igraph-Iterators.html#igraph_vs_none">igraph_vs_none — Empty vertex set.</a>
|
||
</dt>
|
||
<dt id="ientry-id23498">vs_range, <a class="indexterm" href="igraph-Iterators.html#igraph_vs_range">igraph_vs_range — Vertex set, an interval of vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id23681">vs_size, <a class="indexterm" href="igraph-Iterators.html#igraph_vs_size">igraph_vs_size — Returns the size of the vertex selector.</a>
|
||
</dt>
|
||
<dt id="ientry-id23720">vs_type, <a class="indexterm" href="igraph-Iterators.html#igraph_vs_type">igraph_vs_type — Returns the type of the vertex selector.</a>
|
||
</dt>
|
||
<dt id="ientry-id23272">vs_vector, <a class="indexterm" href="igraph-Iterators.html#igraph_vs_vector">igraph_vs_vector — Vertex set based on a vector.</a>
|
||
</dt>
|
||
<dt id="ientry-id23450">vs_vector_copy, <a class="indexterm" href="igraph-Iterators.html#igraph_vs_vector_copy">igraph_vs_vector_copy — Vertex set based on a vector, with copying.</a>
|
||
</dt>
|
||
<dt id="ientry-id23398">vs_vector_small, <a class="indexterm" href="igraph-Iterators.html#igraph_vs_vector_small">igraph_vs_vector_small — Create a vertex set by giving its elements.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
<div class="indexdiv">
|
||
<h3>W</h3>
|
||
<dl>
|
||
<dt id="ientry-id4557">WARNING, <a class="indexterm" href="igraph-Error.html#IGRAPH_WARNING">IGRAPH_WARNING — Triggers a warning.</a>
|
||
</dt>
|
||
<dt id="ientry-id4603">warning, <a class="indexterm" href="igraph-Error.html#igraph_warning">igraph_warning — Reports a warning.</a>
|
||
</dt>
|
||
<dt id="ientry-id4577">WARNINGF, <a class="indexterm" href="igraph-Error.html#IGRAPH_WARNINGF">IGRAPH_WARNINGF — Triggers a warning, with printf-like syntax.</a>
|
||
</dt>
|
||
<dt id="ientry-id4633">warningf, <a class="indexterm" href="igraph-Error.html#igraph_warningf">igraph_warningf — Reports a warning, printf-like version.</a>
|
||
</dt>
|
||
<dt id="ientry-id4672">warning_handler_ignore, <a class="indexterm" href="igraph-Error.html#igraph_warning_handler_ignore">igraph_warning_handler_ignore — Ignores all warnings.</a>
|
||
</dt>
|
||
<dt id="ientry-id4701">warning_handler_print, <a class="indexterm" href="igraph-Error.html#igraph_warning_handler_print">igraph_warning_handler_print — Prints all warnings to the standard error.</a>
|
||
</dt>
|
||
<dt id="ientry-id4518">warning_handler_t, <a class="indexterm" href="igraph-Error.html#igraph_warning_handler_t">igraph_warning_handler_t — The type of igraph warning handler functions.</a>
|
||
</dt>
|
||
<dt id="ientry-id35916">watts_strogatz_game, <a class="indexterm" href="igraph-Games.html#igraph_watts_strogatz_game">igraph_watts_strogatz_game — The Watts-Strogatz small-world model.</a>
|
||
</dt>
|
||
<dt id="ientry-id30222">weighted_adjacency, <a class="indexterm" href="igraph-Generators.html#igraph_weighted_adjacency">igraph_weighted_adjacency — Creates a graph from a weighted adjacency matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id37050">weighted_biadjacency, <a class="indexterm" href="igraph-Bipartite.html#igraph_weighted_biadjacency">igraph_weighted_biadjacency — Creates a bipartite graph from a weighted bipartite adjacency matrix.</a>
|
||
</dt>
|
||
<dt id="ientry-id57379">weighted_cliques, <a class="indexterm" href="igraph-Cliques.html#igraph_weighted_cliques">igraph_weighted_cliques — Finds all cliques in a given weight range in a vertex weighted graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id57518">weighted_clique_number, <a class="indexterm" href="igraph-Cliques.html#igraph_weighted_clique_number">igraph_weighted_clique_number — Finds the weight of the largest weight clique in the graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id30596">wheel, <a class="indexterm" href="igraph-Generators.html#igraph_wheel">igraph_wheel — Creates a wheel graph, a union of a star and a cycle graph.</a>
|
||
</dt>
|
||
<dt id="ientry-id44508">widest_path_widths_dijkstra, <a class="indexterm" href="igraph-Structural.html#igraph_widest_path_widths_dijkstra">igraph_widest_path_widths_dijkstra — Widths of widest paths between vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id44582">widest_path_widths_floyd_warshall, <a class="indexterm" href="igraph-Structural.html#igraph_widest_path_widths_floyd_warshall">igraph_widest_path_widths_floyd_warshall — Widths of widest paths between vertices.</a>
|
||
</dt>
|
||
<dt id="ientry-id69967">write_graph_dimacs_flow, <a class="indexterm" href="igraph-Foreign.html#igraph_write_graph_dimacs_flow">igraph_write_graph_dimacs_flow — Write a graph in DIMACS format.</a>
|
||
</dt>
|
||
<dt id="ientry-id70987">write_graph_dot, <a class="indexterm" href="igraph-Foreign.html#igraph_write_graph_dot">igraph_write_graph_dot — Write the graph to a stream in DOT format.</a>
|
||
</dt>
|
||
<dt id="ientry-id69397">write_graph_edgelist, <a class="indexterm" href="igraph-Foreign.html#igraph_write_graph_edgelist">igraph_write_graph_edgelist — Writes the edge list of a graph to a file.</a>
|
||
</dt>
|
||
<dt id="ientry-id70439">write_graph_gml, <a class="indexterm" href="igraph-Foreign.html#igraph_write_graph_gml">igraph_write_graph_gml — Write the graph to a stream in GML format.</a>
|
||
</dt>
|
||
<dt id="ientry-id70221">write_graph_graphml, <a class="indexterm" href="igraph-Foreign.html#igraph_write_graph_graphml">igraph_write_graph_graphml — Writes the graph to a file in GraphML format.</a>
|
||
</dt>
|
||
<dt id="ientry-id71071">write_graph_leda, <a class="indexterm" href="igraph-Foreign.html#igraph_write_graph_leda">igraph_write_graph_leda — Write a graph in LEDA native graph format.</a>
|
||
</dt>
|
||
<dt id="ientry-id69742">write_graph_lgl, <a class="indexterm" href="igraph-Foreign.html#igraph_write_graph_lgl">igraph_write_graph_lgl — Writes the graph to a file in .lgl format.</a>
|
||
</dt>
|
||
<dt id="ientry-id69521">write_graph_ncol, <a class="indexterm" href="igraph-Foreign.html#igraph_write_graph_ncol">igraph_write_graph_ncol — Writes the graph to a file in .ncol format.</a>
|
||
</dt>
|
||
<dt id="ientry-id70763">write_graph_pajek, <a class="indexterm" href="igraph-Foreign.html#igraph_write_graph_pajek">igraph_write_graph_pajek — Writes a graph to a file in Pajek format.</a>
|
||
</dt>
|
||
</dl>
|
||
</div>
|
||
</div>
|
||
</div>
|
||
<table class="navigation-footer" width="100%" summary="Navigation footer" cellpadding="2" cellspacing="0"><tr valign="middle">
|
||
<td align="left"><a accesskey="p" href="igraph-Licenses.html"><b>← Chapter 36. Licenses for igraph and this manual</b></a></td>
|
||
<td align="right"></td>
|
||
</tr></table>
|
||
</body>
|
||
</html>
|