condenseSearchGraph: Collapse neighbouring terminal and potential terminal nodes...

In adamsardar/stoneTrees: Solve Node Centric Steiner Tree Problems

Collapse neighbouring terminal and potential terminal nodes together

Description

Part of the Steiner Tree solving method involves enumerating all vs all node separators of nodes in differing components. This scales very, very badly and for some runs can actually be the major computational bottleneck. It's also unnecessary as neighbouring prize nodes and terminals will always be in the resultant graph.

Usage

condenseSearchGraph(graphToCondense, condensedNodeSep = ";")

Arguments

graphToCondense	igraph network that we wish to contract
condensedNodeSep	(optional) Specify the value to separate node names with

Details

This function groups together potential terminals and adds their relevant node attributes together sensibly. For use with steiner solvers in the stoneTrees package.

Value

A graph with neighbouring terminal and potential terminal nodes collapsed to the same node

See Also

uncondenseGraph

adamsardar/stoneTrees documentation built on May 20, 2022, 7:38 p.m.