Class DenseTCGraph.UnmodifiableDenseTCGraph<K extends Edge>

java.lang.Object

it.univr.di.cstnu.graph.DenseTCGraph<K>

it.univr.di.cstnu.graph.DenseTCGraph.UnmodifiableDenseTCGraph<K>

Type Parameters:

K - the type of edges

All Implemented Interfaces:

TemporalConstraintGraph<K>, PropertyChangeListener, Serializable, EventListener

Enclosing class:

DenseTCGraph<E extends Edge>

public static class DenseTCGraph.UnmodifiableDenseTCGraph<K extends Edge>
extends DenseTCGraph<K>

Unmodifiable version of this graph.

Version:

$Rev: 1168 $

Author:

posenato

See Also:

• Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from class DenseTCGraph

DenseTCGraph.UnmodifiableDenseTCGraph<K>

Modifier and Type	Class	Description
static class	DenseTCGraph.UnmodifiableDenseTCGraph<K extends Edge>	Unmodifiable version of this graph.

Nested classes/interfaces inherited from interface TemporalConstraintGraph

TemporalConstraintGraph.EdgeAndNode<E>

Modifier and Type	Interface	Description
static final record	TemporalConstraintGraph.EdgeAndNode<E extends Edge>	An edge paired with the canonical vertex at the opposite end of a traversal.

Field Summary

Fields inherited from class DenseTCGraph

growFactor, INITIAL_DIMENSION

Modifier and Type	Field	Description
(package private) static final float	growFactor	Adjacency grow factor: This represents the multiplication factor used to increase the dimension of the adjacency matrix.
(package private) static final int	INITIAL_DIMENSION	Initial graph dimension

Constructor Summary

Constructors

Constructor	Description
UnmodifiableDenseTCGraph(DenseTCGraph<K> network)	Default constructor

Method Summary

Modifier and Type	Method	Description
void	addChildToObserverNode(LabeledNode obs, char child)	Unsupported.
boolean	addEdge(K e, LabeledNode v1, LabeledNode v2)	Unsupported.
void	addEdge(K e, String v1Name, String v2Name)	Unsupported.
boolean	addVertex(LabeledNode vertex)	Unsupported.
final void	clear()	Makes this graph empty.
void	clear(int initialAdjSize)	Unsupported
void	clearCache()	Unsupported.
void	copy(DenseTCGraph<K> g)	Unsupported.
DenseTCGraph<K>	newInstance(TemporalConstraintGraph<K> source)	Unsupported.
final <F extends Edge, I extends F> DenseTCGraph<F>	newInstance(String inputName, Class<I> edgeImplClass, int initialCapacity)	Unsupported.
final void	propertyChange(PropertyChangeEvent pce)
boolean	removeEdge(String edgeName)	Unsupported.
boolean	removeEdge(K edge)	Unsupported.
boolean	removeEmptyEdges()	Unsupported.
final boolean	removeVertex(LabeledNode removingNode)	Unsupported.
void	renameEdge(K edge, String newName)	Unsupported.
void	renameNode(LabeledNode node, String newName)	Unsupported.
void	replaceContentsFrom(TemporalConstraintGraph<K> g)	Unsupported.
void	reverse()	Unsupported.
void	setInputFile(File file)	Unsupported.
void	setName(String graphName)	Unsupported.
void	setZ(LabeledNode z)	Unsupported.
void	takeFrom(DenseTCGraph<? extends K> g)	Unsupported.
void	transpose()	Unsupported.

Methods inherited from class DenseTCGraph

addAnnotation, addEdgeWithoutCheck, addVertexWithoutCheck, clearAnnotations, containsEdge, containsVertex, differentEdgesOf, findEdge, getALabelAlphabet, getAnnotations, getCheckOutcome, getChildrenOf, getContingentNodeCount, getDest, getDest, getDispatchabilityOutcome, getEdge, getEdgeCount, getEdgeFactory, getEdgeImplClass, getEdges, getEdgesAndNodes, getEdgesOrdered, getFileName, getIncidentEdges, getInEdges, getInEdgesAndNodes, getInEdgesAndSources, getInputFile, getLowerLabeledEdges, getName, getNode, getNodeFactory, getNodesOrdered, getObservedAndObserver, getObserver, getObserver2ZEdges, getObserverCount, getObservers, getOutEdges, getOutEdgesAndDestinations, getOutEdgesAndNodes, getPropositions, getSource, getSource, getType, getUpperLabeledEdges, getVertexCount, getVertices, getZ, hasSameVerticesOf, inDegree, newEdgeInstance, newInstance, newPredecessorInstance, outDegree, removeAnnotation, setCheckOutcome, setDispatchabilityOutcome, setType, toString, unmodifiable

