Function ADS::intervalGraph

• Defined in File EasyCases.h

Function Documentation

inline Adjacency ADS::intervalGraph(const std::vector<std::pair<long, long>> &I)

the graph of the intervals [ a , b ), an edge if two share a point: an empty interval [ a , a ) meets none, as in intervalClique()

Pre:

each interval [ a , b ) has a <= b

Post:

an unoriented graph, one node per interval