core

package

v1.0.2 Latest Latest Go to latest Published: Jun 10, 2025 License: GPL-3.0 Imports: 4 Imported by: 0

Details

This section is empty.

This section is empty.

func Path(
	equal func(a, b interface{}) bool,
	from *Node, to *Node, heuristic Heuristic, edgeWeight Heuristic,
) set.GenericOrderedDataSet[*Node]

type Heuristic func(node1, node2 *Node) float64

Heuristic function to calculate cost

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

Node node description

func GetPath(s set.GenericOrderedDataSet[*Node], _ func(a, b interface{}) bool, _ *Node, r bool) []*Node

GetPath return path

func NewNode(value interface{}, previous *Node, neighbors ...*Node) *Node

NewNode return new node

func (n *Node) AddNeighbors(neighbors ...*Node) *Node

func (n *Node) AddNeighborsFn(
	neighbors func(set.GenericOrderedDataSet[*Node],
		*sortedset.SortedSet[*Node, *Node],
		*Node,
	) []*Node,
) *Node

func (n *Node) Cost(gCost, heuristic float64)

Cost calculate cost of node

func (n *Node) Neighbors(visited set.GenericOrderedDataSet[*Node], unvisited *sortedset.SortedSet[*Node, *Node]) []*Node

Neighbors return graph neighbors

func (n *Node) Value() interface{}

Value return node value

Path	Synopsis
astargeo