vertex_m Module

Jacob Williams, Damian Rouson, Robert Singleterry, Brad Richardson
2020-Nov-30
Copyright (c) 2020-2021, Sourcery Institute, BSD 3-clause license Copyright (c) 2018 Jacob Williams
v1.0
21 statements
Source File

Uses

- task_m
Help
Graph Key

Nodes of different colours represent the following:

Solid arrows point from a submodule to the (sub)module which it is descended from. Dashed arrows point from a module or program unit to modules which it uses. Where possible, edges connecting nodes are given different colours to make them easier to distinguish in large graphs.

Used by

Help
Graph Key

Nodes of different colours represent the following:

Solid arrows point from a submodule to the (sub)module which it is descended from. Dashed arrows point from a module or program unit to modules which it uses. Where possible, edges connecting nodes are given different colours to make them easier to distinguish in large graphs.

Contents

Interfaces

vertex_t

Derived Types

vertex_t

Functions

construct

Interfaces

public interface vertex_t

private function construct(edges, task) result(vertex)

Arguments

Type Intent Optional Attributes Name

integer, intent(in) :: edges(:)

class(task_t), intent(in) :: task

Return Value type(vertex_t)

Derived Types

type, public :: vertex_t

Encapsulate a node in a graph comprised of vertices connected by dependencies (edges)

Components

Type	Visibility	Attributes		Name		Initial
integer,	private,	allocatable	::	edges(:)
class(task_t),	private,	allocatable	::	task

Constructor

private function construct(edges, task)

Functions

private function construct(edges, task) result(vertex)

Arguments

Type	Intent	Optional	Attributes		Name
integer,	intent(in)			::	edges(:)
class(task_t),	intent(in)			::	task

Return Value type(vertex_t)