Abstract. For directed graphs the Wiener index is defined as the sum of distances between all ordered pairs of vertices. However, we consider also digraphs which are not strongly connected. Therefore, if there is no directed u-v path, we set the `distance' to be 0. We formulate and study conjectures about orientations of undirected graphs which achieve extremal values of Wiener index.