$darkmode
|
DENOPTIM
|
Definition of a graph editing task. More...
Classes | |
| enum | EditTask |
| Defined the kind of graph editing task. More... | |
Public Member Functions | |
| Integer | getIncomingAPId () |
| void | setAP (int apId) |
| void | setIncomingGraph (DGraph incomingGraph) |
| DGraph | getIncomingGraph () |
| void | setIncomingGraphPathname (String incomingGraphPathname) |
| String | getIncomingGraphPathname () |
| GraphEdit (EditTask task) | |
| EditTask | getType () |
| List< AttachmentPointQuery > | getTargetGraphAPQueries () |
| List< AttachmentPointQuery > | getIncomingGraphAPQueries () |
| VertexQuery | getVertexQuery () |
| void | setVertexQuery (VertexQuery vertexQuery) |
| void | setEdgeQuery (EdgeQuery edgeQuery) |
| EdgeQuery | getEdgeQuery () |
| int | getIncomingBBId () |
| BBType | getIncomingBBType () |
| LinkedHashMap< Integer, Integer > | getAPMappig () |
| int | getMaxOutputGraphs () |
| void | setMaxOutputGraphs (int maxOutputGraphs) |
Private Attributes | |
| EditTask | task = null |
| Type of editing task. More... | |
| int | maxOutputGraphs = 10 |
| Defined the max number of output graphs resulting from application of the graph editing task. More... | |
| List< AttachmentPointQuery > | apQueriesOnTargetGraph = null |
List of queries identifying an ordered list of AttachmentPoints that may be used to identify a subgraph in the target graph. More... | |
| List< AttachmentPointQuery > | apQueriesOnIncomingGraph = null |
List of queries identifying an ordered list of AttachmentPoints that may be used to identify a subgraph in the incoming graph. More... | |
| VertexQuery | vertexQuery = null |
| Query identifying the vertex that is the center of our attention when performing the graph editing task. More... | |
| EdgeQuery | edgeQuery = null |
| Query identifying the edge that is the center of our attention when performing the graph editing task. More... | |
| String | incomingGraphPathname = null |
| The pathname to a file where to read the incoming graph from. More... | |
| DGraph | incomingGraph = null |
The incoming graph for tasks that involve appending a subgraph onto another graph (when doing EditTask#REPLACECHILD). More... | |
| Integer | idAPOnIncomingGraph = null |
The identifier of the AttachmentPoint (AP) of the GraphEdit#incomingGraph when attaching such graph to the graph to edit. More... | |
| int | incomingBBId = -1 |
Index of the building block to use as incoming vertex when performing EditTask#CHANGEVERTEX. More... | |
| BBType | incomingBBTyp |
The type of the building block to use as incoming vertex when performing EditTask#CHANGEVERTEX. More... | |
| LinkedHashMap< Integer, Integer > | incomingAPMap |
Mapping of AttachmentPoints between the current (first entry) and the incoming vertices (second entry) to be enforced when performing EditTask#CHANGEVERTEX or EditTask#CHANGESUBGRAPH tasks. More... | |
Definition of a graph editing task.
Definition at line 39 of file GraphEdit.java.
| denoptim.utils.GraphEdit.GraphEdit | ( | EditTask | task | ) |
Definition at line 203 of file GraphEdit.java.
References denoptim.utils.GraphEdit.task.
| LinkedHashMap< Integer, Integer > denoptim.utils.GraphEdit.getAPMappig | ( | ) |
Definition at line 273 of file GraphEdit.java.
References denoptim.utils.GraphEdit.incomingAPMap.
| EdgeQuery denoptim.utils.GraphEdit.getEdgeQuery | ( | ) |
Definition at line 252 of file GraphEdit.java.
References denoptim.utils.GraphEdit.edgeQuery.
| Integer denoptim.utils.GraphEdit.getIncomingAPId | ( | ) |
Definition at line 161 of file GraphEdit.java.
References denoptim.utils.GraphEdit.idAPOnIncomingGraph.
| int denoptim.utils.GraphEdit.getIncomingBBId | ( | ) |
Definition at line 259 of file GraphEdit.java.
References denoptim.utils.GraphEdit.incomingBBId.
| BBType denoptim.utils.GraphEdit.getIncomingBBType | ( | ) |
Definition at line 266 of file GraphEdit.java.
References denoptim.utils.GraphEdit.incomingBBTyp.
| DGraph denoptim.utils.GraphEdit.getIncomingGraph | ( | ) |
Definition at line 182 of file GraphEdit.java.
References denoptim.utils.GraphEdit.incomingGraph.
| List< AttachmentPointQuery > denoptim.utils.GraphEdit.getIncomingGraphAPQueries | ( | ) |
Definition at line 224 of file GraphEdit.java.
References denoptim.utils.GraphEdit.apQueriesOnIncomingGraph.
| String denoptim.utils.GraphEdit.getIncomingGraphPathname | ( | ) |
Definition at line 196 of file GraphEdit.java.
References denoptim.utils.GraphEdit.incomingGraphPathname.
| int denoptim.utils.GraphEdit.getMaxOutputGraphs | ( | ) |
Definition at line 280 of file GraphEdit.java.
References denoptim.utils.GraphEdit.maxOutputGraphs.
| List< AttachmentPointQuery > denoptim.utils.GraphEdit.getTargetGraphAPQueries | ( | ) |
Definition at line 217 of file GraphEdit.java.
References denoptim.utils.GraphEdit.apQueriesOnTargetGraph.
| EditTask denoptim.utils.GraphEdit.getType | ( | ) |
Definition at line 210 of file GraphEdit.java.
References denoptim.utils.GraphEdit.task.
Referenced by denoptim.graph.DGraph.editGraph().
| VertexQuery denoptim.utils.GraphEdit.getVertexQuery | ( | ) |
Definition at line 231 of file GraphEdit.java.
References denoptim.utils.GraphEdit.vertexQuery.
| void denoptim.utils.GraphEdit.setAP | ( | int | apId | ) |
Definition at line 168 of file GraphEdit.java.
| void denoptim.utils.GraphEdit.setEdgeQuery | ( | EdgeQuery | edgeQuery | ) |
Definition at line 245 of file GraphEdit.java.
References denoptim.utils.GraphEdit.edgeQuery.
| void denoptim.utils.GraphEdit.setIncomingGraph | ( | DGraph | incomingGraph | ) |
Definition at line 175 of file GraphEdit.java.
References denoptim.utils.GraphEdit.incomingGraph.
| void denoptim.utils.GraphEdit.setIncomingGraphPathname | ( | String | incomingGraphPathname | ) |
Definition at line 189 of file GraphEdit.java.
References denoptim.utils.GraphEdit.incomingGraphPathname.
| void denoptim.utils.GraphEdit.setMaxOutputGraphs | ( | int | maxOutputGraphs | ) |
Definition at line 287 of file GraphEdit.java.
References denoptim.utils.GraphEdit.maxOutputGraphs.
| void denoptim.utils.GraphEdit.setVertexQuery | ( | VertexQuery | vertexQuery | ) |
Definition at line 238 of file GraphEdit.java.
References denoptim.utils.GraphEdit.vertexQuery.
|
private |
List of queries identifying an ordered list of AttachmentPoints that may be used to identify a subgraph in the incoming graph.
Definition at line 63 of file GraphEdit.java.
Referenced by denoptim.utils.GraphEdit.getIncomingGraphAPQueries().
|
private |
List of queries identifying an ordered list of AttachmentPoints that may be used to identify a subgraph in the target graph.
Definition at line 57 of file GraphEdit.java.
Referenced by denoptim.utils.GraphEdit.getTargetGraphAPQueries().
|
private |
Query identifying the edge that is the center of our attention when performing the graph editing task.
Definition at line 79 of file GraphEdit.java.
Referenced by denoptim.utils.GraphEdit.getEdgeQuery(), and denoptim.utils.GraphEdit.setEdgeQuery().
|
private |
The identifier of the AttachmentPoint (AP) of the GraphEdit#incomingGraph when attaching such graph to the graph to edit.
NB: this is the unique identifier, not any index on a list.
Definition at line 98 of file GraphEdit.java.
Referenced by denoptim.utils.GraphEdit.getIncomingAPId().
|
private |
Mapping of AttachmentPoints between the current (first entry) and the incoming vertices (second entry) to be enforced when performing EditTask#CHANGEVERTEX or EditTask#CHANGESUBGRAPH tasks.
Values are indexes of APs in the respective AP lists.
Definition at line 122 of file GraphEdit.java.
Referenced by denoptim.utils.GraphEdit.getAPMappig().
|
private |
Index of the building block to use as incoming vertex when performing EditTask#CHANGEVERTEX.
The index refers to the position of the building blocks in a FragmentSpace that is expected to be unambiguously identifiable (there should be only one available).
Definition at line 106 of file GraphEdit.java.
Referenced by denoptim.utils.GraphEdit.getIncomingBBId().
|
private |
The type of the building block to use as incoming vertex when performing EditTask#CHANGEVERTEX.
The building blocks in expected to be part of a FragmentSpace that is expected to be unambiguously identifiable (there should be only one available).
Definition at line 114 of file GraphEdit.java.
Referenced by denoptim.utils.GraphEdit.getIncomingBBType().
|
private |
The incoming graph for tasks that involve appending a subgraph onto another graph (when doing EditTask#REPLACECHILD).
Definition at line 90 of file GraphEdit.java.
Referenced by denoptim.utils.GraphEdit.getIncomingGraph(), and denoptim.utils.GraphEdit.setIncomingGraph().
|
private |
The pathname to a file where to read the incoming graph from.
Definition at line 84 of file GraphEdit.java.
Referenced by denoptim.utils.GraphEdit.getIncomingGraphPathname(), and denoptim.utils.GraphEdit.setIncomingGraphPathname().
|
private |
Defined the max number of output graphs resulting from application of the graph editing task.
Serves as limit to prevent hanging on combinatorial explorion.
Definition at line 51 of file GraphEdit.java.
Referenced by denoptim.utils.GraphEdit.getMaxOutputGraphs(), and denoptim.utils.GraphEdit.setMaxOutputGraphs().
|
private |
Type of editing task.
Definition at line 44 of file GraphEdit.java.
Referenced by denoptim.utils.GraphEdit.getType(), and denoptim.utils.GraphEdit.GraphEdit().
|
private |
Query identifying the vertex that is the center of our attention when performing the graph editing task.
Depending on the type of task the vertex it may or may not be altered. For example, if the task is EditTask#DELETEBRANCH, the matched vertex is where the branch to remove starts.
Definition at line 73 of file GraphEdit.java.
Referenced by denoptim.utils.GraphEdit.getVertexQuery(), and denoptim.utils.GraphEdit.setVertexQuery().