77import es .upv .mist .slicing .graphs .cfg .CFG ;
88import es .upv .mist .slicing .graphs .pdg .PDG ;
99import es .upv .mist .slicing .graphs .sdg .SDG ;
10- import org .jetbrains .annotations .NotNull ;
1110
1211import java .util .*;
1312
@@ -31,22 +30,22 @@ public class GraphNode<N extends Node> implements Comparable<GraphNode<?>> {
3130 protected final List <Resolvable <? extends ResolvedMethodLikeDeclaration >> methodCalls = new LinkedList <>();
3231
3332 /** Create a graph node, with id and variable actions generated automatically. */
34- public GraphNode (String label , @ NotNull N astNode ) {
33+ public GraphNode (String label , N astNode ) {
3534 this (IdHelper .getInstance ().getNextId (), label , astNode );
3635 }
3736
3837 /** Create a graph node, with variable actions generated automatically. */
39- protected GraphNode (long id , String label , @ NotNull N astNode ) {
38+ protected GraphNode (long id , String label , N astNode ) {
4039 this (id , label , astNode , new LinkedList <>());
4140 extractVariables ();
4241 }
4342
4443 /** Create a graph node, with id generated automatically. */
45- public GraphNode (String label , @ NotNull N astNode , List <VariableAction > variableActions ) {
44+ public GraphNode (String label , N astNode , List <VariableAction > variableActions ) {
4645 this (IdHelper .getInstance ().getNextId (), label , astNode , variableActions );
4746 }
4847
49- protected GraphNode (long id , String label , @ NotNull N astNode , List <VariableAction > variableActions ) {
48+ protected GraphNode (long id , String label , N astNode , List <VariableAction > variableActions ) {
5049 this .id = id ;
5150 this .label = label ;
5251 this .astNode = astNode ;
@@ -173,7 +172,7 @@ public int hashCode() {
173172 }
174173
175174 @ Override
176- public int compareTo (@ NotNull GraphNode <?> o ) {
175+ public int compareTo (GraphNode <?> o ) {
177176 return Long .compare (id , o .id );
178177 }
179178}
0 commit comments