@Test public void testGetSeqLinksToEgressNode() { assertEquals(t123.getSeqLinksToEgressNode(n1) , null); assertEquals(t123.getSeqLinksToEgressNode(n2) , Collections.singletonList(link12)); List<Link> path123 = new LinkedList<Link> (); path123.add(link12); path123.add(link23); assertEquals(t123.getSeqLinksToEgressNode(n3) , path123); assertEquals(tStar.getSeqLinksToEgressNode(n1) , null); assertEquals(tStar.getSeqLinksToEgressNode(n2) , Collections.singletonList(link12)); assertEquals(tStar.getSeqLinksToEgressNode(n3) , Collections.singletonList(link13)); }
public List<Link> getSeqLinksToEgressNode(Node egressNode) { final List<Link> seqLinks = pathToReachableEgressNode.get(egressNode); return (seqLinks == null)? null : Collections.unmodifiableList(seqLinks); }
MulticastTree extends NetworkElement { public List<Link> getSeqLinksToEgressNode(Node egressNode) { final List<Link> seqLinks = pathToReachableEgressNode.get(egressNode); return (seqLinks == null)? null : Collections.unmodifiableList(seqLinks); } }
MulticastTree extends NetworkElement { public List<Link> getSeqLinksToEgressNode(Node egressNode) { final List<Link> seqLinks = pathToReachableEgressNode.get(egressNode); return (seqLinks == null)? null : Collections.unmodifiableList(seqLinks); } MulticastTree(NetPlan netPlan , long id , int index,  MulticastDemand demand , Set<Link> links , AttributeMap attributes); }
MulticastTree extends NetworkElement { public List<Link> getSeqLinksToEgressNode(Node egressNode) { final List<Link> seqLinks = pathToReachableEgressNode.get(egressNode); return (seqLinks == null)? null : Collections.unmodifiableList(seqLinks); } MulticastTree(NetPlan netPlan , long id , int index,  MulticastDemand demand , Set<Link> links , AttributeMap attributes); Set<Link> getInitialLinkSet(); void revertToInitialSetOfLinks(); boolean isUpTheInitialLinkSet(); NetworkLayer getLayer(); Set<SharedRiskGroup> getSRGs(); MulticastDemand getMulticastDemand(); Node getIngressNode(); Set<Node> getEgressNodesReached(); boolean isReachedEgressNode(Node n); boolean isReachinAllDemandEgressNodes(); List<Link> getSeqLinksToEgressNode(Node egressNode); void setLinks(Set<Link> newLinkSet); Set<Link> getLinkSet(); boolean isDown(); boolean isTraversingZeroCapLinks(); Set<Node> getNodeSet(); Link getIngressLinkOfNode(Node n); Set<Link> getOutputLinkOfNode(Node n); double getTreeTotalLengthInKm(); double getTreeMaximumPathLengthInKm(); double getTreeAveragePathLengthInKm(); double getTreeMaximumPropagationDelayInMs(); double getTreeAveragePropagationDelayInMs(); int getTreeMaximumPathLengthInHops(); double getTreeAveragePathLengthInHops(); int getTreeNumberOfLinks(); double getCarriedTraffic(); double getOccupiedLinkCapacity(); double getCarriedTrafficInNoFailureState(); double getOccupiedLinkCapacityInNoFailureState(); void setCarriedTraffic(double newCarriedTraffic , double newOccupiedLinkCapacity); void remove(); @Override String toString(); }
MulticastTree extends NetworkElement { public List<Link> getSeqLinksToEgressNode(Node egressNode) { final List<Link> seqLinks = pathToReachableEgressNode.get(egressNode); return (seqLinks == null)? null : Collections.unmodifiableList(seqLinks); } MulticastTree(NetPlan netPlan , long id , int index,  MulticastDemand demand , Set<Link> links , AttributeMap attributes); Set<Link> getInitialLinkSet(); void revertToInitialSetOfLinks(); boolean isUpTheInitialLinkSet(); NetworkLayer getLayer(); Set<SharedRiskGroup> getSRGs(); MulticastDemand getMulticastDemand(); Node getIngressNode(); Set<Node> getEgressNodesReached(); boolean isReachedEgressNode(Node n); boolean isReachinAllDemandEgressNodes(); List<Link> getSeqLinksToEgressNode(Node egressNode); void setLinks(Set<Link> newLinkSet); Set<Link> getLinkSet(); boolean isDown(); boolean isTraversingZeroCapLinks(); Set<Node> getNodeSet(); Link getIngressLinkOfNode(Node n); Set<Link> getOutputLinkOfNode(Node n); double getTreeTotalLengthInKm(); double getTreeMaximumPathLengthInKm(); double getTreeAveragePathLengthInKm(); double getTreeMaximumPropagationDelayInMs(); double getTreeAveragePropagationDelayInMs(); int getTreeMaximumPathLengthInHops(); double getTreeAveragePathLengthInHops(); int getTreeNumberOfLinks(); double getCarriedTraffic(); double getOccupiedLinkCapacity(); double getCarriedTrafficInNoFailureState(); double getOccupiedLinkCapacityInNoFailureState(); void setCarriedTraffic(double newCarriedTraffic , double newOccupiedLinkCapacity); void remove(); @Override String toString();  }