Documentation ¶
Index ¶
- type Builder
- type Graph
- func (g Graph) Child(id uint32) (uint32, error)
- func (g Graph) IntersectionID(id uint32) (int, error)
- func (g Graph) IsIntersection(id uint32) (bool, error)
- func (g Graph) IsLeaf(id uint32) (bool, error)
- func (g Graph) Label(id uint32) (byte, error)
- func (g Graph) NumIntersections() int
- func (g Graph) Root() uint32
- func (g Graph) Sibling(id uint32) (uint32, error)
- func (g Graph) Size() int
- func (g Graph) Value(id uint32) (uint32, error)
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Builder ¶
type Builder struct { Graph // contains filtered or unexported fields }
Builder represents the structure of Directed Acyclic Word Graph builder.
type Graph ¶
type Graph struct {
// contains filtered or unexported fields
}
Graph represents the Directed Acyclic Word Graph.
func (Graph) IntersectionID ¶
IntersectionID returns the intersection unit ID.
func (Graph) IsIntersection ¶
IsIntersection is true if a unit is intersection of other units.
func (Graph) NumIntersections ¶
NumIntersections returns the number of intersection units.
Click to show internal directories.
Click to hide internal directories.