Graphs API
The graphcalc.graphs package contains graph-oriented functionality,
including core graph utilities, data-generation helpers, graph generators,
invariant computation, polytope-related modules, and visualization helpers.
- Graphs Core API
- Core
K_4_free()SimpleGraphaverage_shortest_path_length()bipartite()chordal()claw_free()cograph()connected()connected_and_K_4_free()connected_and_bipartite()connected_and_chordal()connected_and_claw_free()connected_and_cograph()connected_and_cubic()connected_and_eulerian()connected_and_planar()connected_and_regular()connected_and_subcubic()connected_and_triangle_free()cubic()diameter()eulerian()is_C4_free()is_induced_C4_free()isolate_free()nontrivial()order()planar()radius()regular()size()subcubic()tree()triangle_free()closed_neighborhood()neighborhood()set_closed_neighbors()set_neighbors()
- Graphs Data API
- Data
- Graphs Generators API
- Simple Graph Generators
balanced_tree()barabasi_albert_graph()barbell_graph()binomial_tree()complete_graph()cycle_graph()diamond_necklace()erdos_renyi_graph()fan_graph()grid_2d_graph()ladder_graph()path_graph()petersen_graph()powerlaw_cluster_graph()random_geometric_graph()random_regular_graph()star_graph()watts_strogatz_graph()wheel_graph()
- Graphs Invariants API
- classics
- Classics
- coloring predicates
- Coloring Predicates
- core invariants
- Core Invariants
- critical invariants
- Critical Invariants
- cycle invariants
- Cycle Invariants
- degree
- Degree
- domination
- Domination
- graph indices
- Graph Indices
- local invariants
- Local Invariants
- spectral
- Spectral
- transversal invariants
- Transversal Invariants
- zero forcing
- Zero Forcing
- Advanced Coloring Invariants API
- Advanced Coloring Invariants
- Graphs Polytopes API
- Polytopes
- Graphs Visualization API
- Visualization