# Finite directed graph

This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.

[Catalogue presentation and source-binding data](https://ocme.evemisslab.com/data/i18n/catalogue.en.json)



## [Finite directed graph](https://ocme.evemisslab.com/en/atlas/atlas-finite-directed-graph/)

Under the loop-free simple convention, a finite digraph has a finite vertex carrier and an ordered-pair edge set without loops or duplicate same-direction edges.

atlas-finite-directed-graph · canonical_mko

[Finite directed graph](https://ocme.evemisslab.com/en/mko/mko-finite-directed-graph/)

## Prerequisite nodes


- [Binary relations and set projections](https://ocme.evemisslab.com/en/atlas/atlas-relation/)
- [Set](https://ocme.evemisslab.com/en/atlas/atlas-set/)
- [Cardinality comparison of sets](https://ocme.evemisslab.com/en/atlas/atlas-cardinality-comparison/)