V
- E
- public class ObjectGrph<V,E>
extends java.lang.Object
Modifier and Type | Field and Description |
---|---|
protected Grph |
backingGrph |
Constructor and Description |
---|
ObjectGrph() |
ObjectGrph(int nbVertices,
int nbEdges) |
Modifier and Type | Method and Description |
---|---|
int |
addDirectedSimpleEdge(V src,
E e,
V dest) |
int |
addSimpleEdge(V src,
E e,
V dest,
boolean directed) |
int |
addUndirectedSimpleEdge(V src,
E e,
V dest) |
int |
addVertex(V v) |
boolean |
containsEdge(E e) |
boolean |
containsVertex(V v) |
void |
display() |
protected int |
e2i(E e) |
protected it.unimi.dsi.fastutil.ints.IntSet |
e2i(java.util.Set<E> set) |
java.util.Map<java.lang.String,java.util.Set<ObjectPath>> |
findMatchingPaths(java.util.Set<java.lang.String> patterns) |
java.util.Set<ObjectPath> |
getAllCycles() |
java.util.Set<ObjectPath> |
getAllPaths() |
V |
getDirectedSimpleEdgeHead(E e) |
V |
getDirectedSimpleEdgeTail(E e) |
java.lang.String |
getEdgeLabel(E e) |
java.util.Collection<E> |
getEdges() |
java.util.Set<E> |
getEdges(V src,
V dest) |
java.util.Set<E> |
getIncidentEdges(V v) |
java.util.Set<V> |
getIncidentVertices(E e) |
java.util.Collection<V> |
getOutNeighbors(V v) |
ObjectGrph<V,E> |
getSubGraph(Grph g) |
java.lang.String |
getVertexLabel(V v) |
java.util.Collection<V> |
getVertices() |
boolean |
hasIncidentEdges(V v) |
protected E |
i2e(int e) |
protected java.util.Set<E> |
i2e(it.unimi.dsi.fastutil.ints.IntSet set) |
protected V |
i2v(int v) |
protected java.util.Set<V> |
i2v(it.unimi.dsi.fastutil.ints.IntSet set) |
static void |
main(java.lang.String[] args) |
static void |
main2(java.lang.String[] args) |
void |
removeEdge(E e) |
void |
removeVertex(V v) |
void |
setEdgeLabel(E e,
java.lang.String s) |
void |
setVertexLabel(V v,
java.lang.String s) |
protected it.unimi.dsi.fastutil.ints.IntSet |
v2i(java.util.Collection<V> set) |
protected int |
v2i(V v) |
protected final Grph backingGrph
public ObjectGrph()
public ObjectGrph(int nbVertices, int nbEdges)
public ObjectGrph<V,E> getSubGraph(Grph g)
public boolean containsVertex(V v)
public boolean containsEdge(E e)
public int addVertex(V v)
public void removeVertex(V v)
public void removeEdge(E e)
public boolean hasIncidentEdges(V v)
protected int v2i(V v)
public java.util.Collection<V> getVertices()
public java.util.Collection<E> getEdges()
protected int e2i(E e)
protected V i2v(int v)
protected E i2e(int e)
protected java.util.Set<V> i2v(it.unimi.dsi.fastutil.ints.IntSet set)
protected it.unimi.dsi.fastutil.ints.IntSet v2i(java.util.Collection<V> set)
protected java.util.Set<E> i2e(it.unimi.dsi.fastutil.ints.IntSet set)
protected it.unimi.dsi.fastutil.ints.IntSet e2i(java.util.Set<E> set)
public void display()
public java.lang.String getEdgeLabel(E e)
public void setEdgeLabel(E e, java.lang.String s)
public java.lang.String getVertexLabel(V v)
public void setVertexLabel(V v, java.lang.String s)
public java.util.Set<ObjectPath> getAllPaths()
public java.util.Set<ObjectPath> getAllCycles()
public java.util.Map<java.lang.String,java.util.Set<ObjectPath>> findMatchingPaths(java.util.Set<java.lang.String> patterns)
public static void main(java.lang.String[] args)
public static void main2(java.lang.String[] args)