 District of an acyclic directed mixed graph

A district is a maximal set of vertices connected by a path consisting entirely of bidirected edges.