Versions in this module Expand all Collapse all v0 v0.6.0 Jun 11, 2022 Changes in this version + type DirectedEdges []Edge + 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 interface + Distance func(to Distancer) float64 + type Edge struct + U groph.VIdx + V groph.VIdx + W any + type Euclidean []Distancer + 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 struct + func NewInForest(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 []W + func (p Point[W]) Distance(to Distancer) (d float64) + type UndirectedEdges []Edge + 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