The main contribution of this paper is to provide a framework in which the notion of farsighted stability for games, introduced by Chwe (1994), can be applied to directed networks. In particular, we introduce the notion of a supernetwork. A supernetwork is made up of a collection of directed networks (the nodes) and uniquely represents (via the arcs connecting the nodes) agent preferences and the rules governing network formation. By reformulating Chwe’s basic result on the nonemptiness of farsightedly stable sets, we show that for any supernetwork (i.e., for any collection of directed networks and any collection of rules governing network formation), there exists a farsightedly stable directed network. We also introduce the notion of a Nash network relative to a given supernetwork, as well as the notions of symmetric, nonsimultaneous, and decomposable supernetworks. To illustrate the utility of our framework, we present several examples of supernetworks, compute the farsightedly stable networks, and the Nash networks.