id	summary	reporter	owner	description	type	status	milestone	component	version	severity	resolution	keywords	cc
13151	Graph dominiator tree considers unvisited vertices	scott.gregory.west@…	Jeremiah Willcock	"The graph dominator tree will consider vertices that are not reachable from the given root. The unreachable check is implemented checking ""dfnum < 0 || dfnum >= numOfVertices"", but the dfnum map is initialized to 0. So when nodes are really unvisited they will have a value of 0 and pass the check.

Simple fix could be:
https://github.com/boostorg/graph/pull/97"	Bugs	new	To Be Determined	graph	Boost 1.64.0	Problem