This is a C++ Wrapper for igraph library. This project’s goal is to automatically manage the life cycle of igraph objects and to provide exception mechanism to handle errors.

List of objects

Graph

• Graph — igraph_t

Vector

• Vector — igraph_vector_t
• VectorPtr<> — igraph_vector_ptr_t

Iterator

• VertexIterator — igraph_vit_t
• EdgeIterator — igraph_eit_t

Selector

• VertexSelector — igraph_vs_t
• EdgeSelector — igraph_es_t

Matrix

• Matrix — igraph_matrix_t

Sparse matrix

• igraph_spmatrix_t
• igraph_sparsemat_t

Stack

• igraph_stack_t

Double-ended queues

• igraph_dqueue_t

Maximum and minimum heaps

• igraph_heap_t

String vector

• igraph_strvector_t

Adjacency list

• igraph_adjlist_t

Incident edges

• igraph_inclist_t
• igraph_lazy_inclist_t

Random numbers

• igraph_rnd_t

Attributes

• igraph_attribute_table_t

Hierarchical random graphs

• igraph_hrg_t

Graph generators

Deterministic graph generators

• Graph() — igraph_create
• Graph({}) — igraph_small
• Graph::AdjacencyMatrix — igraph_adacency
• Weighted adjacency matrix — igraph_weighted_adjacency
• Adjacency list — igraph_adjlist
• Graph::Star — igraph_star
• Graph::Lattice — igraph_lattice
• Graph::Ring — igraph_ring
• Graph::Tree — igraph_tree
• Graph::Full — igraph_full
• Graph::FullCitation — igraph_full_citation
• Graph::Famous — igraph_famous
• Graph::LCF — igraph_lcf & igraph_lcf_vector
• Graph::Atlas — igraph_atlas
• Graph::deBruijn — igraph_de_bruijn
• Graph::Kautz — igraph_kautz
• Graph::ExtendedChordalRing — igraph_extended_chordal_ring
• Graph::ConnectNeighborhood — igraph_connect_neighborhood

Randomized graph generators

• Graph::GRG — igraph_grg_game
• Graph::Barabasi — igraph_barabasi_game
• Graph::ErdosRenyi — igraph_erdos_renyi_game
• Graph::WattsStrogatz — igraph_watts_strogatz_game
• rewire_edges — igraph_rewire_edges
• Graph::DegreeSequence — igraph_degree_sequence_game
• Graph::kRegular — igraph_k_regular_game
• Graph::StaticFitness — igraph_static_fitness_game
• Graph::StaticPowerLaw — igraph_static_power_law_game
• Graph::ForestFire — igraph_forest_fire_game
• rewire — igraph_rewire
• GrowingRandom — igraph_growing_random_game
• CallawayTraits — igraph_callaway_traits_game
• Establishment — igraph_establishment_game
• Preference — igraph_preference_game
• AsymmetricPreference — igraph_asymmetric_preference_game
• RecentDegree — igraph_recent_degree_game
• BarabásiAging — igraph_barabasi_aging_game
• RecentDegreeAging — igraph_recent_degree_aging_game
• CitedType — igraph_cited_type_game
• CitingCitedType — igraph_citing_cited_type
• StochasticBlockModel — igraph_sbm_game

Games on graphs

Microscopic update rules

• igraph_deterministic_optimal_imitation
• igraph_moran_process
• igraph_roulette_wheel_imitation
• stochastic_imitation

Library functions

Structural properties

• Basic properties
• Shortest path related functions — Partial 12/18
• Neighborhood — Partial 1/3
• Graph components — Partial 5/7
• Degree sequences
• Centrality measures — Partial ?/12
• Estimating centality measures
• Centralization
• Similarity measures
• Spanning trees
• Transitivity and clustering coefficient
• Directedness conversion
• Spectral properties
• Non-simple graphs: multiple and loop edges
• Mixing patterns
• K-Cores
• Topological sorting & directed acyclic graphs
• Maximum cardinality search, graph decomposition, chordal graphs
• Matchings
• Line graphs
• Unfolding a graph into a tree
• Other operations
• Graph visitors, BFS & DFS
• Cliques & Independent Vertex Sets
• Graph Isomorphism
• Motifs, dyad census & triad census
• Graph layouts
• Maximum flows, minimum cuts & releated measures
• Reading & writing graphs from and to files
• Graph layouts
• Vertex separatos
• Community structure
• Graphlets — Not planned
• Spectral coase graining — Not planned
• Graph operators
• BLAS — Not planned
• Bipartite — Not planned
• Multi-thread support — Not planned
• Not graph-related functions — Not planned