org.graphstream.graph.Path Maven / Gradle / Ivy
Show all versions of gs-core Show documentation
/*
* Copyright 2006 - 2015
* Stefan Balev
* Julien Baudry
* Antoine Dutot
* Yoann Pigné
* Guilhelm Savin
*
* This file is part of GraphStream .
*
* GraphStream is a library whose purpose is to handle static or dynamic
* graph, create them from scratch, file or any source and display them.
*
* This program is free software distributed under the terms of two licenses, the
* CeCILL-C license that fits European law, and the GNU Lesser General Public
* License. You can use, modify and/ or redistribute the software under the terms
* of the CeCILL-C license as circulated by CEA, CNRS and INRIA at the following
* URL or under the terms of the GNU LGPL as published by
* the Free Software Foundation, either version 3 of the License, or (at your
* option) any later version.
*
* This program is distributed in the hope that it will be useful, but WITHOUT ANY
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
* PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see
* A path is a class that stores ordered lists of nodes and links that are
* adjacent. Such a path may be manipulated with nodes and/or edges added or
* removed. This class is designed as a dynamic structure that is, to add edges
* during the construction of the path. Only edges need to be added, the nodes
* list is maintained automatically.
*
*
*
* The two lists (one for nodes, one for edges) may be acceded at any moment in
* constant time.
*
*
*
* The constraint of this class is that it needs to know the first node of the
* path (the root). This root can be set with the {@link #setRoot(Node)} method
* or by using the {@link #add(Node, Edge)} method.
*
*
*
* The normal use with this class is to first use the {@link #setRoot(Node)}
* method to initialize the path; then to use the {@link #add(Edge)} method to
* grow it and the {@link #popEdge()} or {@link #popNode()}.
*
*/
public class Path implements Structure {
/**
* class level logger
*/
private static final Logger logger = Logger.getLogger(Path.class.getSimpleName());
// ------------- ATTRIBUTES ------------
/**
* The root of the path;
*/
private Node root = null;
/**
* The list of edges that represents the path.
*/
Stack edgePath;
/**
* The list of nodes representing the path.
*/
Stack nodePath;
// ------------- CONSTRUCTORS ------------
/**
* New empty path.
*/
public Path() {
edgePath = new Stack();
nodePath = new Stack();
}
// -------------- ACCESSORS --------------
/**
* Get the root (the first node) of the path.
*
* @return the root of the path.
*/
public Node getRoot() {
return this.root;
}
/**
* Set the root (first node) of the path.
*
* @param root
* The root of the path.
*/
public void setRoot(Node root) {
if (this.root == null) {
this.root = root;
nodePath.push(root);
} else {
logger.warning("Root node is not null - first use the clear method.");
}
}
/**
* Says whether the path contains this node or not.
*
* @param node
* The node tested for existence in the path.
* @return true if the path contains the node.
*/
public boolean contains(Node node) {
return nodePath.contains(node);
}
/**
* Says whether the path contains this edge or not.
*
* @param edge
* The edge tested for existence in the path.
* @return true if the path contains the edge.
*/
public boolean contains(Edge edge) {
return edgePath.contains(edge);
}
/**
* Returns true if the path is empty.
*
* @return true if the path is empty.
*/
public boolean empty() {
return nodePath.empty();
}
/**
* Returns the size of the path
*/
public int size() {
return nodePath.size();
}
/**
* It returns the sum of the characteristic given value in the
* Edges of the path.
*
* @param characteristic
* The characteristic.
* @return Sum of the characteristics.
*/
public Double getPathWeight(String characteristic) {
double d = 0;
for (Edge l : edgePath) {
d += (Double) l.getAttribute(characteristic, Number.class);
}
return d;
}
/**
* Returns the list of edges representing the path.
*
* @return The list of edges representing the path.
*/
public List getEdgePath() {
return edgePath;
}
/**
* Construct an return a list of nodes that represents the path.
*
* @return A list of nodes representing the path.
*/
public List getNodePath() {
return nodePath;
}
// -------------- MODIFIERS -------------
/**
* Method that adds a node (and an edge) to the path. Parameters are the
* start node : the one who already belong to the path or the first one if
* the path is empty. The other parameter is the the new edge to add.
*
* @param from
* The start node.
* @param edge
* The edge used.
*/
public void add(Node from, Edge edge) {
if (root == null) {
if (from == null) {
throw new IllegalArgumentException("From node cannot be null.");
} else {
setRoot(from);
}
}
if (from == null) {
from = nodePath.peek();
}
if (nodePath.size() == 1
|| ((nodePath.peek() == from) && (from == edgePath.peek()
.getSourceNode() || from == edgePath.peek()
.getTargetNode()))) {
nodePath.push(edge.getOpposite(from));
edgePath.push(edge);
} else {
logger.warning("Cannot add the specified edge, it cannot be part of the path! %n");
}
}
/**
* Method that adds an edge an a node to the path. The new edge to add is
* given.
*
* @param edge
* The edge to add to the path.
*/
public void add(Edge edge) {
if (nodePath.isEmpty()) {
add(null, edge);
} else {
add(nodePath.peek(), edge);
}
}
/**
* A synonym for {@link #add(Edge)}.
*/
public void push(Node from, Edge edge) {
add(from, edge);
}
/**
* A synonym for {@link #add(Edge)}.
*/
public void push(Edge edge) {
add(edge);
}
/**
* This methods pops the 2 stacks (edgePath and
* nodePath) and returns the removed edge.
*
* @return The edge that have just been removed.
*/
public Edge popEdge() {
nodePath.pop();
return edgePath.pop();
}
/**
* This methods pops the 2 stacks (edgePath and
* nodePath) and returns the removed node.
*
* @return The node that have just been removed.
*/
public Node popNode() {
edgePath.pop();
return nodePath.pop();
}
/**
* Looks at the node at the top of the stack without removing it from the
* stack.
*
* @return The node at the top of the stack.
*/
public Node peekNode() {
return nodePath.peek();
}
/**
* Looks at the edge at the top of the stack without removing it from the
* stack.
*
* @return The edge at the top of the stack.
*/
public Edge peekEdge() {
return edgePath.peek();
}
/**
* Clears the path;
*/
public void clear() {
nodePath.clear();
edgePath.clear();
// Runtime.getRuntime().gc();
root = null;
}
/**
* Get a copy of this path
*
* @return A copy of this path.
*/
@SuppressWarnings("unchecked")
public Path getACopy() {
Path newPath = new Path();
newPath.root = this.root;
newPath.edgePath = (Stack) edgePath.clone();
newPath.nodePath = (Stack) nodePath.clone();
return newPath;
}
/**
* Remove all parts of the path that start at a given node and pass a new at
* this node.
*/
public void removeLoops() {
int n = nodePath.size();
// For each node-edge pair
for (int i = 0; i < n; i++) {
// Lookup each other following node. We start
// at the end to find the largest loop possible.
for (int j = n - 1; j > i; j--) {
// If another node match, this is a loop.
if (nodePath.get(i) == nodePath.get(j)) {
// We found a loop between i and j.
// Remove ]i,j].
for (int k = i + 1; k <= j; k++) {
nodePath.remove(i + 1);
edgePath.remove(i);
}
n -= (j - i);
j = i; // To stop the search.
}
}
}
}
/**
* Compare the content of the current path and the specified path to decide
* weather they are equal or not.
*
* @param p
* A path to compare to the curent one.
* @return True if both paths are equal.
*/
public boolean equals(Path p) {
if (nodePath.size() != p.nodePath.size()) {
return false;
} else {
for (int i = 0; i < nodePath.size(); i++) {
if (nodePath.get(i) != p.nodePath.get(i)) {
return false;
}
}
}
return true;
}
// ------------ UTILITY METHODS ------------
/**
* Returns a String description of the path.
*
* @return A String representation of the path.
*/
@Override
public String toString() {
return nodePath.toString();
}
/**
* Returns the size of the path. Identical to {@link #size()}.
*
* @return The size of the path.
*/
public int getNodeCount() {
return nodePath.size();
}
/*
* (non-Javadoc)
*
* @see org.graphstream.graph.Structure#getEdgeCount()
*/
public int getEdgeCount() {
return edgePath.size();
}
/*
* (non-Javadoc)
*
* @see org.graphstream.graph.Structure#getNodeIterator()
*/
@SuppressWarnings("unchecked")
public Iterator getNodeIterator() {
return (Iterator) nodePath.iterator();
}
/*
* (non-Javadoc)
*
* @see org.graphstream.graph.Structure#getEdgeIterator()
*/
@SuppressWarnings("unchecked")
public Iterator getEdgeIterator() {
return (Iterator) edgePath.iterator();
}
/*
* (non-Javadoc)
*
* @see org.graphstream.graph.Structure#getEachNode()
*/
@SuppressWarnings("unchecked")
public Iterable getEachNode() {
return (Iterable) nodePath;
}
/*
* (non-Javadoc)
*
* @see org.graphstream.graph.Structure#getEachEdge()
*/
@SuppressWarnings("unchecked")
public Iterable getEachEdge() {
return (Iterable) edgePath;
}
/*
* (non-Javadoc)
*
* @see org.graphstream.graph.Structure#getNodeSet()
*/
@SuppressWarnings("unchecked")
public Collection getNodeSet() {
return (Collection) nodePath;
}
/*
* (non-Javadoc)
*
* @see org.graphstream.graph.Structure#getEdgeSet()
*/
@SuppressWarnings("unchecked")
public Collection getEdgeSet() {
return (Collection) edgePath;
}
}