From a computational theory perspective, a linear Chain is essentially a simple form of finite-state automaton, whereas a directed graph (especially one that allows cycles) has the potential to be Turing complete.