SingleNode.java
/*
* Copyright 2006 - 2013
* Stefan Balev <stefan.balev@graphstream-project.org>
* Julien Baudry <julien.baudry@graphstream-project.org>
* Antoine Dutot <antoine.dutot@graphstream-project.org>
* Yoann Pign�� <yoann.pigne@graphstream-project.org>
* Guilhelm Savin <guilhelm.savin@graphstream-project.org>
*
* This file is part of GraphStream <http://graphstream-project.org>.
*
* 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 <http://www.cecill.info> 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 <http://www.gnu.org/licenses/>.
*
* The fact that you are presently reading this means that you have had
* knowledge of the CeCILL-C and LGPL licenses and that you accept their terms.
*/
package org.graphstream.graph.implementations;
import java.util.Collections;
import java.util.HashMap;
import java.util.Iterator;
import org.graphstream.graph.Edge;
import org.graphstream.graph.Node;
/**
* Nodes used with {@link SingleGraph}
*
*/
public class SingleNode extends AdjacencyListNode {
protected static class TwoEdges {
AbstractEdge in, out;
}
protected HashMap<AbstractNode, TwoEdges> neighborMap;
// *** Constructor ***
protected SingleNode(AbstractGraph graph, String id) {
super(graph, id);
neighborMap = new HashMap<AbstractNode, TwoEdges>(
4 * INITIAL_EDGE_CAPACITY / 3 + 1);
}
// *** Helpers ***
@SuppressWarnings("unchecked")
@Override
protected <T extends Edge> T locateEdge(Node opposite, char type) {
TwoEdges ee = neighborMap.get(opposite);
if (ee == null)
return null;
return (T)(type == I_EDGE ? ee.in : ee.out);
}
@Override
protected void removeEdge(int i) {
AbstractNode opposite = edges[i].getOpposite(this);
TwoEdges ee = neighborMap.get(opposite);
char type = edgeType(edges[i]);
if (type != O_EDGE)
ee.in = null;
if (type != I_EDGE)
ee.out = null;
if (ee.in == null && ee.out == null)
neighborMap.remove(opposite);
super.removeEdge(i);
}
// *** Callbacks ***
@Override
protected boolean addEdgeCallback(AbstractEdge edge) {
AbstractNode opposite = edge.getOpposite(this);
TwoEdges ee = neighborMap.get(opposite);
if (ee == null)
ee = new TwoEdges();
char type = edgeType(edge);
if (type != O_EDGE) {
if (ee.in != null)
return false;
ee.in = edge;
}
if (type != I_EDGE) {
if (ee.out != null)
return false;
ee.out = edge;
}
neighborMap.put(opposite, ee);
return super.addEdgeCallback(edge);
}
@Override
protected void clearCallback() {
neighborMap.clear();
super.clearCallback();
}
// *** Others ***
@SuppressWarnings("unchecked")
@Override
public <T extends Node> Iterator<T> getNeighborNodeIterator() {
return (Iterator<T>) Collections.unmodifiableSet(neighborMap.keySet())
.iterator();
}
}