LabeledIntGraph (CSTNU 1.26-SNAPSHOT API)

java.lang.Object
- edu.uci.ics.jung.graph.AbstractGraph<V,E>
- - edu.uci.ics.jung.graph.AbstractTypedGraph<LabeledNode,LabeledIntEdge>
  - - it.univr.di.cstnu.graph.LabeledIntGraph

All Implemented Interfaces:

edu.uci.ics.jung.graph.DirectedGraph<LabeledNode,LabeledIntEdge>, edu.uci.ics.jung.graph.Graph<LabeledNode,LabeledIntEdge>, edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>, Serializable, Observer
```
public class LabeledIntGraph
extends edu.uci.ics.jung.graph.AbstractTypedGraph<LabeledNode,LabeledIntEdge>
implements edu.uci.ics.jung.graph.DirectedGraph<LabeledNode,LabeledIntEdge>, Observer
```
This class tries to represent dense graphs where nodes LabeledNode and edges are LabeledIntEdge implementing the interface DirectedGraph in order to allow the representation of graph by Jung library.

Version:

$Id: $Id

Author:

posenato

See Also:

Serialized Form

Constructor Summary

Constructors
Constructor and Description
`LabeledIntGraph(Class<C> internalMapImplementationClass)`
`LabeledIntGraph(Class<C> internalMapImplementationClass, ALabelAlphabet alphabet)`
`LabeledIntGraph(LabeledIntGraph g, Class<C> internalMapImplementationClass)` A constructor that copy a given graph g using copy constructor even for internal structures.
`LabeledIntGraph(String name, Class<C> internalMapImplementationClass)` Constructor for LabeledIntGraph.
`LabeledIntGraph(String name, Class<C> internalMapImplementationClass, ALabelAlphabet alphabet)` Constructor for LabeledIntGraph.

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`void`	`addChildToObserverNode(LabeledNode obs, char child)` Add child to obs.
`boolean`	`addEdge(AbstractLabeledIntEdge e, String v1Name, String v2Name)` Optimized method for adding edge.
`boolean`	`addEdge(LabeledIntEdge e, LabeledNode v1, LabeledNode v2)`
`boolean`	`addEdge(LabeledIntEdge e, LabeledNode v1, LabeledNode v2, edu.uci.ics.jung.graph.util.EdgeType edge_type1)`
`boolean`	`addEdge(LabeledIntEdge edge, edu.uci.ics.jung.graph.util.Pair<? extends LabeledNode> endpoints, edu.uci.ics.jung.graph.util.EdgeType edgeType)`
`boolean`	`addVertex(LabeledNode vertex)`
`void`	`clear()` clear all internal structures.
`void`	`clear(int initialAdjSize)` Clear all internal structures.
`void`	`clearCache()` Clear all internal caches.
`boolean`	`containsEdge(LabeledIntEdge edge)`
`boolean`	`containsVertex(LabeledNode vertex)`
`void`	`copy(LabeledIntGraph g)` Defensive copy of all internal structures of g into this. This method is useful to copy a graph into the current without modifying the reference to the current.
`void`	`copyCleaningRedundantLabels(LabeledIntGraph g)` Makes a copy as `copy(LabeledIntGraph)` removing all possible redundant labeled values in the given graph.
`boolean`	`equals(Object o)` Equals based on equals of edges and vertices.
`LabeledIntEdge`	`findEdge(LabeledNode s, LabeledNode d)`
`LabeledIntEdge`	`findEdge(String s, String d)` Find the edge given the name of source node and destination one.
`ALabelAlphabet`	`getALabelAlphabet()`
`Label`	`getChildrenOf(LabeledNode obs)` Given a observation node `obs` that observes the proposition 'p', its 'children' are all observation nodes, Q, for which 'p' appears in the label of node Q.
`int`	`getContingentCount()`
`LabeledNode`	`getDest(LabeledIntEdge directedEdge)`
`LabeledIntEdge`	`getEdge(String s)` Returns the edge associated to the name.
`int`	`getEdgeCount()`
`LabeledIntEdgeSupplier<? extends LabeledIntMap>`	`getEdgeFactory()`
`Collection<LabeledIntEdge>`	`getEdges()`
`LabeledIntEdge[]`	`getEdgesArray()` getEdgesArray.
`edu.uci.ics.jung.graph.util.Pair<LabeledNode>`	`getEndpoints(LabeledIntEdge edge)` getEdgesArray.
`File`	`getFileName()`
`Collection<LabeledIntEdge>`	`getIncidentEdges(LabeledNode vertex)`
`Collection<LabeledIntEdge>`	`getInEdges(LabeledNode vertex)`
`Class<? extends LabeledIntMap>`	`getInternalLabeledValueMapImplementationClass()`
`it.unimi.dsi.fastutil.objects.ObjectList<LabeledIntEdge>`	`getLowerLabeledEdges()` getLowerLabeledEdges.
`String`	`getName()` Getter for the field `name`.
`Collection<LabeledNode>`	`getNeighbors(LabeledNode vertex)`
`LabeledNode`	`getNode(String s)` Returns the node associated to the name.
`Collection<LabeledNode>`	`getNodes()` getNodes.
`it.unimi.dsi.fastutil.chars.Char2ObjectMap<LabeledNode>`	`getObservedAndObserver()`
`LabeledNode`	`getObserver(char c)`
`it.unimi.dsi.fastutil.objects.ObjectList<LabeledIntEdge>`	`getObserver2ZEdges()` Be careful! The returned value is not a copy as the edges contained!
`int`	`getObserverCount()`
`Collection<LabeledNode>`	`getObservers()`
`Collection<LabeledIntEdge>`	`getOutEdges(LabeledNode vertex)`
`Collection<LabeledNode>`	`getPredecessors(LabeledNode vertex)`
`it.unimi.dsi.fastutil.chars.CharSet`	`getPropositions()` getPropositions.
`LabeledNode`	`getSource(LabeledIntEdge edge)`
`Collection<LabeledNode>`	`getSuccessors(LabeledNode vertex)`
`Set<LabeledIntEdge>`	`getUpperLabeledEdges()`
`int`	`getVertexCount()`
`Collection<LabeledNode>`	`getVertices()`
`LabeledNode[]`	`getVerticesArray()` getVerticesArray.
`LabeledNode`	`getZ()`
`int`	`hashCode()` Since equals has been specialized, hashCode too.
`boolean`	`hasSameEdgesOf(LabeledIntGraph g1)` hasSameEdgesOf.
`boolean`	`isDest(LabeledNode vertex, LabeledIntEdge edge)`
`boolean`	`isSource(LabeledNode vertex, LabeledIntEdge edge)`
`boolean`	`removeEdge(LabeledIntEdge edge)`
`boolean`	`removeVertex(LabeledNode removingNode)`
`boolean`	`reverse()` Reverse (transpose) the current graph.
`void`	`setFileName(File fileName)`
`void`	`setName(String name)` Setter for the field `name`.
`void`	`setZ(LabeledNode z)`
`void`	`takeIn(LabeledIntGraph g)` Takes in all internal structures of g. This method is useful to copy the references of internal data structure of the given graph 'g' into the current.
`String`	`toString()`
`void`	`update(Observable o, Object arg)`

