In other words, given any directed graph, can we add a single additional node to the graph, and some additional edges to the graph, such that there is an edge between the new node r and any node n in N if and only if there is no edge from n to itself?