be.ac.ulg.montefiore.run.totem.repository.allDistinctRoutes
Class ComputeAllDistinctPath

java.lang.Object
  extended by be.ac.ulg.montefiore.run.totem.repository.allDistinctRoutes.ComputeAllDistinctPath

public class ComputeAllDistinctPath
extends java.lang.Object

Compute and store all distinct route on a SimplifiedDomain. We use a deep first search algorithm to explore all the distinct path. The maxDepth parameter is used to limit the maximum length of a path. All the computed path contains no loop.

Creation date: 1-Jan-2004

Author:
Fabian Skivee (skivee@run.montefiore.ulg.ac.be)

Constructor Summary
ComputeAllDistinctPath(SimplifiedDomain domain)
          Initialise the SimplifiedDomain
 
Method Summary
 java.util.List<SimplifiedPath> compute(int srcNode, int dstNode, int maxDepth)
          Compute all distinct routes from a source to a destination with maxDepth maximum route length.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

ComputeAllDistinctPath

public ComputeAllDistinctPath(SimplifiedDomain domain)
Initialise the SimplifiedDomain

Parameters:
domain -
Method Detail

compute

public java.util.List<SimplifiedPath> compute(int srcNode,
                                              int dstNode,
                                              int maxDepth)
                                       throws NodeNotFoundException,
                                              LinkNotFoundException
Compute all distinct routes from a source to a destination with maxDepth maximum route length.

Parameters:
srcNode -
dstNode -
maxDepth -
Returns:
Throws:
NodeNotFoundException
LinkNotFoundException


Copyright © 2004-2007 Research Unit in Networking, All Rights Reserved.