Documentation
¶
Index ¶
- Constants
- type Graph
- func (self *Graph) AddEdge(From int, To int, edgeValue interface{}) int
- func (self *Graph) AddVertex(vertexValue interface{}) int
- func (self *Graph) BreadthSearch(begin int, predicate func(int) bool) int
- func (self *Graph) Clear()
- func (self *Graph) Copy() *Graph
- func (self *Graph) DepthSearch(begin int, predicate func(int) bool) int
- func (self *Graph) Equal(h *Graph) bool
- func (self *Graph) GetAdjacent(vertex int) []int
- func (self *Graph) GetDegree(vertex int) int
- func (self *Graph) GetEdge(edge int) interface{}
- func (self *Graph) GetEdges(vertex int) []int
- func (self *Graph) GetVertex(vertex int) interface{}
- func (self *Graph) HasEdge(From int, To int) bool
- func (self *Graph) HasEdges(vertex int) bool
- func (self *Graph) IsLeaf(vertex int) bool
- func (self *Graph) RemoveEdge(From int, To int)
- func (self *Graph) RemoveEdges(vertex int)
- func (self *Graph) SetVertex(vertex int, vertexValue interface{})
Constants ¶
View Source
const NIL = -1
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Graph ¶
type Graph struct {
VertexCount int
EdgeCount int
Free int
From []int
Next []int
To []int
Vertices []interface{}
Edges []interface{}
// contains filtered or unexported fields
}
func (*Graph) BreadthSearch ¶
func (*Graph) GetAdjacent ¶
func (*Graph) RemoveEdge ¶
func (*Graph) RemoveEdges ¶
Source Files
Click to show internal directories.
Click to hide internal directories.