public CompositeRouteFinder(final GameMap map,final HashMap<Match<Territory>,Integer> matches){
  m_map=map;
  m_matches=matches;
  s_logger.finer("Initializing CompositeRouteFinderClass...");
}

public CompositeRouteFinder ( final GameMap map , final HashMap < Match < Territory > , Integer > matches ) { m_map = map ; m_matches = matches ; s_logger . finer ( "Initializing CompositeRouteFinderClass..." ) ; }
this class can find composite routes between two territories . example set of matches : [ friendly land , score : 1 ] [ enemy land , score : 2 ] [ neutral land , score = 4 ] with this example set , an 8 length friendly route is considered equal in score to a 4 length enemy route and a 2 length neutral route . this is because the friendly route score is 1 / 2 of the enemy route score and 1 / 4 of the neutral route score . note that you can choose whatever scores you want , and that the matches can mix and match with each other in any way .
