Function ADS::boundedSpanningTree

• Defined in File Problems.h

Function Documentation

inline std::optional<std::vector<std::pair<int, int>>> ADS::boundedSpanningTree(const Adjacency &G, int k)

a spanning tree of the unoriented graph with at most k edges at each node, as n - 1 edges, by enumeration, or nothing

Pre:

G is unoriented, i.e., square and symmetric

Post:

the edges returned form a spanning tree with at most k at each node