dag_module.f90 File Reference

Go to the source code of this file.

Data Types
type	dag_module::vertex
type	dag_module::dag

Modules
module	dag_module

Functions/Subroutines
subroutine	dag_module::dag_destroy (me)
subroutine	dag_module::set_edge_vector (me, edges)
subroutine	dag_module::add_edge (me, edge)
pure integer function, dimension(:), allocatable	dag_module::dag_get_edges (me, ivertex)
pure integer function, dimension(:), allocatable	dag_module::dag_get_dependencies (me, ivertex)
subroutine	dag_module::dag_set_vertices (me, nvertices)
subroutine	dag_module::dag_set_vertex_info (me, ivertex, label, attributes)
subroutine	dag_module::dag_set_edges (me, ivertex, edges)
subroutine	dag_module::dag_toposort (me, order, istat)
recursive subroutine	dfs (v)
character(len=:) function, allocatable	dag_module::dag_generate_digraph (me, rankdir, dpi, edge)
subroutine	dag_module::dag_generate_dependency_matrix (me, mat)
subroutine	dag_module::dag_save_digraph (me, filename, rankdir, dpi, edge)
pure character(len=:) function, allocatable	dag_module::integer_to_string (i)

Function/Subroutine Documentation

dfs()

recursive subroutine dag_toposort::dfs ( type(vertex), intent(inout)  v )

private

Definition at line 252 of file dag_module.f90.

 
    !! depth-first graph traversal
 
    type(vertex),intent(inout) :: v
    integer :: j
 
    if (istat==-1) return
 
    if (v%checking) then
      ! error: circular dependency
      istat = -1
    else
      if (.not. v%marked) then
        v%checking = .true.
        if (allocated(v%edges)) then
          do j=1,size(v%edges)
            call dfs(me%vertices(v%edges(j)))
            if (istat==-1) return
          end do
        end if
        v%checking = .false.
        v%marked = .true.
        iorder = iorder + 1
        order(iorder) = v%ivertex
      end if
    end if
 

Here is the caller graph for this function: