 for which the directed graph realization problem has a solution, is called a directed graphic or directed graphical sequence.This problem can either be solved by the Kleitman–Wang algorithm or by the Fulkerson–Chen–Anstee theorem.A directed graph is "weakly connected" (or just "connected") if the undirected "underlying graph" obtained by replacing all directed edges of the graph with undirected edges is a connected graph.