grammarscope.jung2

Class EdgeIndexFunctionImpl<V extends HasIndex,E>

java.lang.Object

grammarscope.jung2.EdgeIndexFunctionImpl<V,E>

Type Parameters:

V - vertex type

E - edge type

All Implemented Interfaces:

edu.uci.ics.jung.graph.util.EdgeIndexFunction<V,E>

Direct Known Subclasses:

EdgeIndexOffsetFunctionsImpl

public class EdgeIndexFunctionImpl<V extends HasIndex,E>
extends java.lang.Object
implements EdgeIndexFunction<V,E>

Edge index (height) function. First indexes vertices following vertex-ordering as defined by vertex comparator. Then allocates heights.

Author:

Bernard Bou

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
private static class	EdgeIndexFunctionImpl.Pair<T1,T2> Convenience class

Field Summary

Fields

Modifier and Type	Field and Description
protected java.util.Map<E,java.lang.Integer>	edgeIndices Allocation table

Constructor Summary

Constructors

Constructor and Description
EdgeIndexFunctionImpl() Constructor

Method Summary

Modifier and Type	Method and Description
private EdgeIndexFunctionImpl.Pair<java.lang.Integer,java.util.Map<E,java.lang.Integer>>	allocate(edu.uci.ics.jung.graph.Graph<V,E> graph) Layout edge heights
private int	allocateHeight(E edge0, edu.uci.ics.jung.graph.Graph<V,E> graph, java.util.Map<E,java.lang.Integer> edge2HeightMap) Allocate height slot (0-based)
private int	compareTo(V v1, V v2) Compare vertex indices
private EdgeIndexFunctionImpl.Pair<V,V>	getEnds(E edge, edu.uci.ics.jung.graph.Graph<V,E> graph) Get edge ends (lowest first, as if undirected)
int	getIndex(edu.uci.ics.jung.graph.Graph<V,E> graph, E edge)
(package private) void	init(edu.uci.ics.jung.graph.Graph<V,E> graph) Initialize
private boolean	join(E edge1, E edge2, edu.uci.ics.jung.graph.Graph<V,E> graph) Whether first edge joins second (its target is the second's source or target)
(package private) java.util.Comparator<E>	makeEdgeIndexComparator() Get edge index comparator
private boolean	overlap(E edge1, E edge2, edu.uci.ics.jung.graph.Graph<V,E> graph) Whether edges overlap
void	reset()
void	reset(edu.uci.ics.jung.graph.Graph<V,E> g, E edge)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

edgeIndices

protected java.util.Map<E,java.lang.Integer> edgeIndices

Allocation table

Constructor Detail

EdgeIndexFunctionImpl

public EdgeIndexFunctionImpl()

Constructor

Method Detail

init

void init(edu.uci.ics.jung.graph.Graph<V,E> graph)

Initialize

Parameters:

graph - graph

getIndex

public int getIndex(edu.uci.ics.jung.graph.Graph<V,E> graph,
                    E edge)

Specified by:

getIndex in interface edu.uci.ics.jung.graph.util.EdgeIndexFunction<V extends HasIndex,E>

reset

public void reset(edu.uci.ics.jung.graph.Graph<V,E> g,
                  E edge)

Specified by:

reset in interface edu.uci.ics.jung.graph.util.EdgeIndexFunction<V extends HasIndex,E>

reset

public void reset()

Specified by:

reset in interface edu.uci.ics.jung.graph.util.EdgeIndexFunction<V extends HasIndex,E>

allocate

private EdgeIndexFunctionImpl.Pair<java.lang.Integer,java.util.Map<E,java.lang.Integer>> allocate(edu.uci.ics.jung.graph.Graph<V,E> graph)

Layout edge heights

Parameters:

graph - graph

Returns:

(max height slot, edge 2 height slot map)

allocateHeight

private int allocateHeight(E edge0,
                           edu.uci.ics.jung.graph.Graph<V,E> graph,
                           java.util.Map<E,java.lang.Integer> edge2HeightMap)

Allocate height slot (0-based)

Parameters:

edge0 - target edge to find height for

graph - graph

edge2HeightMap - edge to height map

Returns:

allocated height slot

getEnds

private EdgeIndexFunctionImpl.Pair<V,V> getEnds(E edge,
                                                edu.uci.ics.jung.graph.Graph<V,E> graph)

Get edge ends (lowest first, as if undirected)

Parameters:

edge - edge

graph - graph

Returns:

ordered pair of ends

overlap

private boolean overlap(E edge1,
                        E edge2,
                        edu.uci.ics.jung.graph.Graph<V,E> graph)

Whether edges overlap

Parameters:

edge1 - edge

edge2 - edge

graph - graph

Returns:

true if edges overlap

join

private boolean join(E edge1,
                     E edge2,
                     edu.uci.ics.jung.graph.Graph<V,E> graph)

Whether first edge joins second (its target is the second's source or target)

Parameters:

edge1 - edge 1

edge2 - edge 2

graph - graph

Returns:

true if first edge reaches second

compareTo

private int compareTo(V v1,
                      V v2)

Compare vertex indices

Parameters:

v1 - vertex1

v2 - vertex2

Returns:

comparison of vertex indices

makeEdgeIndexComparator

final java.util.Comparator<E> makeEdgeIndexComparator()

Get edge index comparator

Returns:

comparator