Summary

Directed graphs can be used to encode a set of dependence and independence relations via the d-separation criterion.
Undirected graphs can also encode dependence and independence relations via separation.
Directed graphs can represent non-transitive and induced relations of dependence; undirected graphs cannot.
If an undirected graph is triangulated then there is a directed graph which represents the same relationships