We construct priors on exchangeable directed graphs using digraphons, including special cases such as tournaments, linear orderings, directed acyclic graphs, and partial orderings.