Modifier and Type	Method	Description
final void	addAnnotation(GraphAnnotation annotation)	Adds a presentation-only plain-text annotation to this graph.
final void	addEdgeWithoutCheck(K e, String v1Name, String v2Name)	Optimized method for adding an edge without any security check and listener modification for edges.
final void	addVertexWithoutCheck(LabeledNode vertex)	Adds the given vertex to the graph without checking its previous presence and without adding any listeners to it.
void	clearAnnotations()	Removes every presentation-only annotation from this graph.
boolean	containsEdge(K edge)	Tests whether this graph contains an edge whose name matches the name of the supplied edge.
boolean	containsVertex(LabeledNode vertex)
final it.unimi.dsi.fastutil.objects.ObjectList<it.unimi.dsi.fastutil.objects.ObjectObjectImmutablePair<K,K>>	differentEdgesOf(DenseTCGraph<K> g1)	Returns the list of different edges of this graph from g1.
final K	findEdge(String s, String d)	Find the edge given the names of the source node and the destination node.
final ALabelAlphabet	getALabelAlphabet()
final List<GraphAnnotation>	getAnnotations()	Returns the annotations in their drawing order.
final CheckOutcome	getCheckOutcome()
final Label	getChildrenOf(LabeledNode obs)	Given an 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.
final int	getContingentNodeCount()
final LabeledNode	getDest(K directedEdge)	Returns the destination endpoint of the edge identified by the supplied edge's name.
final LabeledNode	getDest(String edgeName)	Wrapper DenseTCGraph.getDest(Edge)
final DispatchabilityOutcome	getDispatchabilityOutcome()
final K	getEdge(String s)	Returns the edge associated with the name.
final int	getEdgeCount()
final EdgeSupplier<K>	getEdgeFactory()	Getter for the field edgeFactory.
final Class<? extends K>	getEdgeImplClass()	Returns the concrete class that this graph uses to instantiate its edges.
final Collection<K>	getEdges()	Returns an independent collection of the edges of this graph.
final it.unimi.dsi.fastutil.objects.ObjectList<org.apache.commons.lang3.tuple.Triple<LabeledNode, K, LabeledNode>>	getEdgesAndNodes()
final Collection<K>	getEdgesOrdered()
final File	getFileName()
final it.unimi.dsi.fastutil.objects.ObjectList<K>	getIncidentEdges(LabeledNode vertex)	Returns all edges incident to vertex (its outgoing edges plus its incoming edges, without double-counting a self-loop).
final it.unimi.dsi.fastutil.objects.ObjectList<K>	getInEdges(LabeledNode vertex)
final it.unimi.dsi.fastutil.objects.ObjectList<it.unimi.dsi.fastutil.objects.ObjectObjectImmutablePair<K, LabeledNode>>	getInEdgesAndNodes(LabeledNode vertex)	It is an optimization of DenseTCGraph.getInEdges(LabeledNode) that also returns the source node of the incoming edge.
Collection<TemporalConstraintGraph.EdgeAndNode<K>>	getInEdgesAndSources(LabeledNode vertex)	Returns an unmodifiable snapshot of pairs (edge, canonical source) for all incoming edges of vertex.
File	getInputFile()
it.unimi.dsi.fastutil.objects.ObjectList<BasicCSTNUEdge>	getLowerLabeledEdges()
final String	getName()
final LabeledNode	getNode(String s)	Returns the node associated with the name.
LabeledNodeSupplier	getNodeFactory()
final Collection<LabeledNode>	getNodesOrdered()
final it.unimi.dsi.fastutil.chars.Char2ObjectMap<LabeledNode>	getObservedAndObserver()
final LabeledNode	getObserver(char c)
final it.unimi.dsi.fastutil.objects.ObjectList<K>	getObserver2ZEdges()	Be careful!
final int	getObserverCount()
Collection<LabeledNode>	getObservers()
final it.unimi.dsi.fastutil.objects.ObjectList<K>	getOutEdges(LabeledNode vertex)
final Collection<TemporalConstraintGraph.EdgeAndNode<K>>	getOutEdgesAndDestinations(LabeledNode vertex)	Returns an unmodifiable snapshot of pairs (edge, canonical destination) for all outgoing edges of vertex.
final it.unimi.dsi.fastutil.objects.ObjectList<it.unimi.dsi.fastutil.objects.ObjectObjectImmutablePair<K, LabeledNode>>	getOutEdgesAndNodes(LabeledNode vertex)	It is an optimization of DenseTCGraph.getOutEdges(LabeledNode) that also returns the destination node of the outgoing edge.
it.unimi.dsi.fastutil.chars.CharSet	getPropositions()	getPropositions.
final LabeledNode	getSource(K edge)	Returns the source endpoint of the edge identified by the supplied edge's name.
final LabeledNode	getSource(String edgeName)	Wrapper of DenseTCGraph.getSource(Edge)
TemporalConstraintNetworkType	getType()
Set<BasicCSTNUEdge>	getUpperLabeledEdges()
final int	getVertexCount()
final Collection<LabeledNode>	getVertices()
final LabeledNode	getZ()
boolean	hasSameVerticesOf(DenseTCGraph<K> g1)
final int	inDegree(LabeledNode vertex)
final K	newEdgeInstance(String edgeName, Edge.ConstraintType edgeType)	Creates an edge instance without reserving or normalizing its name against this graph.
final DenseTCGraph<K>	newInstance(String inputName, int initialCapacity)	Creates a new, empty temporal-constraint graph with the same concrete backend and the same concrete edge implementation as this graph.
TemporalConstraintPredecessorGraph<K>	newPredecessorInstance()	Creates an empty predecessor-relation container suitable for algorithms running on this graph.
final int	outDegree(LabeledNode vertex)
void	removeAnnotation(GraphAnnotation annotation)	Removes a presentation-only annotation from this graph.
final void	setCheckOutcome(CheckOutcome outcome)	Sets or clears the persisted check result.
final void	setDispatchabilityOutcome(DispatchabilityOutcome outcome)	Sets or clears the persisted dispatchability representation.
final void	setType(TemporalConstraintNetworkType inputType)	Declares the temporal-network kind represented by this graph.
final String	toString()
static <K extends Edge> DenseTCGraph.UnmodifiableDenseTCGraph<K>	unmodifiable(DenseTCGraph<K> g)	Returns an unmodifiable DenseTCGraph backed by the given DenseTCGraph.

