/usr/include/planarity/graphK4Search.private.h is in libplanarity-dev 3.0.0.5-1+b1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 | #ifndef GRAPH_K4SEARCH_PRIVATE_H
#define GRAPH_K4SEARCH_PRIVATE_H
/*
Copyright (c) 1997-2015, John M. Boyer
All rights reserved.
See the LICENSE.TXT file for licensing information.
*/
#include "graph.h"
#ifdef __cplusplus
extern "C" {
#endif
/* Additional equipment for each EdgeRec
pathConnector:
Used in the edge records (arcs) of a reduction edge to indicate the
endpoints of a path that has been reduced from (removed from) the
embedding so that the search for a K4 can continue.
We only need a pathConnector because we reduce subgraphs that are
separable by a 2-cut, so they can contribute at most one path to a
subgraph homeomorphic to K4, if one is indeed found. Thus, we first
delete all edges except for the desired path(s), then we reduce any
retained path to an edge.
*/
typedef struct
{
int pathConnector;
} K4Search_EdgeRec;
typedef K4Search_EdgeRec * K4Search_EdgeRecP;
/* Additional equipment for each vertex: None */
typedef struct
{
// Helps distinguish initialize from re-initialize
int initialized;
// The graph that this context augments
graphP theGraph;
// Parallel array for additional edge level equipment
K4Search_EdgeRecP E;
// Overloaded function pointers
graphFunctionTable functions;
// Internal variable for converting a tail recursion into a simple loop
int handlingBlockedBicomp;
} K4SearchContext;
#ifdef __cplusplus
}
#endif
#endif
|