DAG Node wrapper for graph algorithms (DFS and topological sort). More...

#include <Phalanx_DAG_Node.hpp>

Public Member Functions
	DagNode (const int index, const Teuchos::RCP< PHX::Evaluator< Traits >> &e)

	DagNode (const DagNode< Traits > &)=default

	DagNode (DagNode< Traits > &&)=default

DagNode< Traits > &	operator= (const DagNode< Traits > &)=default

int	index () const

Teuchos::RCP< const PHX::Evaluator< Traits > >	get () const

Teuchos::RCP< PHX::Evaluator < Traits > >	getNonConst () const

void	setColor (const PHX::Color &c)

PHX::Color	color () const

int	discoveryTime () const

void	setDiscoveryTime (int dt)

int	finalTime () const

void	setFinalTime (int ft)

void	resetDfsParams (const PHX::Color c=PHX::Color::WHITE)

void	addAdjacency (const int &node_index)

const std::unordered_set< int > &	adjacencies () const

void	setExecutionTime (const std::chrono::duration< double > &exec_time)

void	sumIntoExecutionTime (const std::chrono::duration< double > &exec_time)

const std::chrono::duration < double > &	executionTime () const

void	setStartTime (const std::chrono::duration< double > &t)

const std::chrono::duration < double > &	startTime () const

void	setFinishTime (const std::chrono::duration< double > &t)

const std::chrono::duration < double > &	finishTime () const

Detailed Description

DAG Node wrapper for graph algorithms (DFS and topological sort).

The documentation for this class was generated from the following file:

Public Member Functions