Methods inherited from class edu.uci.ics.jung.graph.AbstractTypedGraph
getDefaultEdgeType, getEdgeCount, getEdges, getEdgeType

Methods inherited from class edu.uci.ics.jung.graph.AbstractGraph
addEdge, addEdge, addEdge, degree, findEdgeSet, getIncidentCount, getIncidentVertices, getNeighborCount, getOpposite, getPredecessorCount, getSuccessorCount, inDegree, isIncident, isNeighbor, isPredecessor, isSuccessor, outDegree

Methods inherited from class java.lang.Object
getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface edu.uci.ics.jung.graph.Graph
getOpposite, getPredecessorCount, getSuccessorCount, inDegree, isPredecessor, isSuccessor, outDegree

Methods inherited from interface edu.uci.ics.jung.graph.Hypergraph
addEdge, addEdge, degree, findEdgeSet, getDefaultEdgeType, getEdgeCount, getEdges, getEdgeType, getIncidentCount, getIncidentVertices, getNeighborCount, isIncident, isNeighbor

- Constructor Detail
  - LabeledIntGraph
```
public LabeledIntGraph(Class<C> internalMapImplementationClass)
```
    Parameters:
    
    internalMapImplementationClass - it is necessary for creating the right factory (reflection doesn't work due to reification!).
    A general and safe value is LabeledIntTreeMap. See LabeledIntMap and its implementing classes.
  - LabeledIntGraph
```
public LabeledIntGraph(Class<C> internalMapImplementationClass,
                       ALabelAlphabet alphabet)
```
    Parameters:
    
    internalMapImplementationClass - it is necessary for creating the right factory (reflection doesn't work due to reification!).
    A general and safe value is LabeledIntTreeMap. See LabeledIntMap and its implementing classes.
    
    alphabet - Alphabet to use for naming Upper Case label
  - LabeledIntGraph
```
public LabeledIntGraph(LabeledIntGraph g,
                       Class<C> internalMapImplementationClass)
```
    A constructor that copy a given graph g using copy constructor even for internal structures. If g is null, this new graph will be empty.
    
    Parameters:
    
    g - the graph to be cloned
    
    internalMapImplementationClass - it is necessary for creating the right factory (reflection doesn't work due to reification!).
    A general and safe value is LabeledIntTreeMap. See LabeledIntMap and its implementing classes.
  - LabeledIntGraph
```
public LabeledIntGraph(String name,
                       Class<C> internalMapImplementationClass)
```
    Constructor for LabeledIntGraph.
    
    Parameters:
    
    name - a name for the graph
    
    internalMapImplementationClass - it is necessary for creating the right factory (reflection doesn't work due to reification!) A general and safe value is LabeledIntTreeMap. See LabeledIntMap and its implementing classes.
  - LabeledIntGraph
```
public LabeledIntGraph(String name,
                       Class<C> internalMapImplementationClass,
                       ALabelAlphabet alphabet)
```
    Constructor for LabeledIntGraph.
    
    Parameters:
    
    name - a name for the graph
    
    internalMapImplementationClass - it is necessary for creating the right factory (reflection doesn't work due to reification!) A general and safe value is LabeledIntTreeMap. See LabeledIntMap and its implementing classes.
    
    alphabet - alfabet for upper case letter used to label values in the edges.
- Method Detail
  - addChildToObserverNode
```
public void addChildToObserverNode(LabeledNode obs,
                                   char child)
```
    Add child to obs. It is user responsibility to assure that 'child' is a children in CSTN sense of 'obs'. No validity check is made by the method.
    
    Parameters:
    
    obs -
    
    child -
  - addEdge
```
public boolean addEdge(AbstractLabeledIntEdge e,
                       String v1Name,
                       String v2Name)
```
    Optimized method for adding edge. It exploits internal structure of the class.
    
    Parameters:
    
    e -
    
    v1Name -
    
    v2Name -
    
    Returns:
    
    true if edge has been added.
  - addEdge
```
public boolean addEdge(LabeledIntEdge e,
                       LabeledNode v1,
                       LabeledNode v2)
```
    Specified by:
    
    addEdge in interface edu.uci.ics.jung.graph.Graph<LabeledNode,LabeledIntEdge>
    
    Overrides:
    
    addEdge in class edu.uci.ics.jung.graph.AbstractGraph<LabeledNode,LabeledIntEdge>
  - addEdge
```
public boolean addEdge(LabeledIntEdge e,
                       LabeledNode v1,
                       LabeledNode v2,
                       edu.uci.ics.jung.graph.util.EdgeType edge_type1)
```
    Specified by:
    
    addEdge in interface edu.uci.ics.jung.graph.Graph<LabeledNode,LabeledIntEdge>
    
    Overrides:
    
    addEdge in class edu.uci.ics.jung.graph.AbstractGraph<LabeledNode,LabeledIntEdge>
  - addEdge
```
public boolean addEdge(LabeledIntEdge edge,
                       edu.uci.ics.jung.graph.util.Pair<? extends LabeledNode> endpoints,
                       edu.uci.ics.jung.graph.util.EdgeType edgeType)
```
    Specified by:
    
    addEdge in class edu.uci.ics.jung.graph.AbstractGraph<LabeledNode,LabeledIntEdge>
  - addVertex
```
public boolean addVertex(LabeledNode vertex)
```
    Specified by:
    
    addVertex in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
  - clear
```
public void clear()
```
    clear all internal structures. The graph will be empty.
  - clear
```
public void clear(int initialAdjSize)
```
    Clear all internal structures. The graph will be erased.
    
    Parameters:
    
    initialAdjSize - initial number of vertices.
  - clearCache
```
public void clearCache()
```
    Clear all internal caches.
    Caches are automatically created during any modification or query about the graph structure.
  - containsEdge
```
public boolean containsEdge(LabeledIntEdge edge)
```
    Specified by:
    
    containsEdge in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
  - containsVertex
```
public boolean containsVertex(LabeledNode vertex)
```
    Specified by:
    
    containsVertex in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
  - copy
```
public void copy(LabeledIntGraph g)
```
    Defensive copy of all internal structures of g into this.
    This method is useful to copy a graph into the current without modifying the reference to the current. 'g' internal structures are copied as they are.
    
    Parameters:
    
    g - the graph to copy.
  - copyCleaningRedundantLabels
```
public void copyCleaningRedundantLabels(LabeledIntGraph g)
```
    Makes a copy as copy(LabeledIntGraph) removing all possible redundant labeled values in the given graph.
    
    Parameters:
    
    g - a LabeledIntGraph object.
  - equals
```
public boolean equals(Object o)
```
    Equals based on equals of edges and vertices.
    
    Overrides:
    
    equals in class Object
  - findEdge
```
public LabeledIntEdge findEdge(LabeledNode s,
                               LabeledNode d)
```
    Specified by:
    
    findEdge in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
    
    Overrides:
    
    findEdge in class edu.uci.ics.jung.graph.AbstractGraph<LabeledNode,LabeledIntEdge>
  - findEdge
```
public LabeledIntEdge findEdge(String s,
                               String d)
```
    Find the edge given the name of source node and destination one.
    
    Parameters:
    
    s -
    
    d -
    
    Returns:
    
    null if any parameter is null or there not exists at least one of two nodes or the edge does not exist.
  - getALabelAlphabet
```
public ALabelAlphabet getALabelAlphabet()
```
    Returns:
    
    the aLabelAlphabet
  - getChildrenOf
```
public Label getChildrenOf(LabeledNode obs)
```
    Given a observation node obs that observes the proposition 'p', its 'children' are all observation nodes, Q, for which 'p' appears in the label of node Q.
    This method returns the set of children of a given node as a label of straight propositions associated to the children instead of a set of children nodes.
    
    Parameters:
    
    obs - a LabeledNode object.
    
    Returns:
    
    the set of children of observation node obs, null if there is no children.
  - getContingentCount
```
public int getContingentCount()
```
    Returns:
    
    the number of contingents
  - getDest
```
public LabeledNode getDest(LabeledIntEdge directedEdge)
```
    Specified by:
    
    getDest in interface edu.uci.ics.jung.graph.Graph<LabeledNode,LabeledIntEdge>
    
    Specified by:
    
    getDest in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
  - getEdge
```
public LabeledIntEdge getEdge(String s)
```
    Returns the edge associated to the name.
    
    Parameters:
    
    s - a String object.
    
    Returns:
    
    the edge associated to the name.
  - getEdgeCount
```
public int getEdgeCount()
```
    Specified by:
    
    getEdgeCount in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
  - getEdgeFactory
```
public LabeledIntEdgeSupplier<? extends LabeledIntMap> getEdgeFactory()
```
    Returns:
    
    the edgeFactory
  - getEdges
```
public Collection<LabeledIntEdge> getEdges()
```
    Specified by:
    
    getEdges in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
  - getEdgesArray
```
public LabeledIntEdge[] getEdgesArray()
```
    getEdgesArray.
    
    Returns:
    
    the set of edges as an array.
  - getEndpoints
```
public edu.uci.ics.jung.graph.util.Pair<LabeledNode> getEndpoints(LabeledIntEdge edge)
```
    getEdgesArray. NON FUNZIONA... è come scrivere LabeledIntEdge[] getEdgesArray() {
    
    Specified by:
    
    getEndpoints in interface edu.uci.ics.jung.graph.Graph<LabeledNode,LabeledIntEdge>
    
    Returns:
    
    the set of edges as an array ordered w.r.t the name of edge in ascending order. @SuppressWarnings("unchecked") public E[] getEdgesArray() { final E[] edgesA = (E[]) this.getEdges().toArray(edgeFactory.getLabeledIntEdge(this.getEdgeCount())); return edgesA; }
  - getFileName
```
public File getFileName()
```
    Returns:
    
    the name of the file that contains this graph.
  - getIncidentEdges
```
public Collection<LabeledIntEdge> getIncidentEdges(LabeledNode vertex)
```
    Specified by:
    
    getIncidentEdges in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
  - getInEdges
```
public Collection<LabeledIntEdge> getInEdges(LabeledNode vertex)
```
    Specified by:
    
    getInEdges in interface edu.uci.ics.jung.graph.Graph<LabeledNode,LabeledIntEdge>
    
    Specified by:
    
    getInEdges in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
  - getInternalLabeledValueMapImplementationClass
```
public Class<? extends LabeledIntMap> getInternalLabeledValueMapImplementationClass()
```
    Returns:
    
    the edgeImplementationClass
  - getLowerLabeledEdges
```
public it.unimi.dsi.fastutil.objects.ObjectList<LabeledIntEdge> getLowerLabeledEdges()
```
    getLowerLabeledEdges.
    
    Returns:
    
    the set of edges containing Lower Case Labels!
  - getName
```
public String getName()
```
    Getter for the field name.
    
    Returns:
    
    the name
  - getNeighbors
```
public Collection<LabeledNode> getNeighbors(LabeledNode vertex)
```
    Specified by:
    
    getNeighbors in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
  - getNode
```
public LabeledNode getNode(String s)
```
    Returns the node associated to the name.
    
    Parameters:
    
    s - a String object.
    
    Returns:
    
    the node associated to the name if present, null otherwise.
  - getNodes
```
public Collection<LabeledNode> getNodes()
```
    getNodes.
    
    Returns:
    
    return the set of node ordered w.r.t. the lexicographical order of their names.
  - getObservedAndObserver
```
public it.unimi.dsi.fastutil.chars.Char2ObjectMap<LabeledNode> getObservedAndObserver()
```
    Returns:
    
    the map of propositions and their observers (nodes). If there is no observer node, it returns an empty map. The key is the literal observed.
  - getObserver
```
public LabeledNode getObserver(char c)
```
    Parameters:
    
    c - the request proposition
    
    Returns:
    
    the node that observes the proposition l if it exists, null otherwise.
  - getObserver2ZEdges
```
public it.unimi.dsi.fastutil.objects.ObjectList<LabeledIntEdge> getObserver2ZEdges()
```
    Be careful! The returned value is not a copy as the edges contained!
    
    Returns:
    
    the set of edges from observers to Z if Z is defined, empty set otherwise.
  - getObserverCount
```
public int getObserverCount()
```
    Returns:
    
    the number of observers.
  - getObservers
```
public Collection<LabeledNode> getObservers()
```
    Returns:
    
    the set of observator time-points.
  - getOutEdges
```
public Collection<LabeledIntEdge> getOutEdges(LabeledNode vertex)
```
    Specified by:
    
    getOutEdges in interface edu.uci.ics.jung.graph.Graph<LabeledNode,LabeledIntEdge>
    
    Specified by:
    
    getOutEdges in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
  - getPredecessors
```
public Collection<LabeledNode> getPredecessors(LabeledNode vertex)
```
    Specified by:
    
    getPredecessors in interface edu.uci.ics.jung.graph.Graph<LabeledNode,LabeledIntEdge>
    
    Specified by:
    
    getPredecessors in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
  - getPropositions
```
public it.unimi.dsi.fastutil.chars.CharSet getPropositions()
```
    getPropositions.
    
    Returns:
    
    the set of propositions of the graph.
  - getSource
```
public LabeledNode getSource(LabeledIntEdge edge)
```
    Specified by:
    
    getSource in interface edu.uci.ics.jung.graph.Graph<LabeledNode,LabeledIntEdge>
    
    Specified by:
    
    getSource in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
  - getSuccessors
```
public Collection<LabeledNode> getSuccessors(LabeledNode vertex)
```
    Specified by:
    
    getSuccessors in interface edu.uci.ics.jung.graph.Graph<LabeledNode,LabeledIntEdge>
    
    Specified by:
    
    getSuccessors in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
  - getUpperLabeledEdges
```
public Set<LabeledIntEdge> getUpperLabeledEdges()
```
    Returns:
    
    the set of edges containing Upper Case Label.
  - getVertexCount
```
public int getVertexCount()
```
    Specified by:
    
    getVertexCount in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
  - getVertices
```
public Collection<LabeledNode> getVertices()
```
    Specified by:
    
    getVertices in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
  - getVerticesArray
```
public LabeledNode[] getVerticesArray()
```
    getVerticesArray.
    
    Returns:
    
    the set of vertices as an array ordered w.r.t the name of node in ascending order.
  - getZ
```
public LabeledNode getZ()
```
    Returns:
    
    the Z node
  - hashCode
```
public int hashCode()
```
    Since equals has been specialized, hashCode too.
    
    Overrides:
    
    hashCode in class Object
  - hasSameEdgesOf
```
public boolean hasSameEdgesOf(LabeledIntGraph g1)
```
    hasSameEdgesOf.
    
    Parameters:
    
    g1 - a LabeledIntGraph object.
    
    Returns:
    
    true if this graph contains edges equal to g1 edges. Equals is checked using method equals(Object). False otherwise.
  - isDest
```
public boolean isDest(LabeledNode vertex,
                      LabeledIntEdge edge)
```
    Specified by:
    
    isDest in interface edu.uci.ics.jung.graph.Graph<LabeledNode,LabeledIntEdge>
  - isSource
```
public boolean isSource(LabeledNode vertex,
                        LabeledIntEdge edge)
```
    Specified by:
    
    isSource in interface edu.uci.ics.jung.graph.Graph<LabeledNode,LabeledIntEdge>
  - removeEdge
```
public boolean removeEdge(LabeledIntEdge edge)
```
    Specified by:
    
    removeEdge in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
  - reverse
```
public boolean reverse()
```
    Reverse (transpose) the current graph.
    
    Returns:
    
    true if the operation was successful.
  - removeVertex
```
public boolean removeVertex(LabeledNode removingNode)
```
    Specified by:
    
    removeVertex in interface edu.uci.ics.jung.graph.Hypergraph<LabeledNode,LabeledIntEdge>
  - setFileName
```
public void setFileName(File fileName)
```
    Parameters:
    
    fileName -
  - setName
```
public void setName(String name)
```
    Setter for the field name.
    
    Parameters:
    
    name - the name to set
  - setZ
```
public void setZ(LabeledNode z)
```
    Parameters:
    
    z - the node to be set as Z node of the graph.
  - takeIn
```
public void takeIn(LabeledIntGraph g)
```
    Takes in all internal structures of g.
    This method is useful to copy the references of internal data structure of the given graph 'g' into the current. It is not a clone because even if g!=this, all internal data structures are the same.
    
    Parameters:
    
    g - the graph to copy.
  - toString
```
public String toString()
```
    Overrides:
    
    toString in class edu.uci.ics.jung.graph.AbstractGraph<LabeledNode,LabeledIntEdge>
  - update
```
public void update(Observable o,
                   Object arg)
```
    Specified by:
    
    update in interface Observer

Class LabeledIntGraph

Constructor Summary

Method Summary

Methods inherited from class edu.uci.ics.jung.graph.AbstractTypedGraph

Methods inherited from class edu.uci.ics.jung.graph.AbstractGraph

Methods inherited from class java.lang.Object

Methods inherited from interface edu.uci.ics.jung.graph.Graph

Methods inherited from interface edu.uci.ics.jung.graph.Hypergraph

Constructor Detail

LabeledIntGraph

LabeledIntGraph

LabeledIntGraph

LabeledIntGraph

LabeledIntGraph

Method Detail

addChildToObserverNode

addEdge

addEdge

addEdge

addEdge

addVertex

clear

clear

clearCache

containsEdge

containsVertex

copy

copyCleaningRedundantLabels

equals

findEdge

findEdge

getALabelAlphabet

getChildrenOf

getContingentCount

getDest

getEdge

getEdgeCount

getEdgeFactory

getEdges

getEdgesArray

getEndpoints

getFileName

getIncidentEdges

getInEdges

getInternalLabeledValueMapImplementationClass

getLowerLabeledEdges

getName

getNeighbors

getNode

getNodes

getObservedAndObserver

getObserver

getObserver2ZEdges

getObserverCount

getObservers

getOutEdges

getPredecessors

getPropositions

getSource

getSuccessors

getUpperLabeledEdges

getVertexCount

getVertices

getVerticesArray

getZ

hashCode

hasSameEdgesOf

isDest

isSource

removeEdge

reverse

removeVertex

setFileName

setName

setZ

takeIn

toString

update