Every algorithm in dplbnDE accepts anDocumentation Index
Fetch the complete documentation index at: https://mintlify.com/alexplatasl/dplbnde/llms.txt
Use this file to discover all available pages before exploring further.
edgelist argument that overrides the automatically learned structure. This lets you encode domain knowledge or test specific topologies.
Defining an edge list
An edge list is a matrix or data frame with exactly 2 columns:from and to, each row specifying a directed edge.
Running with a custom structure
Pass the matrix to any algorithm viaedgelist. The structure argument is still used as a base for initialization but is replaced by your edge list:
lshade uses Linear Population Size Reduction (LPSR), the population shrinks each generation. Example output:
Requirements for a valid edge list
- Must be a matrix or data frame with exactly 2 columns
- The class variable name must appear as a node in the edge list
- All node names must match column names in your data frame
- The graph must be a valid DAG (no cycles)