eu.su.mas.dedale.mas.agents.dedaleDummyAgents.Explo

Class MapRepresentation

java.lang.Object

eu.su.mas.dedale.mas.agents.dedaleDummyAgents.Explo.MapRepresentation

All Implemented Interfaces:

java.io.Serializable

public class MapRepresentation
extends java.lang.Object
implements java.io.Serializable

This simple topology representation only deals with the graph, not its content.
The knowledge representation is not well written (at all), it is just given as a minimal example.
The viewer methods are not independent of the data structure, and the dijkstra is recomputed every-time.

Author:

hc

See Also:

Serialized Form

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	MapRepresentation.MapAttribute A node is open, closed, or agent

Constructor Summary

Constructors

Constructor and Description
MapRepresentation()

Method Summary

Modifier and Type	Method and Description
void	addEdge(java.lang.String idNode1, java.lang.String idNode2) Add the edge if not already existing.
void	addNode(java.lang.String id, MapRepresentation.MapAttribute mapAttribute) Add or replace a node and its attribute
java.util.List<java.lang.String>	getShortestPath(java.lang.String idFrom, java.lang.String idTo) Compute the shortest Path from idFrom to IdTo.
void	loadSavedData() After migration we load the serialized data and recreate the non serializable components (Gui,..)
void	prepareMigration() Before the migration we kill all non serializable components and store their data in a serializable form

Methods inherited from class java.lang.Object

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

Constructor Detail

MapRepresentation

public MapRepresentation()

Method Detail

addNode

public void addNode(java.lang.String id,
                    MapRepresentation.MapAttribute mapAttribute)

Add or replace a node and its attribute

Parameters:

id -

mapAttribute -

addEdge

public void addEdge(java.lang.String idNode1,
                    java.lang.String idNode2)

Add the edge if not already existing.

Parameters:

idNode1 -

idNode2 -

getShortestPath

public java.util.List<java.lang.String> getShortestPath(java.lang.String idFrom,
                                                        java.lang.String idTo)

Compute the shortest Path from idFrom to IdTo. The computation is currently not very efficient

Parameters:

idFrom - id of the origin node

idTo - id of the destination node

Returns:

the list of nodes to follow

prepareMigration

public void prepareMigration()

Before the migration we kill all non serializable components and store their data in a serializable form

loadSavedData

public void loadSavedData()

After migration we load the serialized data and recreate the non serializable components (Gui,..)