Utility to make selection of edges to a vertex tunable by a parameter. More...

Inheritance diagram for denoptim.graph.DGraph.EdgeFinder:

Collaboration diagram for denoptim.graph.DGraph.EdgeFinder:

Public Member Functions
	EdgeFinder (int i)

List< Edge >	apply (Vertex v)

Private Attributes
int	mode = 0

Detailed Description

Utility to make selection of edges to a vertex tunable by a parameter.

The parameter given to the constructor defines whether we take the incoming or the outgoing edges of a vertex that is given as the argument of this function.

Definition at line 6349 of file DGraph.java.

Constructor & Destructor Documentation

◆ EdgeFinder()

denoptim.graph.DGraph.EdgeFinder.EdgeFinder ( int i )

Parameters

i	if positive we focus on departing edges, if negative we focus on the incoming edge.

Definition at line 6357 of file DGraph.java.

References denoptim.graph.DGraph.EdgeFinder.mode.

Member Function Documentation

◆ apply()

List< Edge > denoptim.graph.DGraph.EdgeFinder.apply ( Vertex v )

Definition at line 6363 of file DGraph.java.

References denoptim.graph.Vertex.getAttachmentPoints(), denoptim.graph.Vertex.getEdgeToParent(), and denoptim.graph.DGraph.EdgeFinder.mode.

Referenced by denoptim.graph.DGraph.findVertices().

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

◆ mode

int denoptim.graph.DGraph.EdgeFinder.mode = 0

private

Definition at line 6351 of file DGraph.java.

Referenced by denoptim.graph.DGraph.EdgeFinder.apply(), and denoptim.graph.DGraph.EdgeFinder.EdgeFinder().

The documentation for this class was generated from the following file:

/github/workspace/src/main/java/denoptim/graph/DGraph.java

Public Member Functions