Uses of Interface edu.fiu.jtlex.data.IGraph

Uses of IGraph in edu.fiu.jtlex.data

Classes in edu.fiu.jtlex.data that implement IGraph
Modifier and Type	Class	Description
`class`	`Graph`	Default implementation of `IGraph`.

Methods in edu.fiu.jtlex.data that return IGraph
Modifier and Type	Method	Description
`IGraph`	IGraph.`clone()`	Returns a deep-copy of the current Graph object.

Methods in edu.fiu.jtlex.data that return types with arguments of type IGraph
Modifier and Type	Method	Description
`java.util.ArrayList<IGraph>`	IPartitioner.`classifyGraphs(java.util.ArrayList<IGraph> graphs)`	Finds the graph with the most nodes and classifies it as a MainGraph and set the others to a subordination graph.
`java.util.ArrayList<IGraph>`	Partitioner.`classifyGraphs(java.util.ArrayList<IGraph> graphs)`	Finds the graph with the most nodes and classifies it as a MainGraph and set the others to a subordination graph.
`java.util.Set<IGraph>`	IInconsistency.`generateInconsistentSubgraphs(IGraph timeMLGraph)`	Given a TimeML graph generates a set of subgraphs that contain all the links and nodes involved in the inconsistencies.
`java.util.Set<IGraph>`	InconsistencyDetector.`generateInconsistentSubgraphs(IGraph timeMLGraph)`	Given a TimeML graph generates a set of subgraphs that contain all the links and nodes involved in the inconsistencies.
`java.util.Set<IGraph>`	InconsistencyDetector.`generateSelfLoopingSubGraphs(java.util.Set<ILink> links)`	Given a set of links, identifies which are inconsistent self references, and produces a subgraph for each instance.
`java.util.ArrayList<IGraph>`	Graph.`getConsistentPartitions()`	Returns the set of consistent subordinate subgraphs.
`java.util.ArrayList<IGraph>`	IGraph.`getConsistentPartitions()`	Returns the set of consistent subordinate subgraphs.
`java.util.ArrayList<IGraph>`	Graph.`getInconsistentPartitions()`	Returns the set of inconsistent subordinate subgraphs.
`java.util.ArrayList<IGraph>`	IGraph.`getInconsistentPartitions()`	Returns the set of inconsistent subordinate subgraphs.
`java.util.Set<IGraph>`	Graph.`getInconsistentSubgraphs()`	Returns the set of inconsistent subgraphs.
`java.util.Set<IGraph>`	IGraph.`getInconsistentSubgraphs()`	Returns the set of inconsistent subgraphs.
`java.util.ArrayList<IGraph>`	Graph.`getPartitions()`	Returns the set of subordinate subgraphs.
`java.util.ArrayList<IGraph>`	IGraph.`getPartitions()`	Returns the set of subordinate subgraphs.
`java.util.ArrayList<IGraph>`	IPartitioner.`partitionGraph(IGraph timeMLGraph)`	Returns a list of partitioned subgraphs.
`java.util.ArrayList<IGraph>`	Partitioner.`partitionGraph(IGraph timeMLGraph)`	Returns a list of partitioned subgraphs.

Methods in edu.fiu.jtlex.data with parameters of type IGraph
Modifier and Type	Method	Description
`java.util.Set<IGraph>`	IInconsistency.`generateInconsistentSubgraphs(IGraph timeMLGraph)`	Given a TimeML graph generates a set of subgraphs that contain all the links and nodes involved in the inconsistencies.
`java.util.Set<IGraph>`	InconsistencyDetector.`generateInconsistentSubgraphs(IGraph timeMLGraph)`	Given a TimeML graph generates a set of subgraphs that contain all the links and nodes involved in the inconsistencies.
`Timex`	Disconnectivity.`getDct(IGraph partition)`	Gets the document creation time
`Timex`	IDisconnectivity.`getDct(IGraph partition)`	Gets the document creation time
`java.util.ArrayList<Timex>`	Disconnectivity.`getTimeExpressions(IGraph partition)`	Gets a list of time expressions
`java.util.ArrayList<Timex>`	IDisconnectivity.`getTimeExpressions(IGraph partition)`	Gets a list of time expressions
`boolean`	Disconnectivity.`hasDct(IGraph partition)`	Flags if a partition contains a document creation time.
`boolean`	IDisconnectivity.`hasDct(IGraph partition)`	Flags if the partition contains a document creation time
`boolean`	Disconnectivity.`hasTimeExpressions(IGraph partition)`	Flags if the partition contains time expressions.
`boolean`	IDisconnectivity.`hasTimeExpressions(IGraph partition)`	Flags if the partition contains time expressions
`boolean`	IInconsistency.`isConsistent(IGraph timeMLGraph)`	A method to verify the consistency of a graph.
`boolean`	InconsistencyDetector.`isConsistent(IGraph timeMLGraph)`	A static method to verify the consistency of a graph.
`java.util.ArrayList<IGraph>`	IPartitioner.`partitionGraph(IGraph timeMLGraph)`	Returns a list of partitioned subgraphs.
`java.util.ArrayList<IGraph>`	Partitioner.`partitionGraph(IGraph timeMLGraph)`	Returns a list of partitioned subgraphs.

Method parameters in edu.fiu.jtlex.data with type arguments of type IGraph
Modifier and Type	Method	Description
`java.util.ArrayList<IGraph>`	IPartitioner.`classifyGraphs(java.util.ArrayList<IGraph> graphs)`	Finds the graph with the most nodes and classifies it as a MainGraph and set the others to a subordination graph.
`java.util.ArrayList<IGraph>`	Partitioner.`classifyGraphs(java.util.ArrayList<IGraph> graphs)`	Finds the graph with the most nodes and classifies it as a MainGraph and set the others to a subordination graph.
`void`	Disconnectivity.`suggestLinks(java.util.ArrayList<IGraph> partitionList, Graph graph)`	Sends a list of suggested links to the graph
`void`	IDisconnectivity.`suggestLinks(java.util.ArrayList<IGraph> partitionList, Graph graph)`	Sends a list of suggested links to the graph

Constructors in edu.fiu.jtlex.data with parameters of type IGraph
Constructor	Description
`GraphTCSP(IGraph TMLGraph)`	Transforms the TimeML Graph into a Temporal Constraint Satasfaction Problem.
`IndeterminacyDetector(IGraph TimeMLGraph)`	Creates an Indeterminacy Detector with the a given TimeML Graph.