InterLayerPropagationGraph { public SortedSet<IPGNode> getInitialIPGVertices() { return this.initialIPGVertices; } InterLayerPropagationGraph(SortedSet<Demand> initialDemands , SortedSet<Link> initialLinks ,
			SortedSet<Pair<MulticastDemand,Node>> initialMDemands , boolean upWards); SortedSet<IPGNode> getInitialIPGVertices(); SortedMap<Demand, IPGNode> getDemand2IGPVertexMap(); SortedMap<Link, IPGNode> getLink2IGPVertexMap(); SortedMap<Pair<MulticastDemand, Node>, IPGNode> getmDemandAndNode2VertexMap(); boolean isUpWardsTrueDownwardsFalse(); DirectedAcyclicGraph<IPGNode, Object> getInterLayerPropagationGraph(); SortedSet<Link> getLinksInGraph(); SortedSet<Demand> getDemandsInGraph(); SortedSet<Pair<MulticastDemand,Node>> getMulticastDemandFlowsInGraph();  }
@Test public void testGetInitialIPGVertices() { assertEquals (g_demand23_L2_up.getInitialIPGVertices().iterator().next().getDemand() , demand23_L2); assertEquals (g_mDemand123_L2_N1_down.getInitialIPGVertices().iterator().next().getMulticastDemandAndNode() , Pair.of(mDemand123_L2 , n2)); assertEquals (g_link13_L0_down.getInitialIPGVertices().iterator().next().getLink() , link13_L0); }