@Test public void testGetNeigbors() { assertThat(nonTrivialTopology().neighbors(NODE_A), contains(NODE_E)); }
@Nonnull public Set<OspfNeighborConfigId> neighbors(OspfNeighborConfigId node) { if (!_graph.nodes().contains(node)) { return ImmutableSet.of(); } return _graph.adjacentNodes(node); }
CandidateOspfTopology { @Nonnull public Set<OspfNeighborConfigId> neighbors(OspfNeighborConfigId node) { if (!_graph.nodes().contains(node)) { return ImmutableSet.of(); } return _graph.adjacentNodes(node); } }
CandidateOspfTopology { @Nonnull public Set<OspfNeighborConfigId> neighbors(OspfNeighborConfigId node) { if (!_graph.nodes().contains(node)) { return ImmutableSet.of(); } return _graph.adjacentNodes(node); } CandidateOspfTopology(ValueGraph<OspfNeighborConfigId, OspfSessionStatus> graph); }
CandidateOspfTopology { @Nonnull public Set<OspfNeighborConfigId> neighbors(OspfNeighborConfigId node) { if (!_graph.nodes().contains(node)) { return ImmutableSet.of(); } return _graph.adjacentNodes(node); } CandidateOspfTopology(ValueGraph<OspfNeighborConfigId, OspfSessionStatus> graph); @Nonnull Optional<OspfSessionStatus> getSessionStatus(
      OspfNeighborConfigId n, OspfNeighborConfigId n1); @Nonnull Set<OspfNeighborConfigId> neighbors(OspfNeighborConfigId node); }
CandidateOspfTopology { @Nonnull public Set<OspfNeighborConfigId> neighbors(OspfNeighborConfigId node) { if (!_graph.nodes().contains(node)) { return ImmutableSet.of(); } return _graph.adjacentNodes(node); } CandidateOspfTopology(ValueGraph<OspfNeighborConfigId, OspfSessionStatus> graph); @Nonnull Optional<OspfSessionStatus> getSessionStatus(
      OspfNeighborConfigId n, OspfNeighborConfigId n1); @Nonnull Set<OspfNeighborConfigId> neighbors(OspfNeighborConfigId node); static final CandidateOspfTopology EMPTY; }