terraml.algorithm

Class AStarGraph<Q>

java.lang.Object

terraml.algorithm.AStarGraph<Q>

All Implemented Interfaces:

Iterable<Q>

public class AStarGraph<Q>
extends Object
implements Iterable<Q>

Version:

1.0.0-SNAPSHOT

Author:

M.Çağrı Tepebaşılı - cagritepebasili [at] protonmail [dot] com

Constructor Summary

Constructors

Constructor and Description
AStarGraph(Map<Q,Map<Q,Double>> heuristicMap)

Method Summary

Modifier and Type	Method and Description
void	addEdge(Q nodeIdFirst, Q nodeIdSecond, double length) Adds an edge from source node to destination node.
void	addNode(Q id) Adds a new node to the graph.
Map<AStarNode<Q>,Double>	edgesFrom(Q id) Returns immutable view of the edges
AStarNode<Q>	getNodeData(Q id) The nodedata corresponding to the current nodeId.
Iterator<Q>	iterator()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Detail

AStarGraph

public AStarGraph(Map<Q,Map<Q,Double>> heuristicMap)

Parameters:

heuristicMap -

Method Detail

addNode

public void addNode(Q id)

Adds a new node to the graph. Internally it creates the nodeData and populates the heuristic map concerning input node into node data.

Parameters:

id - the node to be added

addEdge

public void addEdge(Q nodeIdFirst,
                    Q nodeIdSecond,
                    double length)

Adds an edge from source node to destination node. There can only be a single edge from source to node. Adding additional edge would overwrite the value

Parameters:

nodeIdFirst - the first node to be in the edge

nodeIdSecond - the second node to be second node in the edge

length - the length of the edge.

edgesFrom

public Map<AStarNode<Q>,Double> edgesFrom(Q id)

Returns immutable view of the edges

Parameters:

id - the nodeId whose outgoing edge needs to be returned

Returns:

An immutable view of edges leaving that node

getNodeData

public AStarNode<Q> getNodeData(Q id)

The nodedata corresponding to the current nodeId.

Parameters:

id - the nodeId to be returned

Returns:

the nodeData from the

iterator

public Iterator<Q> iterator()

Specified by:

iterator in interface Iterable<Q>