Uses of Class
ca.uqac.lif.ecp.CayleyGraph

Packages that use CayleyGraph

Package	Description
ca.uqac.lif.ecp
ca.uqac.lif.ecp.atomic
ca.uqac.lif.ecp.graphs
ca.uqac.lif.ecp.ltl
ca.uqac.lif.ecp.statechart.atomic	UML statecharts made of atomic events

Uses of CayleyGraph in ca.uqac.lif.ecp

Fields in ca.uqac.lif.ecp declared as CayleyGraph

Modifier and Type	Field and Description
protected CayleyGraph<T,U>	CayleyGraphTraceGenerator.m_graph The Cayley graph used to generate the traces
protected CayleyGraph<T,U>	CayleyCoverageMetric.m_graph The Cayley Graph from which the coverage will be computed
protected CayleyGraph<T,U>	GraphPlotter.m_graph The Cayley graph to plot
protected CayleyGraph<T,U>	SpanningTreeTraceGenerator.m_tree The spanning tree obtained from this Cayley graph

Methods in ca.uqac.lif.ecp that return CayleyGraph

Modifier and Type	Method and Description
abstract CayleyGraph<T,U>	TriagingFunction.getCayleyGraph() Gets the Cayley Graph corresponding to this triaging function
CayleyGraph<T,U>	PrefixCategoryClosure.getClosureGraph(CayleyGraph<T,U> graph) Gets the prefix closure graph of the Cayley graph
CayleyGraph<T,U>	CayleyGraphFactory.getGraph(TriagingFunction<T,U> f)
CayleyGraph<T,U>	CayleyGraphFactory.getGraph(TriagingFunction<T,U> f, CayleyGraph.LabelFormatter<U> formatter)
CayleyGraph<T,U>	SpanningTreeTraceGenerator.getSpanningTree() Creates the minimum spanning tree of the Cayley graph

Methods in ca.uqac.lif.ecp with parameters of type CayleyGraph

Modifier and Type	Method and Description
protected boolean	CayleyGraph.checkMapping(int current_node_id, CayleyGraph<T,U> other_graph, int other_node_id, java.util.Map<java.lang.Integer,java.lang.Integer> mapping)
CayleyGraph<T,U>	PrefixCategoryClosure.getClosureGraph(CayleyGraph<T,U> graph) Gets the prefix closure graph of the Cayley graph
boolean	CayleyGraph.isIsomorphicTo(CayleyGraph<T,U> other_graph) Determines if some graph is isomorphic to the current graph.
boolean	CayleyGraph.isIsomorphicToThrowable(CayleyGraph<T,U> other_graph) Same as isIsomorphicTo(CayleyGraph) but throws an exception explaining why the graphs are not isomorphic when they are not.
void	CayleyGraphTraceGenerator.setGraph(CayleyGraph<T,U> graph) Sets the graph used by this generator

Constructors in ca.uqac.lif.ecp with parameters of type CayleyGraph

Constructor and Description
CayleyCardinalityCoverage(CayleyGraph<T,U> graph, TriagingFunction<T,U> function)
CayleyCategoryCoverage(CayleyGraph<T,U> graph, TriagingFunction<T,U> function)
CayleyCoverageMetric(CayleyGraph<T,U> graph, TriagingFunction<T,U> function)
CayleyCoverageRadius(CayleyGraph<T,U> graph, TriagingFunction<T,U> function)
CayleyDiameterCoverage(CayleyGraph<T,U> graph, TriagingFunction<T,U> function)
CayleyGraph(CayleyGraph<T,U> graph) Creates a copy of a Cayley graph
CayleyGraphTraceGenerator(CayleyGraph<T,U> graph)
GraphPlotter(CayleyGraph<T,U> graph) Creates a new plotter for a given graph
HypergraphTraceGenerator(CayleyGraph<T,U> graph) Creates a new trace generator
SpanningTreeTraceGenerator(CayleyGraph<T,U> graph) Creates a new spanning tree generator
SpanningTreeTraceGenerator(CayleyGraph<T,U> graph, SpanningTree<T,U> solver) Creates a new spanning tree generator

Uses of CayleyGraph in ca.uqac.lif.ecp.atomic

Subclasses of CayleyGraph in ca.uqac.lif.ecp.atomic

Modifier and Type	Class and Description
class	AtomicCayleyGraph<U> Special case of Cayley graph where the triaging function operates over atomic events
class	Automaton Implementation of a deterministic finite-state automaton.

Methods in ca.uqac.lif.ecp.atomic that return CayleyGraph

Modifier and Type	Method and Description
CayleyGraph<AtomicEvent,MathList<T>>	ShallowHistoryFunction.getCayleyGraph()

