X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/mapping.git/blobdiff_plain/202cc2c0bbcb6a6a3a7f6f9fc2ddfd2836a35a8e..e9ad3655aa50dde188c7a9b905cc5fe81fba664f:/javadoc/and/Mapping/QM.html diff --git a/javadoc/and/Mapping/QM.html b/javadoc/and/Mapping/QM.html index 4f35839..ebba3fb 100644 --- a/javadoc/and/Mapping/QM.html +++ b/javadoc/and/Mapping/QM.html @@ -2,12 +2,12 @@ - + QM - + @@ -166,7 +166,7 @@ Implementation of the AIAC Quick Quality Map (AIAC-QM) algorithm  GNode -getOtherGNode() +getOtherGNode(java.util.ArrayList<GNode> _ag)
          Find a new node, which may not takes part into the computation process. @@ -289,18 +289,18 @@ public GNode
-

+

getOtherGNode

-public GNode getOtherGNode()
+public GNode getOtherGNode(java.util.ArrayList<GNode> _ag)
-
Description copied from class: Algo
+
Description copied from class: Algo
Find a new node, which may not takes part into the computation process. Typically such kind of node is used to create a new spawner or a new super-node, in order to bring fault tolerance.

-
Specified by:
getOtherGNode in class Algo
+
Specified by:
getOtherGNode in class Algo