graphs

Documentation

Overview

Package graphs provides some specific graph implementstions.

Index

• type DirectedEdges
  • func (g DirectedEdges) EachEdge(onEdge groph.VisitEdgeW[any]) error
  • func (g DirectedEdges) EachIn(to groph.VIdx, onSource groph.VisitVertex) error
  • func (g DirectedEdges) EachLeaf(onEdge groph.VisitVertex) error
  • func (g DirectedEdges) EachOut(from groph.VIdx, onDest groph.VisitVertex) error
  • func (g DirectedEdges) EachRoot(onEdge groph.VisitVertex) error
  • func (g DirectedEdges) Edge(u, v groph.VIdx) (weight any)
  • func (g DirectedEdges) InDegree(v groph.VIdx) int
  • func (g DirectedEdges) IsEdge(weight any) bool
  • func (g DirectedEdges) LeafCount() int
  • func (g DirectedEdges) NotEdge() any
  • func (g DirectedEdges) Order() int
  • func (g DirectedEdges) OutDegree(v groph.VIdx) int
  • func (g DirectedEdges) RootCount() int
  • func (g DirectedEdges) Size() int
• type Distancer
• type Edge
• type Euclidean
  • func (g Euclidean) Degree(v groph.VIdx) int
  • func (g Euclidean) EachAdjacent(of groph.VIdx, onNeighbour groph.VisitVertex) error
  • func (g Euclidean) EachEdge(onEdge groph.VisitEdgeW[float64]) error
  • func (g Euclidean) Edge(u, v groph.VIdx) (weight float64)
  • func (g Euclidean) EdgeU(u, v groph.VIdx) (weight float64)
  • func (g Euclidean) IsEdge(weight float64) bool
  • func (g Euclidean) NotEdge() float64
  • func (g Euclidean) Order() int
  • func (g Euclidean) Size() int
• type InForest
  • func NewInForest[W comparable](order int, noe W) *InForest[W]
  • func (f *InForest[W]) DelEdge(u, v groph.VIdx)
  • func (f *InForest[W]) EachEdge(onEdge groph.VisitEdgeW[W]) error
  • func (f *InForest[W]) EachIn(to groph.VIdx, onSource groph.VisitVertex) error
  • func (f *InForest[W]) EachLeaf(onEdge groph.VisitVertex) error
  • func (f *InForest[W]) EachOut(from groph.VIdx, onDest groph.VisitVertex) error
  • func (f *InForest[W]) EachRoot(onEdge groph.VisitVertex) error
  • func (f *InForest[W]) Edge(u, v groph.VIdx) (weight W)
  • func (f *InForest[W]) InDegree(v groph.VIdx) int
  • func (f *InForest[W]) IsEdge(weight W) bool
  • func (f *InForest[W]) LeafCount() (res int)
  • func (f *InForest[W]) NotEdge() W
  • func (f *InForest[W]) Order() int
  • func (f *InForest[W]) OutDegree(v groph.VIdx) int
  • func (f *InForest[W]) Reset(order int)
  • func (f *InForest[W]) RootCount() int
  • func (f *InForest[W]) SetEdge(u, v groph.VIdx, weight W)
  • func (f *InForest[W]) Size() (res int)
• type Point
  • func (p Point[W]) Distance(to Distancer) (d float64)
• type UndirectedEdges
  • func (g UndirectedEdges) Degree(v groph.VIdx) int
  • func (g UndirectedEdges) EachAdjacent(of groph.VIdx, onNeighbour groph.VisitVertex) error
  • func (g UndirectedEdges) EachEdge(onEdge groph.VisitEdgeW[any]) error
  • func (g UndirectedEdges) Edge(u, v groph.VIdx) (weight any)
  • func (g UndirectedEdges) EdgeU(u, v groph.VIdx) (weight any)
  • func (g UndirectedEdges) IsEdge(weight any) bool
  • func (g UndirectedEdges) NotEdge() any
  • func (g UndirectedEdges) Order() int
  • func (g UndirectedEdges) Size() int

Types

type DirectedEdges

type DirectedEdges []Edge

func (DirectedEdges) EachEdge

func (g DirectedEdges) EachEdge(onEdge groph.VisitEdgeW[any]) error

func (DirectedEdges) EachIn

func (g DirectedEdges) EachIn(to groph.VIdx, onSource groph.VisitVertex) error

func (DirectedEdges) EachLeaf

func (g DirectedEdges) EachLeaf(onEdge groph.VisitVertex) error

func (DirectedEdges) EachOut

func (g DirectedEdges) EachOut(from groph.VIdx, onDest groph.VisitVertex) error

func (DirectedEdges) EachRoot

func (g DirectedEdges) EachRoot(onEdge groph.VisitVertex) error

func (DirectedEdges) Edge

func (g DirectedEdges) Edge(u, v groph.VIdx) (weight any)

func (DirectedEdges) InDegree

func (g DirectedEdges) InDegree(v groph.VIdx) int

