is_sorted_and_acyclic Interface

interface


Calls

interface~~is_sorted_and_acyclic~~CallsGraph interface~is_sorted_and_acyclic dag_m::dag_t%is_sorted_and_acyclic proc~is_sorted_and_acyclic dag_s::is_sorted_and_acyclic interface~is_sorted_and_acyclic->proc~is_sorted_and_acyclic assert assert proc~is_sorted_and_acyclic->assert edges edges proc~is_sorted_and_acyclic->edges intrinsic_array_t intrinsic_array_t proc~is_sorted_and_acyclic->intrinsic_array_t order order proc~is_sorted_and_acyclic->order

Called by

interface~~is_sorted_and_acyclic~~CalledByGraph interface~is_sorted_and_acyclic dag_m::dag_t%is_sorted_and_acyclic proc~construct_from_components dag_s::construct_from_components proc~construct_from_components->interface~is_sorted_and_acyclic

private elemental module function is_sorted_and_acyclic(self)

Arguments

Type IntentOptional Attributes Name
class(dag_t), intent(in) :: self

Return Value logical

Description

Result is true if dag%order contains a topological sorting of vertex identifiers