tGraph: introspection of edges based on a single vertex

tGraphOps.cc

//-- Helper method
template<typename V, typename E>
template<typename T> bool tGraph<V, E>::Equal(T a, T b)
{
    return !(a < b) && !(b < a);
}

//-- Introspection of edges based on a single vertex
template<typename V, typename E> typename tGraph<V, E>::EdgeSet     tGraph<V, E>::outgoingEdgesOf(const VertexType& v) const
{
    EdgeSet result;

    for(typename EdgeSet::iterator iter = mEdges.begin(); iter != mEdges.end(); iter++)
    {
        if (Equal((*iter).second.first, v))
        {
            result.insert(*iter);
        }
    }

    return result;
}

template<typename V, typename E> typename tGraph<V, E>::EdgeSet     tGraph<V, E>::incomingEdgesOf(const VertexType& v) const
{
    EdgeSet result;

    for(typename EdgeSet::iterator iter = mEdges.begin(); iter != mEdges.end(); iter++)
    {
        if (Equal((*iter).second.second, v))
        {
            result.insert(*iter);
        }
    }

    return result;
}

template<typename V, typename E> typename tGraph<V, E>::EdgeSet     tGraph<V, E>::edgesOf(const VertexType& v) const
{
    EdgeSet incoming, result;
    typename EdgeSet::iterator iter, next;

    result      = outgoingEdgesOf(v);
    incoming    = incomingEdgesOf(v);

    //Remove loop edges from "incoming", we already got them once in outgoing.

    iter = incoming.begin();
    while(iter != incoming.end())
    {
        next = iter;
        next++;

        if (Equal((*iter).second.first, (*iter).second.second))
        {
            incoming.erase(iter);
        }

        iter = next;
    }

    result.insert(incoming.begin(), incoming.end());

    return result;
}