com.badlogic.gdx.ai.pfa

Interface HierarchicalGraph<N>

Type Parameters:

N - Type of node

All Superinterfaces:

Graph<N>

All Known Implementing Classes:

IndexedHierarchicalGraph

public interface HierarchicalGraph<N>
extends Graph<N>

A HierarchicalGraph is a multilevel graph that can be traversed by a HierarchicalPathFinder at any level of its hierarchy.

Method Summary

Modifier and Type	Method and Description
N	convertNodeBetweenLevels(int inputLevel, N node, int outputLevel) Converts the node at the input level into a node at the output level.
int	getLevelCount() Returns the number of levels in this hierarchical graph.
void	setLevel(int level) Switches the graph into the given level so all future calls to the getConnections methods act as if the graph was just a simple, non-hierarchical graph at that level.

Methods inherited from interface com.badlogic.gdx.ai.pfa.Graph

getConnections

Method Detail

getLevelCount

int getLevelCount()

Returns the number of levels in this hierarchical graph.

setLevel

void setLevel(int level)

Switches the graph into the given level so all future calls to the getConnections methods act as if the graph was just a simple, non-hierarchical graph at that level.

Parameters:

level - the level to set

convertNodeBetweenLevels

N convertNodeBetweenLevels(int inputLevel,
                           N node,
                           int outputLevel)

Converts the node at the input level into a node at the output level.

Parameters:

inputLevel - the input level

node - the node at the input level

outputLevel - the output level

Returns:

the node at the output level.