func (DirectedEdges) IsEdge

func (g DirectedEdges) IsEdge(weight any) bool

func (DirectedEdges) LeafCount

func (g DirectedEdges) LeafCount() int

func (DirectedEdges) NotEdge

func (g DirectedEdges) NotEdge() any

func (DirectedEdges) Order

func (g DirectedEdges) Order() int

func (DirectedEdges) OutDegree

func (g DirectedEdges) OutDegree(v groph.VIdx) int

func (DirectedEdges) RootCount

func (g DirectedEdges) RootCount() int

func (DirectedEdges) Size

func (g DirectedEdges) Size() int

type Distancer

type Distancer interface {
	Distance(to Distancer) float64
}

type Edge

type Edge struct {
	U, V groph.VIdx
	W    any
}

TODO sort edges for faster access

type Euclidean

type Euclidean []Distancer

func (Euclidean) Degree

func (g Euclidean) Degree(v groph.VIdx) int

func (Euclidean) EachAdjacent

func (g Euclidean) EachAdjacent(of groph.VIdx, onNeighbour groph.VisitVertex) error

func (Euclidean) EachEdge

func (g Euclidean) EachEdge(onEdge groph.VisitEdgeW[float64]) error

func (Euclidean) Edge

func (g Euclidean) Edge(u, v groph.VIdx) (weight float64)

func (Euclidean) EdgeU

func (g Euclidean) EdgeU(u, v groph.VIdx) (weight float64)

func (Euclidean) IsEdge

func (g Euclidean) IsEdge(weight float64) bool

func (Euclidean) NotEdge

func (g Euclidean) NotEdge() float64

func (Euclidean) Order

func (g Euclidean) Order() int

func (Euclidean) Size

func (g Euclidean) Size() int

type InForest

type InForest[W comparable] struct {
	// contains filtered or unexported fields
}

func NewInForest

func NewInForest[W comparable](order int, noe W) *InForest[W]

func (*InForest[W]) DelEdge

func (f *InForest[W]) DelEdge(u, v groph.VIdx)

func (*InForest[W]) EachEdge

func (f *InForest[W]) EachEdge(onEdge groph.VisitEdgeW[W]) error

func (*InForest[W]) EachIn

func (f *InForest[W]) EachIn(to groph.VIdx, onSource groph.VisitVertex) error

func (*InForest[W]) EachLeaf

func (f *InForest[W]) EachLeaf(onEdge groph.VisitVertex) error

func (*InForest[W]) EachOut

func (f *InForest[W]) EachOut(from groph.VIdx, onDest groph.VisitVertex) error

func (*InForest[W]) EachRoot

func (f *InForest[W]) EachRoot(onEdge groph.VisitVertex) error

func (*InForest[W]) Edge

func (f *InForest[W]) Edge(u, v groph.VIdx) (weight W)

func (*InForest[W]) InDegree

func (f *InForest[W]) InDegree(v groph.VIdx) int

func (*InForest[W]) IsEdge

func (f *InForest[W]) IsEdge(weight W) bool

func (*InForest[W]) LeafCount

func (f *InForest[W]) LeafCount() (res int)

func (*InForest[W]) NotEdge

func (f *InForest[W]) NotEdge() W

func (*InForest[W]) Order

func (f *InForest[W]) Order() int

func (*InForest[W]) OutDegree

func (f *InForest[W]) OutDegree(v groph.VIdx) int

func (*InForest[W]) Reset

func (f *InForest[W]) Reset(order int)

func (*InForest[W]) RootCount

func (f *InForest[W]) RootCount() int

func (*InForest[W]) SetEdge

func (f *InForest[W]) SetEdge(u, v groph.VIdx, weight W)

func (*InForest[W]) Size

func (f *InForest[W]) Size() (res int)

type Point

type Point[W constraints.Float] []W

func (Point[W]) Distance

func (p Point[W]) Distance(to Distancer) (d float64)

type UndirectedEdges

type UndirectedEdges []Edge

func (UndirectedEdges) Degree

func (g UndirectedEdges) Degree(v groph.VIdx) int

func (UndirectedEdges) EachAdjacent

func (g UndirectedEdges) EachAdjacent(of groph.VIdx, onNeighbour groph.VisitVertex) error

func (UndirectedEdges) EachEdge

func (g UndirectedEdges) EachEdge(onEdge groph.VisitEdgeW[any]) error

func (UndirectedEdges) Edge

func (g UndirectedEdges) Edge(u, v groph.VIdx) (weight any)

func (UndirectedEdges) EdgeU

func (g UndirectedEdges) EdgeU(u, v groph.VIdx) (weight any)

func (UndirectedEdges) IsEdge

func (g UndirectedEdges) IsEdge(weight any) bool

func (UndirectedEdges) NotEdge

func (g UndirectedEdges) NotEdge() any

func (UndirectedEdges) Order

func (g UndirectedEdges) Order() int

func (UndirectedEdges) Size

func (g UndirectedEdges) Size() int