Uses of Interface
org.sonar.graph.Edge

Uses of Edge in org.sonar.graph

Classes in org.sonar.graph with type parameters of type Edge

class	DirectedGraph<V,E extends Edge<V>>
interface	DirectedGraphAccessor<V,E extends Edge<V>>

Classes in org.sonar.graph that implement Edge

class

StringEdge

Methods in org.sonar.graph that return Edge

Edge	DsmCell.getEdge()
protected Edge	FeedbackEdge.getEdge()
Edge[]	Cycle.getEdges()

Methods in org.sonar.graph that return types with arguments of type Edge

Set<Edge>	MinimumFeedbackEdgeSetSolver.getEdges() Get edges tagged as feedback.
Set<Edge>	IncrementalCyclesAndFESSolver.getFeedbackEdgeSet()

Methods in org.sonar.graph with parameters of type Edge

boolean

Cycle.contains(Edge e)

Constructors in org.sonar.graph with parameters of type Edge

DsmCell(Edge edge, boolean isFeedbackEdge)

FeedbackEdge(Edge edge, int occurences)

Constructor parameters in org.sonar.graph with type arguments of type Edge

Cycle(List<Edge> edges)

CycleDetector(DirectedGraphAccessor<V,? extends Edge> graph)

CycleDetector(DirectedGraphAccessor<V,? extends Edge> graph, Collection<V> vertices)

CycleDetector(DirectedGraphAccessor<V,? extends Edge> graph, Collection<V> vertices, Set<Edge> edgesToExclude)

CycleDetector(DirectedGraphAccessor<V,? extends Edge> graph, Collection<V> vertices, Set<Edge> edgesToExclude)

CycleDetector(DirectedGraphAccessor<V,? extends Edge> graph, Set<Edge> edgesToExclude)

CycleDetector(DirectedGraphAccessor<V,? extends Edge> graph, Set<Edge> edgesToExclude)

Dsm(DirectedGraphAccessor<V,? extends Edge<V>> acyclicGraph)

Dsm(DirectedGraphAccessor<V,? extends Edge<V>> graph, Collection<V> vertices, Set<Edge> feedbackEdges)

Dsm(DirectedGraphAccessor<V,? extends Edge<V>> graph, Collection<V> vertices, Set<Edge> feedbackEdges)

Dsm(DirectedGraphAccessor<V,? extends Edge<V>> acyclicGraph, Set<Edge> feedbackEdges)

Dsm(DirectedGraphAccessor<V,? extends Edge<V>> acyclicGraph, Set<Edge> feedbackEdges)

IncrementalCyclesAndFESSolver(DirectedGraphAccessor<V,? extends Edge> graph, Collection<V> vertices)

IncrementalCyclesAndFESSolver(DirectedGraphAccessor<V,? extends Edge> graph, Collection<V> vertices, int maxSearchDepthAtFirst, int maxCyclesToFoundByIteration)