Uses of Class
org.quilt.graph.Directed

Packages that use Directed

org.quilt.cl
org.quilt.graph

Uses of Directed in org.quilt.cl

Subclasses of Directed in org.quilt.cl

class

ControlFlowGraph Directed graph extended for use in analyzing method instruction lists.

Methods in org.quilt.cl that return Directed

Directed

ControlFlowGraph.subgraph(Edge e, int n) Create a control flow graph, connecting it to this graph as its parent by inserting it along the directed edge e (the Entry first, followed by the subgraph Exit.

Methods in org.quilt.cl with parameters of type Directed

void	GraphTalker.discoverGraph(Directed graph)
void	GraphTalker.finishGraph(Directed graph)
void	BytecodeCollector.discoverGraph(Directed g) Action taken upon beginning to visit the graph.
void	BytecodeCollector.finishGraph(Directed g) Finish the graph.

Uses of Directed in org.quilt.graph

Fields in org.quilt.graph declared as Directed

protected Directed

Vertex.graph The graph this vertex belongs to.

Methods in org.quilt.graph that return Directed

Directed	Edge.getGraph()
Directed	Directed.getParent()
protected static Directed	Directed.connectSubgraph(Directed subgraph, Edge e, int n) Inserts a subgraph into an edge, putting the entry and exit points on the edge presented.
Directed	Directed.subgraph(Edge e, int n) Constructs a subgraph and inserts it into the parent graph on the edge presented.
Directed	Vertex.getGraph() Get the graph this vertex is in.

Methods in org.quilt.graph with parameters of type Directed

Exit	Walker.visit(Directed g, Visitor guest) Walk through the entire graph.
void	Visitor.discoverGraph(Directed graph) Called at beginning of visiting a graph or subgraph.
void	Visitor.finishGraph(Directed graph) Called at end of visiting a graph or subgraph.
protected static Directed	Directed.connectSubgraph(Directed subgraph, Edge e, int n) Inserts a subgraph into an edge, putting the entry and exit points on the edge presented.
Entry	Directed.closestEntry(Directed g) If the edge points towards a vertex in a graph which is enclosed within the current graph, return a reference to the closest Entry.
boolean	Vertex.above(Directed g) Is the graph a parent, grandparent of this vertex?

Constructors in org.quilt.graph with parameters of type Directed

Exit(Directed g)
Constructor for the exit vertex for a Quilt directed graph.

Directed(Directed parent)
Subgraph constructor; will have depth one more than parent.

Vertex(Directed g)
Creates a vertex belonging to a graph, assigns an index unique within this graph.

Entry(Directed g)