Methods inherited from class Object

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

Methods inherited from interface TemporalConstraintGraph

clearOutcomes, copyCleaningRedundantLabels, findEdge, getPredecessors, getSuccessors, getUniqueEdgeName, getVerticesArray, hasSameEdgesOf, makeNewEdge, ownsEdge, ownsNode, promoteToPCSTNUIfParameter, recordCheckOutcome, recordDispatchabilityOutcome, rewriteALetterReferences

Modifier and Type	Method	Description
default void	clearOutcomes()	Clears both the persisted check result and the persisted dispatchability representation.
default void	copyCleaningRedundantLabels(TemporalConstraintGraph<K> source)	Populates this (initially empty) graph as a copy of source, dropping labeled values whose label contains the unknown literal or whose value is Constants.INT_NEG_INFINITE, and dropping edges left empty by this filtering.
default K	findEdge(LabeledNode source, LabeledNode destination)	Finds the directed edge from source to destination, or null.
default Collection<LabeledNode>	getPredecessors(LabeledNode vertex)
default Collection<LabeledNode>	getSuccessors(LabeledNode vertex)
default String	getUniqueEdgeName(String edgeName)	Returns edgeName when available; otherwise appends the first available suffix among _0, _1, and so on.
default LabeledNode[]	getVerticesArray()
default boolean	hasSameEdgesOf(TemporalConstraintGraph<K> other)	Returns true if this graph contains the same set of edges as other.
default K	makeNewEdge(String edgeName, Edge.ConstraintType edgeType)	Creates a new edge suitable for this graph, with a non-conflicting name and the requested constraint type.
default boolean	ownsEdge(K edge)	true if and only if the supplied edge object is the same object stored in this graph (compared by identity, not by name).
default boolean	ownsNode(LabeledNode node)	true if and only if the supplied node object is the same object stored in this graph (compared by identity, not by name).
default void	promoteToPCSTNUIfParameter(LabeledNode node)	Makes this graph a PCSTNU when node is a parameter one and the graph still calls itself a CSTNU.
default void	recordCheckOutcome(CheckOutcome.Kind kind, boolean successful, String algorithm)	Builds and stores a CheckOutcome, stamped with CheckOutcome.currentToolVersion().
default void	recordDispatchabilityOutcome(DispatchabilityOutcome.Status status, String algorithm)	Builds and stores a DispatchabilityOutcome.
default void	rewriteALetterReferences(ALabelAlphabet.ALetter oldLetter, ALabelAlphabet.ALetter newLetter)	Rewrites every A-Label-based semantic reference to oldLetter, throughout this graph, into newLetter.

