ccnpk.opt: ccnpk.opt

In beanumber/compgraph: Library for Composite Graphs

Description

Compute the optimal solution to the CCNP-k problem using brute force

Usage

  ccnpk.opt(ccg, ...)

Arguments

ccg	a ccgraph object
...	Arguments to be passed to compgraph

Details

Tries all possible subsets of edges

Value

An optimal solution, or NULL is the tasks are unsolvable

Author(s)

Ben Baumer

Examples

n = 20
p = 1/2
ccg = ccg.game(n, p)
ccnpk.opt(ccg)

beanumber/compgraph documentation built on May 12, 2019, 9:42 a.m.