algorithms

package module

v0.0.0-...-d456db9 Latest Latest Go to latest Published: Aug 20, 2021 License: MIT Imports: 4 Imported by: 0

Details

This section is empty.

This section is empty.

This section is empty.

type Amplitude struct {
	Graph    s.Graph_t
	Solution s.Path_t
}

func (a Amplitude) Solve() (s.Path_t, error)

First in amplitude

type Astar struct {
	Graph    s.Graph_t
	Solution s.Path_t
}

func (a Astar) Solve() (s.Path_t, error)

Dijkstra's algorithm

type Bnb struct {
	Graph    s.Graph_t
	Solution s.Path_t
}

func (a Bnb) Solve() (s.Path_t, error)

Branch and bounds depth first search The algorithm checks if a node has already been visited before exploring it

type Dfs struct {
	Graph    s.Graph_t
	Solution s.Path_t
}

func (a Dfs) Solve(max_depth int) (s.Path_t, error)

Depth first search. Set max depth to -1 for no limit.

type Dijkstra struct {
	Graph    s.Graph_t
	Solution s.Path_t
}

func (a Dijkstra) Solve() (s.Path_t, error)

Dijkstra's algorithm

type IDAstar struct {
	Graph    s.Graph_t
	Solution s.Path_t
}

func (a IDAstar) Solve(max_depth int) (s.Path_t, error)

IDA star search. Set max depth to -1 for no limit.

type IterativeSolver interface {
	Solve(max_depth int) (s.Path_t, error)
}

type Solver interface {
	Solve() (s.Path_t, error)
}

Each algorithm will implement the solver interface