C++ (Cpp) DirectedEdge::to Examples

Example #1

File: WeightedDigraph.cpp Project: Elegy/ProjectEuler

void WeightedDigraph::addEdge(const DirectedEdge &e)
{
    if(e.from() >= V() || e.to() >= V())
        return;
    
    ++edgeCount;
    array[e.from()].push(e);
}

Example #2

File: ShortestPath.cpp Project: netosoy/EstructurasAbstractas

std::deque<DirectedEdge> *Djikstra::pathTo(int v){
    if(!hasPathTo(v))
         return 0;
    std::deque<DirectedEdge> *path =  new std::deque<DirectedEdge>();
    for(DirectedEdge e = edgeTo[v]; e.from() || e.to() || e.Getweight(); e =edgeTo[e.from()])
        path->push_front(e);
    return path;
}

Example #3

File: ShortestPath.cpp Project: netosoy/EstructurasAbstractas

std::deque<DirectedEdge> *BellmanFord::pathTo(int v){
    if(!hasPathTo(v))
        return 0;
    std::deque<DirectedEdge> *path = new std::deque<DirectedEdge>();
    for(DirectedEdge e = edgeTo[v];e.from() || e.to() || e.Getweight(); e=edgeTo[e.from()] ){
        int w = e.from();
        w++;w--;
        path->push_front(e);
    }
    return path;
}