slib.graph.algo.extraction.validator.dag.Path Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of slib-graph-algo Show documentation
Graph algorithm library which can be used to manipulate graph of URIs
The newest version!
/* 
 *  Copyright or © or Copr. Ecole des Mines d'Alès (2012-2014) 
 *  
 *  This software is a computer program whose purpose is to provide 
 *  several functionalities for the processing of semantic data 
 *  sources such as ontologies or text corpora.
 *  
 *  This software is governed by the CeCILL  license under French law and
 *  abiding by the rules of distribution of free software.  You can  use, 
 *  modify and/ or redistribute the software under the terms of the CeCILL
 *  license as circulated by CEA, CNRS and INRIA at the following URL
 *  "http://www.cecill.info". 
 * 
 *  As a counterpart to the access to the source code and  rights to copy,
 *  modify and redistribute granted by the license, users are provided only
 *  with a limited warranty  and the software's author,  the holder of the
 *  economic rights,  and the successive licensors  have only  limited
 *  liability. 

 *  In this respect, the user's attention is drawn to the risks associated
 *  with loading,  using,  modifying and/or developing or reproducing the
 *  software by the user in light of its specific status of free software,
 *  that may mean  that it is complicated to manipulate,  and  that  also
 *  therefore means  that it is reserved for developers  and  experienced
 *  professionals having in-depth computer knowledge. Users are therefore
 *  encouraged to load and test the software's suitability as regards their
 *  requirements in conditions enabling the security of their systems and/or 
 *  data to be ensured and,  more generally, to use and operate it in the 
 *  same conditions as regards security. 
 * 
 *  The fact that you are presently reading this means that you have had
 *  knowledge of the CeCILL license and that you accept its terms.
 */
package slib.graph.algo.extraction.validator.dag;

import java.util.LinkedList;
import java.util.List;
import slib.graph.model.graph.elements.E;

/**
 *
 * Simple representation of a path in a graph.
 *
 * @author Sébastien Harispe 
 */
public class Path {

    List edges = new LinkedList();

    /**
     * Clear the path.
     */
    public void clear() {
        edges = new LinkedList();
    }

    /**
     * Add an edge to the path
     *
     * @param e the edge to add
     */
    void addEdge(E e) {
        edges.add(e);
    }

    @Override
    public String toString() {

        String out = "Path: ";

        for (E e : edges) {
            out += "\n\t" + e;
        }
        return out;
    }

    /**
     * Remove the last vertex of the path (if any)
     */
    void removeLastEdge() {
        if (edges.size() > 0) {
            edges.remove(edges.size()-1);
        }
    }
}