Directed graph (di-graph)

• each edge has an associated direction

• each edge has an associated value (weight)

• allow multiple edges between two vertices
• e.g. function call graph   (f() calls g() in several places)