Package de.saar.chorus.domgraph.chart

Class RtgFreeFragmentAnalyzer<E extends GraphBasedNonterminal>

java.lang.Object

de.saar.chorus.domgraph.chart.RtgFreeFragmentAnalyzer<E>

public class RtgFreeFragmentAnalyzer<E extends GraphBasedNonterminal>
extends Object

Constructor Summary

Constructors

Constructor	Description
RtgFreeFragmentAnalyzer(RegularTreeGrammar<E> rtg)

Method Summary

Modifier and Type	Method	Description
void	analyze()
int	getReachability(String u, String v)
List<E>	getSubgraphsWhereFree(String root)
boolean	isCoFree(String u, String v)	Determines whether the roots u and v are co-free.

Methods inherited from class java.lang.Object

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

Constructor Details

RtgFreeFragmentAnalyzer

public RtgFreeFragmentAnalyzer(RegularTreeGrammar<E> rtg)

Method Details

analyze

public void analyze()

getReachability

public int getReachability(String u,
 String v)

getSubgraphsWhereFree

public List<E> getSubgraphsWhereFree(String root)

isCoFree

public boolean isCoFree(String u,
 String v)

Determines whether the roots u and v are co-free. Two roots are called co-free if F(u) \cap F(v) \neq \emptyset.

Parameters:

u -

v -

Returns: