gene42_igraph | R Documentation |
A directed graph representing a Steiner arborescence problem (directed Steiner problems) from a genetic context. This corresponds to gene42 from the steinLib dataset.
data(gene42_igraph)
An igraph object with 335 nodes and 456 edges
Unique identifiers for each vertex - note, not an index despite being character numbers
A boolean flag detailing as to whether a vertex is a fixed node or not
A belief score between 0 and 1 indicating how strong the evidence is for an interaction
Note: it is only advised to use this, rather difficult, Steiner tree problem in conjunction with an advanced MILP solver like CPLEX.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.