dijkstra

package module

Go to main page

Versions in this module

v1

v1.4.0

Jun 11, 2024

Changes in this version

+ var ErrVertexNotFound = errors.New("vertex not found")

v1.3.0

Jun 16, 2023

Changes in this version

type Graph

+ func (g *Graph) LongestSafe(src, dest int) (BestPath, error)

+ func (g *Graph) ShortestSafe(src, dest int) (BestPath, error)

v1.2.0

Feb 23, 2023

Changes in this version

+ var ErrAlreadyCalculating = errors.New("already calculating")

+ var ErrNoMap = errors.New("map is not being used/initialised")

+ var ErrNodeNotFound = errors.New("node not found")

type Graph

+ func GenerateWorstCase(nodes int) Graph

v1.1.0

Jul 16, 2021

Changes in this version

type Graph

+ func (g *Graph) RemoveArc(Source, Destination int) error

type Vertex

+ func (v *Vertex) RemoveArc(Destination int)

v1.0.0

Oct 31, 2019

Changes in this version

+ var ErrLoopDetected = errors.New("Infinite loop detected")

+ var ErrMixMapping = errors.New("Potential mixing of integer and string node ID's :" + ErrWrongFormat.Error())

+ var ErrNoPath = errors.New("No path found")

+ var ErrWrongFormat = errors.New("Wrong source format")

+ type BestPath struct

+ Distance int64

+ Path []int

+ type BestPaths []BestPath

+ type Graph struct

+ Verticies []Vertex

+ func Generate(nodes int) Graph

+ func Import(filename string) (g Graph, err error)

+ func NewGraph() *Graph

+ func (g *Graph) AddArc(Source, Destination int, Distance int64) error

+ func (g *Graph) AddMappedArc(Source, Destination string, Distance int64) error

+ func (g *Graph) AddMappedVertex(ID string) int

+ func (g *Graph) AddNewVertex() *Vertex

+ func (g *Graph) AddVertex(ID int) *Vertex

+ func (g *Graph) AddVerticies(verticies ...Vertex)

+ func (g *Graph) GetMapped(a int) (string, error)

+ func (g *Graph) GetMapping(a string) (int, error)

+ func (g *Graph) GetVertex(ID int) (*Vertex, error)

+ func (g *Graph) Longest(src, dest int) (BestPath, error)

+ func (g *Graph) LongestAll(src, dest int) (BestPaths, error)

+ func (g *Graph) Shortest(src, dest int) (BestPath, error)

+ func (g *Graph) ShortestAll(src, dest int) (BestPaths, error)

+ func (g Graph) ExportToFile(filename string) error

+ type Item struct

+ type Vertex struct

+ ID int

+ func NewVertex(ID int) *Vertex

+ func (v *Vertex) AddArc(Destination int, Distance int64)

+ func (v *Vertex) GetArc(Destination int) (distance int64, ok bool)

Other modules containing this package

github.com/RyanCarrier/dijkstra/v2

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL