linear

package

v1.7.3-beta.0 Latest Latest Go to latest Published: Jul 21, 2017 License: Apache-2.0, BSD-3-Clause Imports: 1 Imported by: 0

Details

Package linear provides common linear data structures.

This section is empty.

This section is empty.

This section is empty.

type NodeQueue struct {
	// contains filtered or unexported fields
}

NodeQueue implements a FIFO queue.

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.

type NodeStack []graph.Node

NodeStack implements a LIFO stack of 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.