Constructor Details

UnmodifiableDenseTCGraph

public UnmodifiableDenseTCGraph(DenseTCGraph<K> network)

Default constructor

Parameters:

network - to make unmodifiable

Method Details

addChildToObserverNode

public void addChildToObserverNode(@Nonnull
 LabeledNode obs,
 char child)

Unsupported.

Overrides:

addChildToObserverNode in class DenseTCGraph<K extends Edge>

Parameters:

obs - a LabeledNode object.

child - a char.

addEdge

public boolean addEdge(@Nonnull
 K e,
 @Nonnull
 LabeledNode v1,
 @Nonnull
 LabeledNode v2)

Unsupported.

Specified by:

addEdge in interface TemporalConstraintGraph<K extends Edge>

Overrides:

addEdge in class DenseTCGraph<K extends Edge>

Parameters:

e - edge to add

v1 - source endpoint

v2 - destination endpoint

Returns:

true if the graph changed

See Also:

• DenseTCGraph.addEdge(Edge, String, String)

addEdge

public void addEdge(@Nonnull
 K e,
 @Nonnull
 String v1Name,
 @Nonnull
 String v2Name)

Unsupported.

Specified by:

addEdge in interface TemporalConstraintGraph<K extends Edge>

Overrides:

addEdge in class DenseTCGraph<K extends Edge>

Parameters:

e - not null

v1Name - not null

v2Name - not null

addVertex

public boolean addVertex(@Nonnull
 LabeledNode vertex)

Unsupported.

Specified by:

addVertex in interface TemporalConstraintGraph<K extends Edge>

Overrides:

addVertex in class DenseTCGraph<K extends Edge>

Parameters:

vertex - time-point to add

Returns:

true if the graph changed

clear

public final void clear()

Makes this graph empty.

Specified by:

clear in interface TemporalConstraintGraph<K extends Edge>

Overrides:

clear in class DenseTCGraph<K extends Edge>

clear

public void clear(int initialAdjSize)

Unsupported

Overrides:

clear in class DenseTCGraph<K extends Edge>

Parameters:

initialAdjSize - expected number of vertices.

clearCache

public void clearCache()

Unsupported.

Specified by:

clearCache in interface TemporalConstraintGraph<K extends Edge>

Overrides:

clearCache in class DenseTCGraph<K extends Edge>

copy

public void copy(@Nonnull
 DenseTCGraph<K> g)

Unsupported.

Overrides:

copy in class DenseTCGraph<K extends Edge>

Parameters:

g - the graph to copy.

newInstance

@NonNull
public final <F extends Edge, I extends F>
DenseTCGraph<F> newInstance(@Nonnull
 String inputName,
 @Nonnull
 Class<I> edgeImplClass,
 int initialCapacity)

Unsupported.

Specified by:

newInstance in interface TemporalConstraintGraph<K extends Edge>

Overrides:

newInstance in class DenseTCGraph<K extends Edge>

Type Parameters:

F - the new graph's API-level edge type (e.g., CSTNEdge)

I - the concrete edge implementation, a subtype of F (e.g., CSTNEdgePluggable); kept distinct from F so that callers can assign the result to a TemporalConstraintGraph<F> variable without an unchecked cast, while edgeImplClass stays the concrete, instantiable class

Parameters:

inputName - new graph's name, for diagnostics

edgeImplClass - concrete edge implementation for the new graph

