A B C D E F G H I J K L M N O P R S T U V W 

I

IDENT - Static variable in interface de.uni_due.inf.ti.graph.io.SgfParserConstants
RegularExpression Id.
image - Variable in class de.uni_due.inf.ti.graph.io.Token
The string image of the token.
IN_BLOCK_CMT - Static variable in interface de.uni_due.inf.ti.graph.io.SgfParserConstants
Lexical state.
inBuf - Variable in class de.uni_due.inf.ti.graph.io.SimpleCharStream
 
increaseAddCount() - Method in class de.uni_due.inf.ti.graph.Graph
Increase the addition count of this graph.
increaseDelCount() - Method in class de.uni_due.inf.ti.graph.Graph
Increases the deletion count of this graph.
input_stream - Variable in class de.uni_due.inf.ti.graph.io.SgfParserTokenManager
 
inputStream - Variable in class de.uni_due.inf.ti.graph.io.SimpleCharStream
 
inRange(Node) - Method in class de.uni_due.inf.ti.graph.Morphism
Determines whether a node occurs in the range of this morphism.
inRange(Edge) - Method in class de.uni_due.inf.ti.graph.Morphism
Determines wheter an edge occurs in the range of this morphism.
InterfaceGraph - Class in de.uni_due.inf.ti.graph
This class represents a hypergraph with an inner and an outer interface.
InterfaceGraph() - Constructor for class de.uni_due.inf.ti.graph.InterfaceGraph
Creates a new empty InterfaceGraph with empty interfaces.
InterfaceGraph(Graph) - Constructor for class de.uni_due.inf.ti.graph.InterfaceGraph
Creates a new InterfaceGraph which is a copy of another InterfaceGraph or Graph.
InterfaceGraph.Interface - Class in de.uni_due.inf.ti.graph
List which updates the parent class's modCount when it is modified.
InterfaceGraph.Interface(List<Node>) - Constructor for class de.uni_due.inf.ti.graph.InterfaceGraph.Interface
 
isBinary() - Method in class de.uni_due.inf.ti.graph.Edge
Returns whether this is a binary edge.
isBinary() - Method in class de.uni_due.inf.ti.graph.Graph
Determines if this graph is a binary graph.
isConflictFree(Morphism) - Method in class de.uni_due.inf.ti.graph.Rule
Determines whether a match is conflict-free with respect to this rule.
isDiscrete() - Method in class de.uni_due.inf.ti.graph.Graph
Determines if this graph is discrete.
isEmpty() - Method in class de.uni_due.inf.ti.graph.Graph
Returns true if this graph is an empty graph.
isEmpty() - Method in class de.uni_due.inf.ti.graph.util.IsomorphismHashSet
Determines whether this Isomorphism set is empty.
isExtensionOf(Morphism) - Method in class de.uni_due.inf.ti.graph.Morphism
Determines whether this morphism is an extension of another morphism.
isInjective() - Method in class de.uni_due.inf.ti.graph.InterfaceGraph.Interface
Determines whether this interface is injective.
isInjective() - Method in class de.uni_due.inf.ti.graph.Morphism
Determines whether this morphism is injective.
isIsomorphic(Graph) - Method in class de.uni_due.inf.ti.graph.Graph
Determines if this graph is isomorphic to another graph.
isIsomorphic(Rule) - Method in class de.uni_due.inf.ti.graph.NacRule
Checks whether this NacRule is isomorphic to another Rule.
isIsomorphic(Rule) - Method in class de.uni_due.inf.ti.graph.Rule
Determines whether this rule is isomorphic to another rule.
isIsomorphic(TransformationSystem) - Method in class de.uni_due.inf.ti.graph.TransformationSystem
Determines whether this transformation system is isomorphic to another transformation system.
isIsomorphism() - Method in class de.uni_due.inf.ti.graph.Morphism
Determines whether this morphism is an isomorphism.
isNotFalse() - Method in enum de.uni_due.inf.ti.graph.util.ThreeBool
Returns true is this is ThreeBool.TRUE or ThreeBool.UNKNOWN.
isOkay() - Method in class de.uni_due.inf.ti.graph.PathDecomposition.TestData
Determines whether this TestData object denotes success.
IsomorphismHashMap<T> - Class in de.uni_due.inf.ti.graph.util
Map of which the keys are graphs modulo isomorphism.
IsomorphismHashMap() - Constructor for class de.uni_due.inf.ti.graph.util.IsomorphismHashMap
Creates a new empty IsomorphismHashMap.
IsomorphismHashSet - Class in de.uni_due.inf.ti.graph.util
A set of Graphs which ensures that no two isomorphic graphs are contained in the set.
IsomorphismHashSet() - Constructor for class de.uni_due.inf.ti.graph.util.IsomorphismHashSet
Creates a new IsomorphismSet instance.
IsomorphismMap<V> - Interface in de.uni_due.inf.ti.graph.util
A map which maps graphs (modulo isomorphism) to objects.
IsomorphismSet - Interface in de.uni_due.inf.ti.graph.util
 
isSurjective() - Method in class de.uni_due.inf.ti.graph.Morphism
Determines if this morphism is surjective.
isTotal() - Method in class de.uni_due.inf.ti.graph.Morphism
Determines if this morphism is total.
isTrue() - Method in enum de.uni_due.inf.ti.graph.util.ThreeBool
Returns true if this is ThreeBool.TRUE.
iterator() - Method in class de.uni_due.inf.ti.graph.InterfaceGraph.Interface
 
iterator() - Method in class de.uni_due.inf.ti.graph.util.IsomorphismHashSet
Returns an iterator which iterates over the elements of this IsomorphismSet.
A B C D E F G H I J K L M N O P R S T U V W