import gabl.graph.Vertex;
import gabl.graph.Edge;

/**********************************************************************
 * Silent visitor for Prim's MST algorithm. Suitable when the
 * calculation of a MST is called very often as a subroutine
 * of another algorithm.
 * @see VisitorPrim
 **********************************************************************/
public class VisitorPrimSilent implements VisitorPrim {
    
    public boolean init(Vertex v) {
        return true;
    }
    
    public boolean reachable(Vertex v) throws IllegalStateException {
        return true;
    }
    
    public boolean visit(Vertex v) throws IllegalStateException {
        return true;
    }
    
    public boolean anyEdge(Edge e) throws IllegalStateException {
        return true;
    }
    
    public boolean candEdge(Edge e) throws IllegalArgumentException,
                                           IllegalStateException
    {
        return true;
    }
    
    public boolean bestEdge(Edge e) throws IllegalArgumentException,
                                           IllegalStateException
    {
        return true;
    }
    
    public boolean treeEdge(Edge e) throws IllegalArgumentException,
                                           IllegalStateException
    {
        return true;
    }
}