private final void initTTimeMatrix(){
  log.info("  init hourly ttimeMatrix...");
  Set<Id> zids=new HashSet<Id>();
  for (  Id zid : l2zMapping.values()) {
    zids.add(zid);
  }
  ttimeMatrix.clear();
  for (  Id fzone : zids) {
    Map<Id,Tuple<Double,Integer>> tmap=new HashMap<Id,Tuple<Double,Integer>>();
    ttimeMatrix.put(fzone,tmap);
    for (    Id tzone : zids) {
      Tuple<Double,Integer> tuple=new Tuple<Double,Integer>(0.0,0);
      tmap.put(tzone,tuple);
    }
  }
  log.info("  done.");
}

private final void initTTimeMatrix ( ) { log . info ( "  init hourly ttimeMatrix..." ) ; Set < Id > zids = new HashSet < Id > ( ) ; for ( Id zid : l2zMapping . values ( ) ) { zids . add ( zid ) ; } ttimeMatrix . clear ( ) ; for ( Id fzone : zids ) { Map < Id , Tuple < Double , Integer > > tmap = new HashMap < Id , Tuple < Double , Integer > > ( ) ; ttimeMatrix . put ( fzone , tmap ) ; for ( Id tzone : zids ) { Tuple < Double , Integer > tuple = new Tuple < Double , Integer > ( 0.0 , 0 ) ; tmap . put ( tzone , tuple ) ; } } log . info ( "  done." ) ; }
initializes a place where link2link ttimes can be added into zones ( so i assume that this class will actually run the spanning tree algo for every link . well , actually no , see later . )
