Bifalgorithm post · Brisk · Chapter 1
How many ordered pairs does the relation represented by this graph have?
How many ordered pairs does the relation represented by this graph have? (Brisk · Chapter 1) — "dorelation, how many ordered pairs would it have? 14. (If you s…
Ideas in this flowchart
- Determining the number of ordered pairs in the relation
- The relation has 14 ordered pairs.
- The lines have no arrowheads, so the graph is undirected.
- An undirected graph corresponds to a symmetric relation.
- Each connection contributes both ordered pairs in reverse order.
- For example, the connection between A and E gives both (A, E) and (E, A).
- Counting only 7 would omit the reverse ordered pairs.
