Versions in this module Expand all Collapse all v0 v0.6.0 Jun 11, 2022 Changes in this version + type DBitmap struct + func NewDBitmap(order int, reuse *DBitmap) *DBitmap + func (g *DBitmap) DelEdge(u, v groph.VIdx) + func (g *DBitmap) EachEdge(onEdge groph.VisitEdgeW[bool]) error + func (g *DBitmap) EachIn(to groph.VIdx, onSource groph.VisitVertex) error + func (g *DBitmap) EachLeaf(onEdge groph.VisitVertex) error + func (g *DBitmap) EachOut(from groph.VIdx, onDest groph.VisitVertex) error + func (g *DBitmap) EachRoot(onEdge groph.VisitVertex) error + func (g *DBitmap) Edge(u, v groph.VIdx) bool + func (g *DBitmap) InDegree(v groph.VIdx) int + func (g *DBitmap) IsEdge(w bool) bool + func (g *DBitmap) LeafCount() int + func (g *DBitmap) NotEdge() bool + func (g *DBitmap) OutDegree(v groph.VIdx) int + func (g *DBitmap) RootCount() int + func (g *DBitmap) SetEdge(u, v groph.VIdx, w bool) + func (g *DBitmap) Size() int + func (m *DBitmap) Init(flag bool) *DBitmap + func (m *DBitmap) Order() int + func (m *DBitmap) Reset(order int) + type Directed struct + func AsDirected(reuse *Directed[W], notEdge W, weights ...W) (*Directed[W], error) + func NewDirected(order int, notEdge W, reuse *Directed[W]) *Directed[W] + func (g *Directed[W]) DelEdge(u, v groph.VIdx) + func (g *Directed[W]) EachEdge(onEdge groph.VisitEdgeW[W]) error + func (g *Directed[W]) EachIn(to groph.VIdx, onSource groph.VisitVertex) error + func (g *Directed[W]) EachLeaf(onEdge groph.VisitVertex) error + func (g *Directed[W]) EachOut(from groph.VIdx, onDest groph.VisitVertex) error + func (g *Directed[W]) EachRoot(onEdge groph.VisitVertex) error + func (g *Directed[W]) Edge(u, v groph.VIdx) W + func (g *Directed[W]) InDegree(v groph.VIdx) int + func (g *Directed[W]) IsEdge(w W) bool + func (g *Directed[W]) LeafCount() int + func (g *Directed[W]) NotEdge() W + func (g *Directed[W]) OutDegree(v groph.VIdx) int + func (g *Directed[W]) Reset(order int) + func (g *Directed[W]) RootCount() int + func (g *Directed[W]) SetEdge(u, v groph.VIdx, w W) + func (g *Directed[W]) Size() (s int) + func (m *Directed) Order() int + type Undirected struct + func NewUndirected(order int, notEdge W, reuse *Undirected[W]) *Undirected[W] + func (g *Undirected[W]) Degree(v groph.VIdx) int + func (g *Undirected[W]) DelEdge(u, v groph.VIdx) + func (g *Undirected[W]) DelEdgeU(u, v groph.VIdx) + func (g *Undirected[W]) EachAdjacent(of groph.VIdx, onNeighbour groph.VisitVertex) error + func (g *Undirected[W]) EachEdge(onEdge groph.VisitEdgeW[W]) error + func (g *Undirected[W]) Edge(u, v groph.VIdx) W + func (g *Undirected[W]) EdgeU(u, v groph.VIdx) W + func (g *Undirected[W]) IsEdge(w W) bool + func (g *Undirected[W]) NotEdge() W + func (g *Undirected[W]) Reset(order int) + func (g *Undirected[W]) SetEdge(u, v groph.VIdx, w W) + func (g *Undirected[W]) SetEdgeU(u, v groph.VIdx, w W) + func (g *Undirected[W]) Size() int + func (m *Undirected) Order() int