initialCapacity - expected vertex count, used as a pre-sizing hint by implementations whose internal storage benefits from it (e.g., DenseTCGraph's adjacency matrix); implementations without a capacity-aware constructor may ignore it

Returns:

a new, empty graph of the same concrete backend as this graph and of the requested edge type

newInstance

@NonNull
public DenseTCGraph<K> newInstance(@Nonnull
 TemporalConstraintGraph<K> source)

Unsupported.

Parameters:

source - the graph to copy; may use a different backend than the receiver

Returns:

a new graph, of the receiver's concrete backend and edge implementation, that is a faithful copy of source

propertyChange

public final void propertyChange(@Nonnull
 PropertyChangeEvent pce)

Specified by:

propertyChange in interface PropertyChangeListener

Overrides:

propertyChange in class DenseTCGraph<K extends Edge>

removeEdge

public boolean removeEdge(@Nonnull
 K edge)

Unsupported.

Parameters:

edge - edge to remove

Returns:

true if the graph changed

removeEdge

public boolean removeEdge(@Nonnull
 String edgeName)

Unsupported.

Specified by:

removeEdge in interface TemporalConstraintGraph<K extends Edge>

Overrides:

removeEdge in class DenseTCGraph<K extends Edge>

Parameters:

edgeName - a String object.

Returns:

true if the edge was removed, false if the edge is not present.

removeEmptyEdges

public boolean removeEmptyEdges()

Unsupported.

Returns:

true if at least one edge has been removed.

removeVertex

public final boolean removeVertex(@Nonnull
 LabeledNode removingNode)

Unsupported.

Specified by:

removeVertex in interface TemporalConstraintGraph<K extends Edge>

Overrides:

removeVertex in class DenseTCGraph<K extends Edge>

Parameters:

removingNode - time-point to remove

Returns:

true if the node was removed, false if the node was not present and, therefore, not removed.

renameEdge

public void renameEdge(@Nonnull
 K edge,
 @Nonnull
 String newName)

Unsupported.

Specified by:

renameEdge in interface TemporalConstraintGraph<K extends Edge>

Overrides:

renameEdge in class DenseTCGraph<K extends Edge>

Parameters:

edge - an edge already contained in this graph

newName - the new, non-empty, not-already-used name

renameNode

public void renameNode(@Nonnull
 LabeledNode node,
 @Nonnull
 String newName)

Unsupported.

Specified by:

renameNode in interface TemporalConstraintGraph<K extends Edge>

Overrides:

renameNode in class DenseTCGraph<K extends Edge>

Parameters:

node - a node already contained in this graph

newName - the new, non-empty, not-already-used name

replaceContentsFrom

public void replaceContentsFrom(@Nonnull
 TemporalConstraintGraph<K> g)

Unsupported.

Specified by:

replaceContentsFrom in interface TemporalConstraintGraph<K extends Edge>

Overrides:

replaceContentsFrom in class DenseTCGraph<K extends Edge>

Parameters:

g - same-backend graph whose contents become this graph's contents

reverse

public void reverse()

Unsupported.

Overrides:

reverse in class DenseTCGraph<K extends Edge>

setInputFile

public void setInputFile(@Nullable
 File file)

Unsupported.

Specified by:

setInputFile in interface TemporalConstraintGraph<K extends Edge>

Overrides:

setInputFile in class DenseTCGraph<K extends Edge>

Parameters:

file - a File object.

setName

public void setName(@Nonnull
 String graphName)

Unsupported.

Specified by:

setName in interface TemporalConstraintGraph<K extends Edge>

Overrides:

setName in class DenseTCGraph<K extends Edge>

Parameters:

graphName - the name to set

setZ

public void setZ(LabeledNode z)

Unsupported.

Specified by:

setZ in interface TemporalConstraintGraph<K extends Edge>

Overrides:

setZ in class DenseTCGraph<K extends Edge>

Parameters:

z - the node to be set as the Z node of the network. If z is null, then the Z information is nullified.

takeFrom

public void takeFrom(@Nonnull
 DenseTCGraph<? extends K> g)

Unsupported.

Overrides:

takeFrom in class DenseTCGraph<K extends Edge>

Parameters:

g - the graph to cannibalize.

transpose

public void transpose()

Unsupported.

Specified by:

transpose in interface TemporalConstraintGraph<K extends Edge>

Overrides:

transpose in class DenseTCGraph<K extends Edge>