Priority-Consistent Graphs

We introduce the notion of minimum size graphs in which stated priorities are reflected by shortest-path distances. We present initial results giving some general properties of such graphs and an efficient algorithm to determine whether a graph consistent with given priorities is a tree.