Home
last modified time | relevance | path

Searched refs:sp_GetCurrentSize (Results 1 – 20 of 20) sorted by relevance

/dports/math/gap/gap-4.11.0/pkg/digraphs-1.1.1/extern/edge-addition-planarity-suite-Version_3.0.0.5/c/
H A DgraphUtils.c593 int stackBottom = sp_GetCurrentSize(theGraph->theStack); in _ClearVisitedFlagsInBicomp()
597 while (sp_GetCurrentSize(theGraph->theStack) > stackBottom) in _ClearVisitedFlagsInBicomp()
767 int stackBottom = sp_GetCurrentSize(theGraph->theStack); in _FillVertexVisitedInfoInBicomp()
770 while (sp_GetCurrentSize(theGraph->theStack) > stackBottom) in _FillVertexVisitedInfoInBicomp()
805 int stackBottom = sp_GetCurrentSize(theGraph->theStack); in _ClearVertexTypeInBicomp()
808 while (sp_GetCurrentSize(theGraph->theStack) > stackBottom) in _ClearVertexTypeInBicomp()
1887 while (sp_GetCurrentSize(theGraph->theStack) > stackBottom) in _RestoreHiddenEdges()
2201 if (sp_GetCurrentSize(theGraph->theStack) < 7) in _RestoreVertex()
2388 int stackBottom = sp_GetCurrentSize(theGraph->theStack); in _DeleteUnmarkedEdgesInBicomp()
2423 int stackBottom = sp_GetCurrentSize(theGraph->theStack); in _ClearInvertedFlagsInBicomp()
[all …]
H A Dstack.h38 int sp_GetCurrentSize(stackP theStack);
63 #define sp_GetCurrentSize(theStack) (theStack->size) macro
H A DgraphNonplanar.c372 while (sp_GetCurrentSize(theGraph->theStack) > stackBottom) in _PopAndUnmarkVerticesAndEdges()
483 stackBottom1 = sp_GetCurrentSize(theGraph->theStack); in _MarkHighestXYPath()
495 stackBottom2 = sp_GetCurrentSize(theGraph->theStack); in _MarkHighestXYPath()
H A Dstack.c109 int sp_GetCurrentSize(stackP theStack) in sp_GetCurrentSize() function
H A DgraphEmbed.c1241 int stackBottom = sp_GetCurrentSize(theGraph->theStack); in _OrientVerticesInBicomp()
1245 while (sp_GetCurrentSize(theGraph->theStack) > stackBottom) in _OrientVerticesInBicomp()
H A DgraphK33Search.c912 stackBottom = sp_GetCurrentSize(theGraph->theStack); in _TestForLowXYPath()
1489 int stackBottom = sp_GetCurrentSize(theGraph->theStack); in _K33Search_DeleteUnmarkedEdgesInBicomp()
1492 while (sp_GetCurrentSize(theGraph->theStack) > stackBottom) in _K33Search_DeleteUnmarkedEdgesInBicomp()
H A DgraphTests.c194 if (sp_GetCurrentSize(theStack) != 2*theGraph->M) in _CheckEmbeddingFacialIntegrity()
H A DgraphK4Search.c1030 int stackBottom = sp_GetCurrentSize(theGraph->theStack); in _K4_DeleteUnmarkedEdgesInBicomp()
1033 while (sp_GetCurrentSize(theGraph->theStack) > stackBottom) in _K4_DeleteUnmarkedEdgesInBicomp()
H A DgraphDrawPlanar.c641 for (K = 0; K < sp_GetCurrentSize(theEmbedding->theStack); K += 4) in _CollectDrawingData()
H A DgraphStructures.h80 …IndexBound(theGraph) (gp_GetFirstEdge(theGraph) + (((theGraph)->M + sp_GetCurrentSize((theGraph)->…
/dports/math/planarity/edge-addition-planarity-suite-Version_3.0.1.1/c/
H A DgraphUtils.c594 int stackBottom = sp_GetCurrentSize(theGraph->theStack); in _ClearVisitedFlagsInBicomp()
598 while (sp_GetCurrentSize(theGraph->theStack) > stackBottom) in _ClearVisitedFlagsInBicomp()
768 int stackBottom = sp_GetCurrentSize(theGraph->theStack); in _FillVertexVisitedInfoInBicomp()
771 while (sp_GetCurrentSize(theGraph->theStack) > stackBottom) in _FillVertexVisitedInfoInBicomp()
806 int stackBottom = sp_GetCurrentSize(theGraph->theStack); in _ClearVertexTypeInBicomp()
809 while (sp_GetCurrentSize(theGraph->theStack) > stackBottom) in _ClearVertexTypeInBicomp()
1888 while (sp_GetCurrentSize(theGraph->theStack) > stackBottom) in _RestoreHiddenEdges()
2202 if (sp_GetCurrentSize(theGraph->theStack) < 7) in _RestoreVertex()
2389 int stackBottom = sp_GetCurrentSize(theGraph->theStack); in _DeleteUnmarkedEdgesInBicomp()
2424 int stackBottom = sp_GetCurrentSize(theGraph->theStack); in _ClearInvertedFlagsInBicomp()
[all …]
H A Dstack.h38 int sp_GetCurrentSize(stackP theStack);
71 #define sp_GetCurrentSize(theStack) (theStack->size) macro
H A DgraphNonplanar.c371 while (sp_GetCurrentSize(theGraph->theStack) > stackBottom) in _PopAndUnmarkVerticesAndEdges()
480 stackBottom1 = sp_GetCurrentSize(theGraph->theStack); in _MarkHighestXYPath()
492 stackBottom2 = sp_GetCurrentSize(theGraph->theStack); in _MarkHighestXYPath()
H A Dstack.c109 int sp_GetCurrentSize(stackP theStack) in sp_GetCurrentSize() function
H A DgraphEmbed.c1241 int stackBottom = sp_GetCurrentSize(theGraph->theStack); in _OrientVerticesInBicomp()
1245 while (sp_GetCurrentSize(theGraph->theStack) > stackBottom) in _OrientVerticesInBicomp()
H A DgraphK33Search.c911 stackBottom = sp_GetCurrentSize(theGraph->theStack);
1488 int stackBottom = sp_GetCurrentSize(theGraph->theStack);
1491 while (sp_GetCurrentSize(theGraph->theStack) > stackBottom)
H A DgraphTests.c194 if (sp_GetCurrentSize(theStack) != 2*theGraph->M) in _CheckEmbeddingFacialIntegrity()
H A DgraphK4Search.c1035 int stackBottom = sp_GetCurrentSize(theGraph->theStack); in _K4_DeleteUnmarkedEdgesInBicomp()
1038 while (sp_GetCurrentSize(theGraph->theStack) > stackBottom) in _K4_DeleteUnmarkedEdgesInBicomp()
H A DgraphDrawPlanar.c642 for (K = 0; K < sp_GetCurrentSize(theEmbedding->theStack); K += 4) in _CollectDrawingData()
H A DgraphStructures.h80 …IndexBound(theGraph) (gp_GetFirstEdge(theGraph) + (((theGraph)->M + sp_GetCurrentSize((theGraph)->…