| ▼NAvoid | Libavoid: Object-avoiding orthogonal and polyline connector routing library |
| CBox | A bounding box, represented by the top-left and bottom-right corners |
| CCheckpoint | A checkpoint is a point that the route for a particular connector must visit. They may optionally be given an arrival/departure direction |
| CClusterRef | Cluster object |
| CConnEnd | Different possible endpoints for connectors |
| CConnRef | Connector object |
| CEdge | A line between two points |
| CHyperedgeNewAndDeletedObjectLists | Stores lists of objects created and deleted during hyperedge improvement |
| CHyperedgeRerouter | Convenience object that can be used to register hyperedges to be rerouted, improving the placement of their junctions and connector paths |
| CJunctionRef | Fixed or free-floating point that connectors can be attached to |
| CPoint | Defines a point in the plane |
| CPolygon | A dynamic Polygon, to which points can be easily added and removed |
| CPolygonInterface | A common interface used by the Polygon classes |
| CRectangle | A Rectangle, a simpler way to define the polygon for square or rectangular shapes |
| CReferencingPolygon | A Polygon which just references its points from other Polygons |
| CRouter | Libavoid router instance |
| CShapeConnectionPin | Fixed point or "pin" on a shape that can be connected to |
| CShapeRef | Shape object |
| ▼Ncola | Libcola: Force-directed network layout subject to separation constraints library |
| CAlignmentConstraint | An alignment constraint specifies a alignment line that a set of nodes must be constrained to by an exact amount |
| CBoundaryConstraint | A boundary constraint specifies a bounding line that a set of nodes must be either to the left or right of |
| CBox | A box consisting of four edge values for representing padding or margins for rectangles |
| CCluster | A cluster defines a hierarchical partitioning over the nodes which should be kept disjoint by the layout somehow |
| CCompoundConstraint | An abstract base class for all high-level compound constraints |
| CConstrainedFDLayout | Implements a constrained force-directed layout algorithm |
| CConstrainedMajorizationLayout | Implements the Constrained Majorization graph layout algorithm (deprecated) |
| CConvexCluster | Defines a cluster that will be treated as a convex boundary around the child nodes and clusters |
| CDistributionConstraint | A distribution constraint specifies an ordered set of alignment constraints and a fixed separation required between them |
| CFixedRelativeConstraint | A fixed-relative constraint specifies that a group of nodes are constrained to be fixed in position relative to each other |
| CLock | A Lock specifies a required position for a node |
| CMultiSeparationConstraint | A multi-separation constraint Specifies a set of horizontal or vertical equal spacing constraints between pairs of alignment constraints |
| CPageBoundaryConstraints | A page boundary contraint specifies constraints that attempt to keep the given nodes within a defined rectangular region |
| CPreIteration | A default functor that is called before each iteration in the main loop of the ConstrainedFDLayout::run() method |
| CRectangularCluster | Defines a rectangular cluster, either variable-sized with floating sides or a fixed size based on a particular rectangle |
| CResize | A Resize specifies a new required bounding box for a node |
| CRootCluster | Holds the cluster hierarchy specification for a diagram |
| CSeparationConstraint | A separation constraint specifies a simple horizontal or vertical spacing constraint between 2 nodes or alignment constraints |
| CTestConvergence | A default functor that is called after each iteration of the layout algorithm |
| CTopologyAddonInterface | Interface for writing COLA addons to handle topology preserving layout |
| CUnsatisfiableConstraintInfo | Info about constraints that could not be satisfied in gradient projection process |
| CVariableIDMap | Holds a mapping between two sets of Variable indices |
| ▼Ndialect | Libdialect: A library for computing human-like orthogonal network (DiAlEcT) layouts |
| CACALayout | Implements the Adaptive Constrained Alignment (ACA) algorithm |
| CAestheticBend | A bend point deliberately added to a connector route, for aesthetic reasons |
| CArrangement | Represents the arrangement of all Nbrs around a centre node |
| CAssignment | Represents an assignment of nbrs to semiaxes, and records the cost of this assignment |
| CBendSequence | A data structure for managing sequences of bend types, points at which these bends should occur (in a given Chain), cost of such a sequence of bends (for a given Chain), and incoming and outgoing Compass directions, for non-cycles |
| CBoundingBox | A bounding box, given by the extreme coordinates |
| CChain | A Chain is a sequence of degree-2 Nodes, possibly forming a cycle |
| CColaGraphRep | Bundles those data structures required in order to represent a Graph in libcola, and to map infomration between the libcola and libdialect representations |
| CColaOptions | Provides a simple way to set any or all of the various optional arguments to libcola layout methods |
| CEdge | Edges in a graph |
| CEdgeSegment | Represents an axis-aligned segment of an orthogonal connector route |
| CExpansionGoal | The ExpansionGoal class |
| CExpansionManager | The ExpansionManager class |
| CFace | Represents a single face of a 4-planar, orthogonal layout |
| CFaceSet | |
| CGhostNode | A GhostNode represents another Node |
| CGraph | Graphs consisting of nodes and edges |
| CLeaflessOrthoRouter | Does a special orthogonal routing in a graph having no leaves, ensuring that at least two distinct sides of every node are used as connection points. This is useful if we later wish to planarise the layout, since it ensures that no node will become a leaf in that process |
| CMatrix2d | Dense 2d array, with integer indices |
| CNbr | Represents a neighbouring node to a central node |
| CNearbyObjectFinder | |
| CNexus | |
| CNode | Nodes in a graph |
| CNodeBuckets | |
| CNodeIdCmp | Useful for set operations on Node lookups |
| COrthoHubLayout | A layout object that tries to orthogonalise hubs. This means it visits nodes of degrees 3 or higher, and tries to set their neighbours in cardinal compass directions from it |
| COrthoHubLayoutOptions | Options to control OrthoHubLayout |
| COrthoPlanariser | |
| CPeeledNode | A PeeledNode is a type of GhostNode, used in the peeling process |
| CProjection | |
| CProjSeq | |
| CQuad | Represents a quadrant, relative to a central node |
| CRoutingAdapter | Adapter to easily apply libavoid::Routers to libdialect::Graphs |
| CSepCo | |
| CSepPairSubConstraintInfo | |
| CSide | A side of a Face. E.g. a rectangular Face has four Sides: north, south, east, and west |
| CStem | Represents a leaf node, along with its one edge and neighbour |
| CTreePlacement | |
| ▼Ntopology | Libtopology: Extensions for topology preservation for libcola and libavoid libraries |
| CAvoidTopologyAddon | This class can be passed to libavoid to extend it to provide orthogonal topology improvement functionality |
| CColaTopologyAddon | This class can be passed to libcola to replace some functionality to provide topology preserving layout |
| CEdge | Topology representation of an edge |
| CNode | Topology representation for a node |
| ▼Nvpsc | Libvpsc: Variable Placement with Separation Constraints quadratic program solver library |
| CConstraint | A constraint determines a minimum or exact spacing required between two Variable objects |
| CIncSolver | Incremental solver for Variable Placement with Separation Constraints problem instance |
| CRectangle | A rectangle represents a fixed-size shape in the diagram that may be moved to prevent overlaps and satisfy constraints |
| CSolver | Static solver for Variable Placement with Separation Constraints problem instance |
| CVariable | A variable is comprised of an ideal position, final position and a weight |
