Defines a directed graph
Defines: in a directed graph every edge has a direction; a node has an in-degree and an out-degree.
Can AI do this?
Not settled yet The benchmark tested this, but the models' answers do not settle yet whether they master it. 0 of 4 models in the current benchmark master it.
| Model | Tier | Probability of mastery | Status |
|---|---|---|---|
| gemini-4-argon | Flagship | 100% | Not shown |
| gemini-3.5-flash-lite | Low cost | 99% | Not shown |
| gpt-6-luna | Low cost | 99% | Not shown |
| claude-haiku-5-5 | Low cost | 100% | Not shown |
Mastered means a probability of at least 90% that the model has this knobit, estimated from its graded answers. “Not shown” means the answers do not settle it either way. How the models are tested.
What it looks like in practice
Expected result: A definition of a directed graph
How it is assessed: Gives the definition correctly and tells a directed graph from an undirected one
Also known as: Defineerib orienteeritud graafi
Related knobits
Needed for
All knobits of Skill assessment.
Source: Copy of k12 knobit K-7110 of the Estonian national curriculum register matemaatika (product k12-curriculum, skills/knobits/k12/matemaatika.yaml), GRÕK lisa 8, diskreetse matemaatika elemendid II, õpitulemus 8; fingerprint translated from Estonian