hasEulerianCircuitConditionDirected
P134433
predicate
Indicates that a directed graph satisfies the necessary and sufficient conditions for having an Eulerian circuit (a closed walk using every directed edge exactly once).
All labels observed (1)
| Label | Occurrences |
|---|---|
| hasEulerianCircuitConditionDirected canonical | 1 |
Description generation (PDg)
The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.
Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning. # Instructions Focus on describing the relationship, not the entities themselves. # Response Format Begin the description with \' Indicates...\'
Input
Predicate: hasEulerianCircuitConditionDirected
Generated description
Indicates that a directed graph satisfies the necessary and sufficient conditions for having an Eulerian circuit (a closed walk using every directed edge exactly once).
Sample triples (1)
| Subject | Object |
|---|---|
| Eulerian trail | in-degree equals out-degree for every vertex and all vertices with nonzero degree lie in a single strongly connected component of the underlying graph ⓘ |