Boost adjacency lists are awful. If your data happens to be a primitive type like an integer, you'll end up with a range of integers as vertices, even if you only inserted a handful. The interface ...

In this paper, we describe three graph theoretic heuristics that attempt to determine an optimal planar adjacency graph from a REL chart. Our computational experience suggests that these methods can ...