Skip to content

Namespace SFCGAL::graph::algorithm#

Namespace List > graph > algorithm

Graph algorithm namespace.

Public Functions#

Type Name
bool isHalfEdge (const GeometryGraphT< V, E > & graph)
[private]Test if a bidirectional graph is an half-edge (in order to validate orientation)
bool makeConsistentOrientation (Graph & graph, std::vector< typename Graph::edge_descriptor > & reference, std::vector< typename Graph::edge_descriptor > & target)
void studyOrientation (Graph & graph, std::vector< typename Graph::edge_descriptor > & reference, std::vector< typename Graph::edge_descriptor > & target, bool & hasOppositeEdge, bool & hasParallelEdge)
[private]Study orientation between two EdgeStrings

Public Functions Documentation#

function isHalfEdge#

[private]Test if a bidirectional graph is an half-edge (in order to validate orientation) 

template<typename V, typename E>
bool graph::algorithm::isHalfEdge (
    const GeometryGraphT < V, E > & graph
)

function makeConsistentOrientation#

template<typename Graph>
bool graph::algorithm::makeConsistentOrientation (
    Graph & graph,
    std::vector< typename Graph::edge_descriptor > & reference,
    std::vector< typename Graph::edge_descriptor > & target
)

Try to build consistent orientation between two edge string

Returns:

true on success

function studyOrientation#

[private]Study orientation between two EdgeStrings 

template<typename Graph>
void graph::algorithm::studyOrientation (
    Graph & graph,
    std::vector< typename Graph::edge_descriptor > & reference,
    std::vector< typename Graph::edge_descriptor > & target,
    bool & hasOppositeEdge,
    bool & hasParallelEdge
)

Returns:

true on success

The documentation for this class was generated from the following file /builds/sfcgal/SFCGAL/src/detail/graph/algorithm/isHalfEdge.h