Skip to main content

rust_igraph/algorithms/constructors/
mod.rs

1//! Deterministic graph constructors.
2//!
3//! Counterpart of igraph's `src/constructors/` family: each module here
4//! ports one (or a small group of) deterministic generator(s) — graphs
5//! whose shape is fully determined by their integer parameters, with no
6//! RNG involvement.
7
8pub mod adjacency;
9pub mod atlas;
10pub mod atlas_edges;
11pub mod biadjacency;
12pub mod circulant;
13pub mod create;
14pub mod create_bipartite;
15pub mod de_bruijn;
16pub mod extended_chordal_ring;
17pub mod famous;
18pub mod full;
19pub mod full_bipartite;
20pub mod full_citation;
21pub mod full_multipartite;
22pub mod generalized_petersen;
23pub mod hamming;
24pub mod hexagonal_lattice;
25pub mod hypercube;
26pub mod kary_tree;
27pub mod kautz;
28pub mod lcf;
29pub mod linegraph;
30pub mod mycielskian;
31pub mod prufer;
32pub mod realize_bipartite_degree_sequence;
33pub mod realize_degree_sequence;
34pub mod realize_directed_degree_sequence;
35pub mod regular_tree;
36pub mod ring;
37pub mod square_lattice;
38pub mod star;
39pub mod symmetric_tree;
40pub mod tree_from_parent_vector;
41pub mod triangular_lattice;
42pub mod turan;
43pub mod weighted_adjacency;
44pub mod weighted_biadjacency;
45pub mod wheel;