Constructors in ca.uqac.lif.ecp.atomic with parameters of type CayleyGraph

Constructor and Description
AtomicGraphPlotter(CayleyGraph<AtomicEvent,U> graph)

Uses of CayleyGraph in ca.uqac.lif.ecp.graphs

Fields in ca.uqac.lif.ecp.graphs declared as CayleyGraph

Modifier and Type	Field and Description
protected CayleyGraph<T,U>	CayleyGraphSolver.m_graph The graph this solver will work on

Methods in ca.uqac.lif.ecp.graphs that return CayleyGraph

Modifier and Type	Method and Description
abstract CayleyGraph<T,U>	SpanningTree.getSpanningTree() Gets the spanning tree from the solver's graph
CayleyGraph<T,U>	UnionFindSpanningTree.getSpanningTree()
CayleyGraph<T,U>	BreadthFirstSteinerTree.getSubgraph(java.util.Set<java.util.List<Edge<T>>> paths) Creates a subgraph from graph, made by including only vertices and edges contained in a given set of paths
abstract CayleyGraph<T,U>	SteinerTree.getTree() Gets a Steiner tree from the Cayley graph and set of important vertices
CayleyGraph<T,U>	BreadthFirstSteinerTree.getTree()
CayleyGraph<T,U>	DijkstraSteinerTree.getTree()

Methods in ca.uqac.lif.ecp.graphs with parameters of type CayleyGraph

Modifier and Type	Method and Description
java.util.List<Edge<T>>	ForestNode.getOrderedSpanningTree(CayleyGraph<T,?> graph) Compute an ordered spanning tree of a weighted graph.
abstract SpanningTree<T,U>	SpanningTree.newSolver(CayleyGraph<T,U> g) Gets a new, empty instance of this solver
SpanningTree<T,U>	UnionFindSpanningTree.newSolver(CayleyGraph<T,U> g)
abstract SteinerTree<T,U>	SteinerTree.newSolver(CayleyGraph<T,U> graph, MathSet<java.lang.Integer> vertices) Gets a new instance of this solver
BreadthFirstSteinerTree<T,U>	BreadthFirstSteinerTree.newSolver(CayleyGraph<T,U> graph, MathSet<java.lang.Integer> vertices)
DijkstraSteinerTree<T,U>	DijkstraSteinerTree.newSolver(CayleyGraph<T,U> graph, MathSet<java.lang.Integer> vertices)
void	CayleyGraphSolver.setGraph(CayleyGraph<T,U> graph) Sets the graph this solver will work on

Constructors in ca.uqac.lif.ecp.graphs with parameters of type CayleyGraph

Constructor and Description
BreadthFirstSteinerTree(CayleyGraph<T,U> graph, MathSet<java.lang.Integer> vertices)
CayleyGraphSolver(CayleyGraph<T,U> graph) Instantiates a new solver
DijkstraSteinerTree(CayleyGraph<T,U> graph, MathSet<java.lang.Integer> vertices)
SpanningTree(CayleyGraph<T,U> graph) Instantiates a new solver
SteinerTree(CayleyGraph<T,U> graph, MathSet<java.lang.Integer> vertices) Creates a new solver
UnionFindSpanningTree(CayleyGraph<T,U> graph)

Uses of CayleyGraph in ca.uqac.lif.ecp.ltl

Fields in ca.uqac.lif.ecp.ltl declared as CayleyGraph

Modifier and Type	Field and Description
protected CayleyGraph<T,Operator<T>>	LtlCayleyGraphRenderer.m_graph The graph to render

Methods in ca.uqac.lif.ecp.ltl that return CayleyGraph

Modifier and Type	Method and Description
CayleyGraph<T,Operator<T>>	HologramFunction.getCayleyGraph()
CayleyGraph<AtomicEvent,Operator<AtomicEvent>>	AtomicLtlCayleyGraphFactory.getGraph(HologramFunction<AtomicEvent> f)
CayleyGraph<AtomicEvent,Operator<AtomicEvent>>	AtomicLtlCayleyGraphFactory.getGraph(TriagingFunction<AtomicEvent,Operator<AtomicEvent>> f)

Constructors in ca.uqac.lif.ecp.ltl with parameters of type CayleyGraph

Constructor and Description
LtlCayleyGraphRenderer(CayleyGraph<T,Operator<T>> graph)

Uses of CayleyGraph in ca.uqac.lif.ecp.statechart.atomic

Methods in ca.uqac.lif.ecp.statechart.atomic that return CayleyGraph

Modifier and Type	Method and Description
CayleyGraph<AtomicEvent,MathList<Configuration<AtomicEvent>>>	AtomicStateShallowHistory.getCayleyGraph()