/*
* Created on Sep 24, 2005
*
* Copyright (c) 2005, The JUNG Authors
*
* All rights reserved.
*
* This software is open-source under the BSD license; see either
* "license.txt" or
* https://github.com/jrtom/jung/blob/master/LICENSE for a description.
*/
package edu.uci.ics.jung.graph.util;
import java.util.Collection;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import edu.uci.ics.jung.graph.Graph;
/**
* A class which creates and maintains indices for incident edges.
*
* @author Tom Nelson
*
*/
public class IncidentEdgeIndexFunction implements EdgeIndexFunction
{
protected Map edge_index = new HashMap();
private IncidentEdgeIndexFunction() {
}
/**
* @param the vertex type
* @param the edge type
* @return an instance of this type.
*/
public static IncidentEdgeIndexFunction getInstance() {
return new IncidentEdgeIndexFunction();
}
/**
* Returns the index for the specified edge.
* Calculates the indices for e and for all edges parallel
* to e.
*/
public int getIndex(Graph graph, E e)
{
Integer index = edge_index.get(e);
if(index == null) {
Pair endpoints = graph.getEndpoints(e);
V u = endpoints.getFirst();
V v = endpoints.getSecond();
if(u.equals(v)) {
index = getIndex(graph, e, v);
} else {
index = getIndex(graph, e, u, v);
}
}
return index.intValue();
}
protected int getIndex(Graph graph, E e, V u, V v) {
Collection commonEdgeSet = new HashSet(graph.getIncidentEdges(u));
int count=0;
for(E other : commonEdgeSet) {
if(e.equals(other) == false) {
edge_index.put(other, count);
count++;
}
}
edge_index.put(e, count);
return count;
}
protected int getIndex(Graph graph, E e, V v) {
Collection commonEdgeSet = new HashSet();
for(E another : graph.getIncidentEdges(v)) {
V u = graph.getOpposite(v, another);
if(u.equals(v)) {
commonEdgeSet.add(another);
}
}
int count=0;
for(E other : commonEdgeSet) {
if(e.equals(other) == false) {
edge_index.put(other, count);
count++;
}
}
edge_index.put(e, count);
return count;
}
/**
* Resets the indices for this edge and its parallel edges.
* Should be invoked when an edge parallel to e
* has been added or removed.
* @param graph the graph whose indices are to be reset
* @param e the edge whose associated indices are to be reset
*/
public void reset(Graph graph, E e) {
Pair endpoints = graph.getEndpoints(e);
getIndex(graph, e, endpoints.getFirst());
getIndex(graph, e, endpoints.getFirst(), endpoints.getSecond());
}
/**
* Clears all edge indices for all edges in all graphs.
* Does not recalculate the indices.
*/
public void reset()
{
edge_index.clear();
}
}
Ads help maintain this website.