Versions in this module Expand all Collapse all v0 v0.2.0 Apr 21, 2021 v0.1.0 Aug 9, 2020 Changes in this version + func AdjacencyMatrixEncode(g Graph) string + func AllMaximalCliques(g Graph, c chan []int) + func BiconnectedComponents(g Graph) ([][]int, []int) + func CanonicalIsomorph(g Graph) []int + func CanonicalIsomorphAllocated(n, m int, neighbours [][]int, op *CanonicalOrderedPartition, ...) ([]int, disjoint.Set, [][]int) + func CanonicalIsomorphFull(g Graph, vertexClasses [][]int) ([]int, disjoint.Set, [][]int) + func ChromaticIndex(g Graph) (chromaticIndex int, colouredEdges []byte) + func ChromaticNumber(g Graph) (chromaticNumber int, colouring []int) + func ChromaticPolynomial(g EditableGraph) []int + func CliqueNumber(g Graph) int + func ConnectedComponent(g Graph, v int) []int + func ConnectedComponents(g Graph) [][]int + func Contract(g EditableGraph, i, j int) + func Degeneracy(g Graph) (d int, order []int) + func Diameter(g Graph) int + func Distance(g Graph, i, j int) int + func Eccentricity(g Graph) []int + func Equal(g, h Graph) bool + func Girth(g Graph) int + func Graph6Encode(g Graph) string + func GreedyColor(g Graph, order []int) (int, []int) + func IndependenceNumber(g Graph) int + func IsKColorable(g Graph, k int) (ok bool, colouring []int) + func IsPlanar(g Graph) bool + func IsProperColouring(g Graph, colouring []int) bool + func MaxDegree(g Graph) int + func MinDegree(g Graph) int + func MulticodeEncode(g Graph) []byte + func NumberOfCycles(g EditableGraph) []int + func NumberOfInducedCycles(g Graph, maxLength int) []int + func NumberOfInducedPaths(g Graph, maxLength int) []int + func PruferEncode(g Graph) []int + func Radius(g Graph) int + func RandomMaximalClique(g Graph, seed int64) []int + func Sparse6Encode(g Graph) string + func SplitEdge(g EditableGraph, i, j int) + type CanonicalOptions struct + CheckViability bool + ViableBits uint + type CanonicalOrderedPartition struct + func NewOrderedPartition(n, m int, vertexClasses [][]int) *CanonicalOrderedPartition + func (op *CanonicalOrderedPartition) Reset(n, m int, vertexClasses [][]int) + type CanonicalStorage struct + func NewStorage(n, m int) *CanonicalStorage + type DenseGraph struct + DegreeSequence []int + Edges []byte + NumberOfEdges int + NumberOfVertices int + func BipartiteKneserGraph(n, k int) *DenseGraph + func CirculantBipartiteGraph(n int, m int, diffs ...int) *DenseGraph + func CirculantGraph(n int, diffs ...int) *DenseGraph + func ComplementDense(g Graph) *DenseGraph + func CompleteGraph(n int) *DenseGraph + func CompletePartiteGraph(nums ...int) *DenseGraph + func Cycle(n int) *DenseGraph + func FlowerSnark(n int) *DenseGraph + func FoldedHypercubeGraph(dim int) *DenseGraph + func FriendshipGraph(n int) *DenseGraph + func GeneralisedPetersenGraph(n, k int) *DenseGraph + func Graph6Decode(s string) (*DenseGraph, error) + func HypercubeGraph(dim int) *DenseGraph + func KneserGraph(n, k int) *DenseGraph + func LineGraphDense(g Graph) *DenseGraph + func MulticodeDecode(s []byte) *DenseGraph + func MulticodeDecodeMultiple(s []byte) []*DenseGraph + func NewDense(n int, edges []byte) *DenseGraph + func Path(n int) *DenseGraph + func PruferDecode(p []int) *DenseGraph + func RandomGraph(n int, p float64, seed int64) *DenseGraph + func RandomTree(n int, seed int64) *DenseGraph + func RookGraph(n, m int) *DenseGraph + func Star(n int) *DenseGraph + func (g *DenseGraph) AddEdge(i, j int) + func (g *DenseGraph) AddVertex(neighbours []int) + func (g *DenseGraph) Copy() EditableGraph + func (g *DenseGraph) InducedSubgraph(V []int) EditableGraph + func (g *DenseGraph) RemoveEdge(i, j int) + func (g *DenseGraph) RemoveVertex(v int) + func (g DenseGraph) Degrees() []int + func (g DenseGraph) IsEdge(i, j int) bool + func (g DenseGraph) M() int + func (g DenseGraph) N() int + func (g DenseGraph) Neighbours(v int) []int + type EditableGraph interface + AddEdge func(i, j int) + AddVertex func(neighbours []int) + Copy func() EditableGraph + InducedSubgraph func(V []int) EditableGraph + RemoveEdge func(i, j int) + RemoveVertex func(i int) + type Graph interface + Degrees func() []int + IsEdge func(i, j int) bool + M func() int + N func() int + Neighbours func(v int) []int + func Complement(g Graph) Graph + func InducedSubgraph(g Graph, V []int) Graph + type SparseGraph struct + DegreeSequence []int + Neighbourhoods []sortints.SortedInts + NumberOfEdges int + NumberOfVertices int + func NewSparse(n int, neighbourhoods []sortints.SortedInts) *SparseGraph + func Sparse6Decode(s string) (*SparseGraph, error) + func (g *SparseGraph) AddEdge(i, j int) + func (g *SparseGraph) AddVertex(neighbours []int) + func (g *SparseGraph) RemoveEdge(i, j int) + func (g *SparseGraph) RemoveVertex(i int) + func (g SparseGraph) Copy() EditableGraph + func (g SparseGraph) Degrees() []int + func (g SparseGraph) InducedSubgraph(V []int) EditableGraph + func (g SparseGraph) IsEdge(i, j int) bool + func (g SparseGraph) M() int + func (g SparseGraph) N() int + func (g SparseGraph) Neighbours(v int) []int