Directed Graph Example

The Edge set E of a directed graph or digraph is a binary relation on its Node set N.

Questions:

• What are the Co-Domains?

• Can E be a ternary relation?

• How is the Edge matrix defined?

• When is E a sparse or dense relation?

• Can an Edge relate a Node instance to itself?

• Can an undirected graph be a special case?

• What predicate constrains a digraph to be a DAG (directed acyclic graph)?

Previous slide

Next slide

Back to first slide

View graphic version