Documentation ¶
Index ¶
- type GraphNode
- func (g *GraphNode) AddNeighbor(n *GraphNode)
- func (g *GraphNode) AddRoot(n *GraphNode)
- func (g *GraphNode) Edge(uid, vid int64) graph.Edge
- func (g *GraphNode) EdgeBetween(uid, vid int64) graph.Edge
- func (g *GraphNode) From(id int64) graph.Nodes
- func (g *GraphNode) HasEdgeBetween(uid, vid int64) bool
- func (g *GraphNode) ID() int64
- func (g *GraphNode) Node(id int64) graph.Node
- func (g *GraphNode) Nodes() graph.Nodes
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type GraphNode ¶
type GraphNode struct {
// contains filtered or unexported fields
}
GraphNode is a node in an implicit graph.
func (*GraphNode) AddNeighbor ¶
AddMeighbor adds an edge between g and n.
func (*GraphNode) EdgeBetween ¶
EdgeBetween allows GraphNode to satisfy the graph.Graph interface.
func (*GraphNode) HasEdgeBetween ¶
HasEdgeBetween allows GraphNode to satisfy the graph.Graph interface.
Click to show internal directories.
Click to hide internal directories.