ShortestPathVirtual Class Reference

Core shortest path class. More...

#include <shortestpath.h>

Inheritance diagram for ShortestPathVirtual:

Public Member Functions
	ShortestPathVirtual (const Box2 &, int, int)
	Create the shortest path layout.
void	EnableBridge (int, int, int)
	Enable bridges.
void	EnableTunnel (int, int, int)
	Enable tunnels.
void	EnableAngle (int)
	Enable angle.

Static Public Attributes
static int	callUpdateNodeSurface = 0
	Number of calls to update.

Protected Member Functions
int	Index (int, int, int) const
	Computes the memory index of a node characterized with its (x,y,a) coordinates.
int	Index (int, int) const
	Computes the memory index of a node characterized with its coordinates.

Protected Attributes
int	nia
	Number of angle layers.
int	m_uumask
	Size of the neighborhood mask.
bool	m_bridge
	Bridge flag.
bool	m_tunnel
	Tunnel flag.
ScalarField2	roadValue
	Roads.

Detailed Description

Core shortest path class.

Constructor & Destructor Documentation

ShortestPathVirtual()

ShortestPathVirtual::ShortestPathVirtual	(	const Box2 &	box,
		int	x,
		int	y )

Create the shortest path layout.

Parameters

box	Region that will be explored.
x,y	Size of the underlying grid.

Member Function Documentation

Index() [1/2]

int ShortestPathVirtual::Index ( int x, int y ) const

inlineprotected

Computes the memory index of a node characterized with its coordinates.

Parameters

x,y	Coordinates on the map.

Index() [2/2]

int ShortestPathVirtual::Index ( int x, int y, int a ) const

inlineprotected

Computes the memory index of a node characterized with its (x,y,a) coordinates.

Note that this function works even if only one angle layer exists.

Parameters

x,y	Coordinates on the map.
a	Angle layer

---

The documentation for this class was generated from the following files:

• E:/X/Code/Libs/LibPath/LibPath/Include/shortestpath.h
• E:/X/Code/Libs/LibPath/LibPath/Source/shortest-path-virtual.cpp
• E:/X/Code/Libs/LibPath/LibPath/Source/shortest-path.cpp