Uses of Class
ca.uqac.lif.ecp.graphs.LabelledGraph

Packages that use LabelledGraph

Package	Description
ca.uqac.lif.ecp
ca.uqac.lif.ecp.atomic
ca.uqac.lif.ecp.graphs

Uses of LabelledGraph in ca.uqac.lif.ecp

Subclasses of LabelledGraph in ca.uqac.lif.ecp

Modifier and Type	Class and Description
class	CayleyGraph<T extends Event,U> Implementation of a Cayley Graph.

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

Subclasses of LabelledGraph 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.

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

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

Modifier and Type	Field and Description
protected LabelledGraph<T>	TreeCollector.m_graph The Cayley graph from which to collect the results
protected LabelledGraph<T>	ShortestPaths.m_graph

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

Modifier and Type	Method and Description
protected void	TreeCollector.depthFirstCollect(LabelledGraph<T> graph, Vertex<T> v, TestSuite<T> traces) Collects all the root-to-leaf paths in a spanning tree
protected void	TreeCollector.depthFirstCollect(LabelledGraph<T> graph, Vertex<T> v, TestSuite<T> traces, Trace<T> current_trace, int depth) Collects all the root-to-leaf paths in a spanning tree
void	BreadthFirstVisitor.start(LabelledGraph<T> g)
void	BreadthFirstVisitor.start(LabelledGraph<T> g, int start_id, int max_depth)

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

Constructor and Description
DijkstraShortestPaths(LabelledGraph<T> graph)
LabelledGraph(LabelledGraph<T> graph) Creates a copy of a graph graph
ShortestPaths(LabelledGraph<T> graph)
TreeCollector(LabelledGraph<T> graph)