IPartitioner

All Known Implementing Classes:: Partitioner

public interface IPartitioner

Interface used for the implementation to partition an input TimeML temporal graph into main subgraph and subordinating subgraphs. edges.

Author:: Tony Erazo

Method Summary

Modifier and Type	Method	Description
`java.util.ArrayList<IGraph>`	`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>`	`partitionGraph(IGraph timeMLGraph)`	Returns a list of partitioned subgraphs.
`java.util.Set<ILink>`	`partitionLinks()`	This method returns the set of partition links (solo subordination timelinks).

Method Details
- partitionGraph
  
  java.util.ArrayList<IGraph> partitionGraph(IGraph timeMLGraph)
  
  Returns a list of partitioned subgraphs.
  This method takes a TimeML graph, removes all the Subordination type links, then reassembles the graph, and finally returns an array of the partitioned subgraphs.
  
  Parameters:
  
  timeMLGraph - the main TimeML graph to be partitioned.
  
  Returns:
  
  an ArrayList<IGraph> of partitioned subgraphs
- classifyGraphs
  
  java.util.ArrayList<IGraph> 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.
  
  Parameters:
  
  graphs - the list of graphs to be classified.
  
  Returns:
  
  the classified graphs.
- partitionLinks
  
  java.util.Set<ILink> partitionLinks()
  
  This method returns the set of partition links (solo subordination timelinks).
  These links are obtained from partitioning a TimeML graph. This method can only be used AFTER partitionGraph(IGraph) has been used to partition a graph.
  
  Returns:
  
  set of partition links (solo subordination timelinks).