Directed Graph (no loops) vs. Acyclic Directed Graph (w/loops)
February 20, 2021
• Symmetric directed graphs are directed graphs where all edges are bi-directional. This means, for every arrow that belongs to the digraph, the corresponding inverse arrow also belongs to it. • Simple directed graphs are directed graphs that have no loops, arrows that directly connect vertices to themselves, and no multiple arrows with same source and target nodes. As already introduced, in case of […]