CppADCodeGen  HEAD
A C++ Algorithmic Differentiation Package with Source Code Generation
CppAD::cg::BidirGraph< Base > Class Template Reference
Inheritance diagram for CppAD::cg::BidirGraph< Base >:
Inheritance graph
Collaboration diagram for CppAD::cg::BidirGraph< Base >:
Collaboration graph

Public Types

using Node = OperationNode< Base >
 
using SourceCodePath = typename CodeHandler< Base >::SourceCodePath
 

Public Member Functions

bool empty () const
 
void connect (Node &node, size_t argument)
 
void connect (PathNodeEdges< Base > &nodeInfo, Node &node, size_t argument)
 
bool contains (Node &node) const
 
PathNodeEdges< Base > * find (Node &node)
 
const PathNodeEdges< Base > * find (Node &node) const
 
bool erase (Node &node)
 
PathNodeEdges< Base > & operator[] (Node &node)
 
std::vector< SourceCodePath > findSingleBifurcation (Node &expression, Node &target, size_t &bifIndex) const
 

Detailed Description

template<class Base>
class CppAD::cg::BidirGraph< Base >

Bidirectional graph used to navigate through the operations graph.

Definition at line 35 of file bidir_graph.hpp.

Member Function Documentation

◆ findSingleBifurcation()

template<class Base>
std::vector<SourceCodePath> CppAD::cg::BidirGraph< Base >::findSingleBifurcation ( Node expression,
Node target,
size_t &  bifIndex 
) const
inline

Find a path from node to target without any additional bifurcation along the path.

Add a missing path from the nodes at paths[0][0] to the expression node

Definition at line 99 of file bidir_graph.hpp.

Referenced by CppAD::cg::CodeHandler< ScalarOut >::solveFor().


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