369 void SubGraph::RemoveRuleStarts (int startPoint, int endPoint)  in RemoveRuleStarts()  argument
371     if (startPoint == -1 && endPoint == -1) {  in RemoveRuleStarts()
372         startPoint= startId;  in RemoveRuleStarts()
382     ProcessBegins (startPoint, endPoint, BEGINRULE_LABEL, nodeList, 0, visitList, numVertex);  in RemoveRuleStarts()
390 void SubGraph::RemoveRuleEnds (int startPoint, int endPoint)  in RemoveRuleEnds()  argument
392     if (startPoint == -1 && endPoint == -1) {  in RemoveRuleEnds()
393         startPoint= startId;  in RemoveRuleEnds()
403     ProcessEnds (endPoint, startPoint, ENDRULE_LABEL, nodeList, 0, visitList, numVertex);  in RemoveRuleEnds()
411 void SubGraph::RemoveNulls (int startPoint, int endPoint)  in RemoveNulls()  argument
413     if (startPoint == -1 && endPoint == -1) {  in RemoveNulls()
414         startPoint= startId;  in RemoveNulls()
424     ProcessBegins (startPoint, endPoint, NONE_LABEL, nodeList, 0, visitList, numVertex);  in RemoveNulls()
446 void SubGraph::RemoveForwardConnections (int startPoint, int endPoint)  in RemoveForwardConnections()  argument
450     if (startPoint == -1 && endPoint == -1) {  in RemoveForwardConnections()
451         startPoint= startId;  in RemoveForwardConnections()
461     ProcessBegins (startPoint, endPoint, BEGINSCOPE_LABEL, nodeList, 0, visitList, numVertex);  in RemoveForwardConnections()
518 void SubGraph::RemoveBackwardConnections (int startPoint, int endPoint)  in RemoveBackwardConnections()  argument
522     if (startPoint == -1 && endPoint == -1) {  in RemoveBackwardConnections()
523         startPoint= startId;  in RemoveBackwardConnections()
533     ProcessEnds (endPoint, startPoint, ENDSCOPE_LABEL, nodeList, 0, visitList, numVertex);  in RemoveBackwardConnections()
589 void SubGraph::RemoveUnreachedConnections (int startPoint, int endPoint)  in RemoveUnreachedConnections()  argument
595     if (startPoint == -1 && endPoint == -1) {  in RemoveUnreachedConnections()
596         startPoint= startId;  in RemoveUnreachedConnections()
601     RemoveUnvisitedArcs (startPoint, endPoint);  in RemoveUnreachedConnections()
609 void SubGraph::RemoveUnreachedConnectionsDebug (int startPoint, int endPoint)  in RemoveUnreachedConnectionsDebug()  argument
615     if (startPoint == -1 && endPoint == -1) {  in RemoveUnreachedConnectionsDebug()
616         startPoint= startId;  in RemoveUnreachedConnectionsDebug()
621     RemoveUnvisitedArcs (startPoint, endPoint);  in RemoveUnreachedConnectionsDebug()
754 void SubGraph::RemoveTagConnections (int startPoint, int endPoint)  in RemoveTagConnections()  argument
758     if (startPoint == -1 && endPoint == -1) {  in RemoveTagConnections()
759         startPoint= startId;  in RemoveTagConnections()
769     ProcessTags (endPoint, startPoint, nodeList, 0, visitList, numVertex);  in RemoveTagConnections()