Test Case Identifier
removeNode
Test Items
The purpose of the test is to verify that the method removeNode functions properly i.e. removes both the specified node and the edge using it. The methods to be used is:
  • public T removeNode(String id)
Input Specification

The possible values of the different categories for the method's inputs and environment are defined in the following text file:
  • Categories definition

  • The combinations of the category values (generated with genpairs) to be used as input for the test cases to be generated are presented in the following csv file:
  • Categories' values
  • Output Specification
    Assert that we can properly remove by calling removeNode on a certain graph
    • Assert that in a graph with many nodes, with node degree > 1 and strict check equal true, if we remove a node that exist, then the node count is equal to the old node count - 1.
    • Assert that in a graph with many nodes and strict check equal true, if we remove a node that not exist, then we should expect a ElementNotFoundException.
    • Assert that in a graph with many nodes and strict check equal false, if we remove a node that not exist, return a node with null value.
    • Assert that in a graph with many nodes, with node degree > 1 and strict check equal false, if we remove a node that exist, then the node count is equal to the old node count - 1.
    • Assert that in a graph with many nodes, with node degree > 1 and strict check equal false, if we remove a node that exist, then the node count is equale to the old node count - 1.
    • Assert that in a graph with many nodes , with node degree > 1 and strict check equal true, if we remove a node that not exist, then we should expect a ElementNotFoundException.
    • Assert that in a graph with 0 nodes and strict check equal true, if we remove a node that not exist, then we should expect a ElementNotFoundException.