BondOrderProblem Struct Reference

#include <bondordersolver_p.h>

Classes
struct	Edge

Public Attributes
std::vector< unsigned char >	demand
	One entry per vertex.
std::vector< Edge >	edges

Detailed Description

The degree-constrained subgraph problem behind bond order perception and kekulization: give every candidate edge e an extra bond order x_e in [0, capacity_e] so that, at every vertex v, the x_e of its edges sum to exactly demand_v.

Vertices are caller-defined indices (atom indices); a vertex with no demand and no edges is simply ignored.

---

The documentation for this struct was generated from the following file:

• bondordersolver_p.h