graph

type D_Node ¶

type D_Node struct {
	Node  Node
	Value int
	Back  *D_Node
}

type Edge ¶

type Edge struct {
	Destination *Node
	Weight      float64
	Len         int
}

*

• Structure represts edges between nodes.

type Graph ¶

type Graph struct {
	Node map[string]Node
	Edge []Edge
}

type Node ¶

type Node struct {
	Code     string
	Data     interface{}
	OutEdges []Edge
}

*

• Node will take in a string representationa and save
• the nodes input as an interface. There is then an array
• of outbound edges, which which will be used to connect with other nodes

func Dijkstra(g *Graph, source *Node, destination *Node) ([]Node, int)

type Queue ¶

type Queue []*D_Node

func (q Queue) Len() int

func (q Queue) Less(i, j int) bool

func (q *Queue) Pop() interface{}

func (q *Queue) Push(x interface{})

func (q Queue) Swap(i, j int)