private void createDelayMatrix(TopologicalGraph graph,boolean directed){
  mTotalNodeNum=graph.getNumberOfNodes();
  mDelayMatrix=new float[mTotalNodeNum][mTotalNodeNum];
  for (int row=0; row < mTotalNodeNum; ++row) {
    for (int col=0; col < mTotalNodeNum; ++col) {
      mDelayMatrix[row][col]=Float.MAX_VALUE;
    }
  }
  Iterator<TopologicalLink> itr=graph.getLinkIterator();
  TopologicalLink edge;
  while (itr.hasNext()) {
    edge=itr.next();
    mDelayMatrix[edge.getSrcNodeID()][edge.getDestNodeID()]=edge.getLinkDelay();
    if (!directed) {
      mDelayMatrix[edge.getDestNodeID()][edge.getSrcNodeID()]=edge.getLinkDelay();
    }
  }
}

private void createDelayMatrix ( TopologicalGraph graph , boolean directed ) { mTotalNodeNum = graph . getNumberOfNodes ( ) ; mDelayMatrix = new float [ mTotalNodeNum ] [ mTotalNodeNum ] ; for ( int row = 0 ; row < mTotalNodeNum ; ++ row ) { for ( int col = 0 ; col < mTotalNodeNum ; ++ col ) { mDelayMatrix [ row ] [ col ] = Float . MAX_VALUE ; } } Iterator < TopologicalLink > itr = graph . getLinkIterator ( ) ; TopologicalLink edge ; while ( itr . hasNext ( ) ) { edge = itr . next ( ) ; mDelayMatrix [ edge . getSrcNodeID ( ) ] [ edge . getDestNodeID ( ) ] = edge . getLinkDelay ( ) ; if ( ! directed ) { mDelayMatrix [ edge . getDestNodeID ( ) ] [ edge . getSrcNodeID ( ) ] = edge . getLinkDelay ( ) ; } } }
creates all internal necessary network - distance structures from the given graph . for similarity , we assume all communication - distances are symmetrical , thus leading to an undirected network .
