Documentation
¶
Index ¶
- type Vertex
- func (v *Vertex) AddNeighbor(vertex *Vertex)
- func (v *Vertex) Decrement()
- func (v *Vertex) Degree() int
- func (v *Vertex) Equal(vertex Vertex) bool
- func (v *Vertex) FirstNeighbor() *Vertex
- func (v *Vertex) HasNeighbor(vertex Vertex) bool
- func (v *Vertex) ID() uint64
- func (v *Vertex) Increment()
- func (v *Vertex) Label() string
- func (v *Vertex) Name() string
- func (v *Vertex) NeighborCount() int
- func (v *Vertex) Neighbors() []*Vertex
- func (v *Vertex) RemoveNeighbor(vertex Vertex)
- func (v *Vertex) SetID(id uint64)
- func (v *Vertex) SetName(name string)
- func (v *Vertex) SetValue(value int)
- func (v *Vertex) SortNeighbors()
- func (v *Vertex) Value() int
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Vertex ¶
type Vertex struct {
// contains filtered or unexported fields
}
Vertex implements a graph Vertex
func (*Vertex) AddNeighbor ¶
AddNeighbor adds a neighbor vertex
func (*Vertex) FirstNeighbor ¶
FirstNeighbor returns the first neighbor
func (*Vertex) HasNeighbor ¶
HasNeighbor returns true if the given vertex is already a neighbor
func (*Vertex) NeighborCount ¶
NeighborCount returns the number of edges (neighbors)
func (*Vertex) RemoveNeighbor ¶
RemoveNeighbor removes a neighbor vertex
func (*Vertex) SortNeighbors ¶
func (v *Vertex) SortNeighbors()
SortNeighbors returns a sorted slice of all neighbors
Source Files
Click to show internal directories.
Click to hide internal directories.