graph

README

graph

graph

TODO

• Extract Shortest -> Dijkstra shortest func taking graph + other
• Extract Simplify to func taking graph returning graph
• TEST

Documentation

Index

• func DijkstraShortest(g Graph, from, to int) (int, []int, map[int]*VertexInfo)
• func RemoveEdge(v *Vertex, edge int)
• func Simplify(g Graph)
• type DLList
  • func (l *DLList) InsertOrdered(v *VertexInfo)
  • func (l *DLList) PopFront() *VertexInfo
• type Graph
  • func New() Graph
  • func (g *Graph) AddBiEdge(from, to, cost int)
  • func (g Graph) AddEdge(from, to, cost int)
  • func (g Graph) String() string
• type Vertex
  • func NewVertex() *Vertex
  • func (v *Vertex) AddEdge(to, cost int)
  • func (v *Vertex) Sort()
• type VertexInfo

Functions

func DijkstraShortest

func DijkstraShortest(g Graph, from, to int) (int, []int, map[int]*VertexInfo)

func RemoveEdge

func RemoveEdge(v *Vertex, edge int)

func Simplify

func Simplify(g Graph)

Types

type DLList

type DLList struct {
	*list.List
}

func (*DLList) InsertOrdered

func (l *DLList) InsertOrdered(v *VertexInfo)

func (*DLList) PopFront

func (l *DLList) PopFront() *VertexInfo

type Graph

type Graph map[int]*Vertex

func New

func New() Graph

func (*Graph) AddBiEdge

func (g *Graph) AddBiEdge(from, to, cost int)

func (Graph) AddEdge

func (g Graph) AddEdge(from, to, cost int)

func (Graph) String

func (g Graph) String() string

type Vertex

type Vertex struct {
	Neighbours map[int]int
	Order      []int
}

func NewVertex

func NewVertex() *Vertex

func (*Vertex) AddEdge

func (v *Vertex) AddEdge(to, cost int)

func (*Vertex) Sort

func (v *Vertex) Sort()

type VertexInfo

type VertexInfo struct {
	ID       int
	Distance int
	Path     []int
}