NodeQueue implements a FIFO queue.
type NodeQueue struct {
// contains filtered or unexported fields
}
func (q *NodeQueue) Dequeue() graph.Node
Dequeue returns the graph.Node at the front of the queue and removes it from the queue.
func (q *NodeQueue) Enqueue(n graph.Node)
Enqueue adds the node n to the back of the queue.
func (q *NodeQueue) Len() int
Len returns the number of graph.Nodes in the queue.
func (q *NodeQueue) Reset()
Reset clears the queue for reuse.
NodeStack implements a LIFO stack of graph.Node.
type NodeStack []graph.Node
func (s *NodeStack) Len() int
Len returns the number of graph.Nodes on the stack.
func (s *NodeStack) Pop() graph.Node
Pop returns the last graph.Node on the stack and removes it from the stack.
func (s *NodeStack) Push(n graph.Node)
Push adds the node n to the stack at the last position.