/usr/include/planarity/graphDrawPlanar.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 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 | #ifndef GRAPH_DRAWPLANAR_PRIVATE_H
#define GRAPH_DRAWPLANAR_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 edge
/*
pos, start, end: used to store a visibility representation, or
horvert diagram of a planar graph.
For edges, horizontal position, vertical range
*/
typedef struct
{
int pos, start, end;
} DrawPlanar_EdgeRec;
typedef DrawPlanar_EdgeRec * DrawPlanar_EdgeRecP;
// Additional equipment for each vertex
/*
pos, start, end: used to store a visibility representation, or
horvert diagram, of a planar graph.
For vertices, vertical position, horizontal range
drawingFlag, ancestor, ancestorChild: used to collect information needed
to help 'draw' a visibility representation. During planar
embedding, a vertex is determined to be between its DFS parent and
a given ancestor (the vertex being processed) or beyond the parent
relative to the ancestor. In post processing, the relative
orientation of the parent and ancestor are determined,
then the notion of between/beyond resolves to above/below or
below/above depending on whether the ancestor is above or below,
respectively, the parent. The ancestorChild are used to help r
esolve this latter question.
tie[2] stores information along the external face during embedding
that is pertinent to helping break ties in the decisions about
vertical vertex positioning. When vertices are first merged
together into a bicomp, we cannot always decide right away which
vertices will be above or below others. But as we traverse the
external face removing inactive vertices, these positional ties
can be resolved.
*/
typedef struct
{
int pos, start, end;
int drawingFlag, ancestor, ancestorChild;
int tie[2];
} DrawPlanar_VertexInfo;
typedef DrawPlanar_VertexInfo * DrawPlanar_VertexInfoP;
#define DRAWINGFLAG_BEYOND 0
#define DRAWINGFLAG_TIE 1
#define DRAWINGFLAG_BETWEEN 2
#define DRAWINGFLAG_BELOW 3
#define DRAWINGFLAG_ABOVE 4
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
DrawPlanar_EdgeRecP E;
// Parallel array for additional vertex level equipment
DrawPlanar_VertexInfoP VI;
// Overloaded function pointers
graphFunctionTable functions;
} DrawPlanarContext;
#ifdef __cplusplus
}
#endif
#endif
|