Method checkValidity

source/MRMesh/MRGraph.cpp:111–152

}

bool Graph::checkValidity() const
{
    MR_TIMER;

    #define CHECK(x) { assert(x); if (!(x)) return false; }

    CHECK( validVerts_.size() == neighboursPerVertex_.size() );
    CHECK( validEdges_.size() == endsPerEdge_.size() );

    for ( auto v : validVerts_ )
    {
        const auto & neis = neighboursPerVertex_[v];
        CHECK( std::is_sorted( neis.begin(), neis.end() ) );
        for ( auto e : neis )
        {
            CHECK( e.valid() );
            CHECK( e < endsPerEdge_.size() );
            CHECK( validEdges_.test( e ) );
            const auto ends = endsPerEdge_[e];
            CHECK( ends.v0 == v || ends.v1 == v );
            const auto w = ends.otherEnd( v );
            CHECK( e == findEdge( v, w ) );
            CHECK( e == findEdge( w, v ) );
        }
    }

    for ( auto e : validEdges_ )
    {
        const auto ends = endsPerEdge_[e];
        CHECK( ends.v0 && ends.v1 );
        CHECK( ends.v0 < ends.v1 );
        CHECK( ends.v0 < neighboursPerVertex_.size() );
        CHECK( validVerts_.test( ends.v0 ) );
        CHECK( ends.v1 < neighboursPerVertex_.size() );
        CHECK( validVerts_.test( ends.v1 ) );

        CHECK( e == findEdge( ends.v0, ends.v1 ) );
        CHECK( e == findEdge( ends.v1, ends.v0 ) );
    }

    return true;
}

} //namespace MR