Skip to content

Version 10.8 Reference Manual

Home - Graph Theory

Generic graphs (common to directed/undirected)
Undirected graphs
Directed graphs
Bipartite graphs
Matching covered graphs
View classes

Common graphs
Common digraphs
Common graphs and digraphs generators (Cython)
Graph database
Database of strongly regular graphs
Basic graphs
Chessboard graphs
Families of graphs derived from classical geometries over finite fields
Graphs with a given degree sequence
Database of distance regular graphs
Various families of graphs
Intersection graphs
1-skeletons of Platonic solids
Random graphs
Various small graphs
Generation of trees
Graphs from the World Map
ISGCI: Information System on Graph Classes and their Inclusions

Overview of (di)graph data structures
Fast compiled graphs
Fast sparse graphs
Fast dense graphs
Static dense graphs
Static sparse graphs
Static sparse graph backend
Backends for Sage (di)graphs
Interface to run Boost algorithms

Hypergraph generators
Incidence structures (i.e. hypergraphs, i.e. set systems)

Index – Y

yen_k_shortest_simple_paths() (in module sage.graphs.path_enumeration)

Copyright © 2005--2025, The Sage Development Team

Made with Sphinx and @pradyunsg's Furo