a proxy method that adds the edge e to the graph being tested . in case of immutablegraph implementations , this method should add e to the graph builder and build a newgraph with the current builder state . this method should be used in tests of specific implementations if you want to ensure uniform behavior including side effects with how edges are added elsewhere in the tests . for example , the existing implementations of this method explicitly add the supplied nodes to the graph , and then call graph.addedge to connect the edge to the nodes ; this is not partof the contract of graph.addedge and is done for convenience . in cases where you wantto avoid such side effects e.g. , if you 're testing what happens in your implementation if you add an edge whose end-points do n't already exist in the graph , you should not use this method . concode_field_sep String ERROR_ELEMENT_NOT_IN_GRAPH concode_elem_sep MutableGraph<Integer> graph concode_elem_sep String ERROR_SELF_LOOP concode_elem_sep String ERROR_ADDED_SELF_LOOP concode_elem_sep Integer N1 concode_elem_sep String ERROR_MODIFIABLE_SET concode_elem_sep Integer N4 concode_elem_sep String ERROR_NODE_NOT_IN_GRAPH concode_elem_sep Integer N5 concode_elem_sep Integer NODE_NOT_IN_GRAPH concode_elem_sep Integer N2 concode_elem_sep String NODE_STRING concode_elem_sep Integer N3 concode_field_sep void degree_isolatedNode concode_elem_sep void removeEdge_existingEdge concode_elem_sep boolean addNode concode_elem_sep void adjacentNodes_checkReturnedSetMutability concode_elem_sep void successors_checkReturnedSetMutability concode_elem_sep void removeNode_queryAfterRemoval concode_elem_sep void predecessors_noPredecessors concode_elem_sep void removeNode_existingNode concode_elem_sep void validateGraphState concode_elem_sep void nodes_oneNode concode_elem_sep void outDegree_isolatedNode concode_elem_sep void successors_noSuccessors concode_elem_sep void adjacentNodes_oneEdge concode_elem_sep void inDegree_isolatedNode concode_elem_sep void removeNode_nodeNotPresent concode_elem_sep void assertNodeNotInGraphErrorMessage concode_elem_sep void init concode_elem_sep void nodes_noNodes concode_elem_sep void removeEdge_oneOfMany concode_elem_sep void removeEdge_edgeNotPresent concode_elem_sep void predecessors_checkReturnedSetMutability concode_elem_sep void predecessors_nodeNotInGraph concode_elem_sep void outDegree_nodeNotInGraph concode_elem_sep void successors_nodeNotInGraph concode_elem_sep void degree_nodeNotInGraph concode_elem_sep void adjacentNodes_nodeNotInGraph concode_elem_sep void addNode_newNode concode_elem_sep void inDegree_nodeNotInGraph concode_elem_sep MutableGraph<Integer> createGraph concode_elem_sep void adjacentNodes_noAdjacentNodes concode_elem_sep void nodes_checkReturnedSetMutability concode_elem_sep void degree_oneEdge concode_elem_sep void removeEdge_nodeNotPresent concode_elem_sep void removeNode_antiparallelEdges concode_elem_sep void validateGraph concode_elem_sep void addNode_existingNode
boolean function ( Integer arg0 , Integer arg1 ) { graph . addNode ( arg0 ) ; graph . addNode ( arg1 ) ; return graph . putEdge ( arg0 , arg1 ) ; }