Class: DirectedAcyclicGraph

a directed acyclic graph or DAG is a network digram that contains directed edges in which nodes may have multiple parents, but there are no cycles.

URI: sio:DirectedAcyclicGraph

img

Parents

  • is_a: NetworkDiagram - A network diagram consists of a set of vertices connected by edges.

Children

  • TreeDiagram - A tree diagram is a hierarchical network diagram in which a root vertex is connected to one or more other vertices through a directed edge, which in turn may be connected to other vertices.

Referenced by Class

Attributes

Inherited from NetworkDiagram:

  • hasCreator 0..1
    • Description: has creator is a relation between an entity and that which created it.
    • Range: Entity

  • hasAttribute 0..1

    • Description: has attribute is a relation that associates a entity with an attribute where an attribute is an intrinsic characteristic such as a quality, capability, disposition, function, or is an externally derived attribute determined from some descriptor (e.g. a quantity, position, label/identifier) either directly or indirectly through generalization of entities of the same type.

    • Range: Entity

    • satisfies 0..1

    • Description: satisfies is a relation between an entity and the specification or objective that it conforms to.

    • Range: Description

    • isRelatedTo 0..1
    • Description: A is related to B iff there is some relation between A and B.
    • Range: Entity
    • derivesInto 0..1

    • Description: a derives to b if and only if a or some part thereof is consumed in the formation of b.

    • Range: Object