Navigation
index
modules
|
next
|
Sage Reference Manual
»
Graph Theory
»
Graph Theory
¶
Graph objects and methods
¶
Generic graphs
Undirected graphs
Directed graphs
Bipartite graphs
Constructors and databases
¶
Common Graphs (Graph Generators)
Common Digraphs
Common graphs and digraphs generators (Cython)
Graph database
Information System on Graph Classes and their Inclusions
Low-level implementation
¶
Fast compiled graphs
Fast sparse graphs
Fast dense graphs
Static Sparse Graphs
Static sparse graph backend
Implements various backends for Sage graphs.
Hypergraphs
¶
Hypergraph generators
Hypergraphs
Libraries of algorithms
¶
Graph coloring
Cliquer: routines for finding cliques in graphs
Comparability and permutation graphs
Line graphs
Spanning trees
PQ-Trees
Generation of trees
Matching Polynomial Routine
Linear Extensions of Directed Acyclic Graphs.
Schnyder’s Algorithm for straight-line planar embeddings.
Graph Plotting
Vertex separation
Rank Decompositions of graphs
Products of graphs
Modular decomposition
Convexity properties of graphs
Weakly chordal graphs
Distances/shortest paths between all pairs of vertices
LaTeX options for graphs
Lists of graphs
Hyperbolicity of a graph
Indices and Tables
¶
Index
Module Index
Search Page
Table Of Contents
Graph Theory
Graph objects and methods
Constructors and databases
Low-level implementation
Hypergraphs
Libraries of algorithms
Indices and Tables
Next topic
Generic graphs
This Page
Show Source
Quick search
Enter search terms or a module, class or function name.
Navigation
index
modules
|
next
|
Sage Reference Manual
»
Graph Theory
»