Esempio n. 1
0
  /** Test for {@link TopologyMap#removeNode()}. */
  public final void testRemoveNode2() {
    TopologyMap graph = new TopologyMap(NODE_2);
    graph.addNode(NODE_1);
    graph.addNode(NODE_3);

    graph.addLink(NODE_1, NODE_2, CONNECTION_ID_1);
    graph.addLink(NODE_2, NODE_1, CONNECTION_ID_1);

    graph.addLink(NODE_2, NODE_3, CONNECTION_ID_1);
    graph.addLink(NODE_3, NODE_2, CONNECTION_ID_1);

    assertEquals(4, graph.getLinkCount());
    graph.removeNode(NODE_1);
    graph.removeNode(new TopologyNode(NODE_1));
    assertEquals(2, graph.getNodeCount());
    assertEquals(2, graph.getLinkCount());
  }
Esempio n. 2
0
  /** Simple test for graph setup: NODE_1 - NODE_2 - NODE_3. */
  public final void testGraphSetUp() {
    networkGraph = new TopologyMap(NODE_1);

    networkGraph.addNode(NODE_1);
    networkGraph.addNode(NODE_2);
    networkGraph.addNode(NODE_3);

    assertTrue(GRAPH_CONTAINS_NODE, networkGraph.containsNode(NODE_1));
    assertTrue(GRAPH_CONTAINS_NODE, networkGraph.containsNode(NODE_2));
    assertTrue(GRAPH_CONTAINS_NODE, networkGraph.containsNode(NODE_3));
    assertFalse(GRAPH_DOES_NOT_CONTAIN_NODE, networkGraph.containsNode(NODE_4));
    assertFalse(GRAPH_DOES_NOT_CONTAIN_NODE, networkGraph.containsNode(NODE_5));

    networkGraph.addLink(NODE_1, NODE_2, CONNECTION_ID_1);
    networkGraph.addLink(NODE_2, NODE_3, CONNECTION_ID_1);

    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_1, NODE_2));
    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_2, NODE_3));
    assertFalse(GRAPH_CONTAINS_CHANNEL, networkGraph.containsLinkBetween(NODE_1, NODE_3));
    assertFalse(GRAPH_CONTAINS_CHANNEL, networkGraph.containsLinkBetween(NODE_4, NODE_5));
    assertEquals(DIFFERENT_NUMBER_OF_EDGES_IN_GRAPH_EXPECTED, 2, networkGraph.getLinkCount());
    assertEquals(DIFFERENT_NUMBER_OF_VERTICES_IN_GRAPH_EXPECTED, 3, networkGraph.getNodeCount());
  }
Esempio n. 3
0
  /** Build graph and do manipulations with some {@link LinkStateAdvertisement}s. */
  public final void testEmptyGraphUpdate() {
    networkGraph = new TopologyMap(NODE_1);

    LinkStateAdvertisement linkStateAdvertisement =
        LinkStateAdvertisement.createUpdateLsa(
            NODE_2,
            NODE_2_NAME,
            true,
            ARBITRARY_INT,
            networkGraph.hashCode(),
            true,
            Arrays.asList(
                new TopologyLink[] {
                  new TopologyLink(NODE_2, NODE_1, CONNECTION_ID_1),
                  new TopologyLink(NODE_2, NODE_3, CONNECTION_ID_1)
                }));

    assertTrue(LSA_CAUSED_NO_UPDATE, networkGraph.update(linkStateAdvertisement));

    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_2, NODE_1));
    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_2, NODE_3));

    linkStateAdvertisement =
        LinkStateAdvertisement.createUpdateLsa(
            NODE_2,
            NODE_2_NAME,
            true,
            ARBITRARY_INT + 1,
            networkGraph.hashCode(),
            true,
            Arrays.asList(new TopologyLink[] {}));

    assertTrue(LSA_CAUSED_NO_UPDATE, networkGraph.update(linkStateAdvertisement));

    assertEquals(DIFFERENT_NUMBER_OF_EDGES_IN_GRAPH_EXPECTED, 0, networkGraph.getLinkCount());
    assertEquals(DIFFERENT_NUMBER_OF_VERTICES_IN_GRAPH_EXPECTED, 3, networkGraph.getNodeCount());
  }