Lines Matching refs:endPoint
369 void SubGraph::RemoveRuleStarts (int startPoint, int endPoint)
371 if (startPoint == -1 && endPoint == -1) {
373 endPoint= lastId;
382 ProcessBegins (startPoint, endPoint, BEGINRULE_LABEL, nodeList, 0, visitList, numVertex);
390 void SubGraph::RemoveRuleEnds (int startPoint, int endPoint)
392 if (startPoint == -1 && endPoint == -1) {
394 endPoint= lastId;
403 ProcessEnds (endPoint, startPoint, ENDRULE_LABEL, nodeList, 0, visitList, numVertex);
411 void SubGraph::RemoveNulls (int startPoint, int endPoint)
413 if (startPoint == -1 && endPoint == -1) {
415 endPoint= lastId;
424 ProcessBegins (startPoint, endPoint, NONE_LABEL, nodeList, 0, visitList, numVertex);
446 void SubGraph::RemoveForwardConnections (int startPoint, int endPoint)
450 if (startPoint == -1 && endPoint == -1) {
452 endPoint= lastId;
461 ProcessBegins (startPoint, endPoint, BEGINSCOPE_LABEL, nodeList, 0, visitList, numVertex);
518 void SubGraph::RemoveBackwardConnections (int startPoint, int endPoint)
522 if (startPoint == -1 && endPoint == -1) {
524 endPoint= lastId;
533 ProcessEnds (endPoint, startPoint, ENDSCOPE_LABEL, nodeList, 0, visitList, numVertex);
589 void SubGraph::RemoveUnreachedConnections (int startPoint, int endPoint)
595 if (startPoint == -1 && endPoint == -1) {
597 endPoint= lastId;
601 RemoveUnvisitedArcs (startPoint, endPoint);
609 void SubGraph::RemoveUnreachedConnectionsDebug (int startPoint, int endPoint)
615 if (startPoint == -1 && endPoint == -1) {
617 endPoint= lastId;
621 RemoveUnvisitedArcs (startPoint, endPoint);
754 void SubGraph::RemoveTagConnections (int startPoint, int endPoint)
758 if (startPoint == -1 && endPoint == -1) {
760 endPoint= lastId;
769 ProcessTags (endPoint, startPoint, nodeList, 0, visitList, numVertex);
