|
CppADCodeGen
HEAD
A C++ Algorithmic Differentiation Package with Source Code Generation
|


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 |
Bidirectional graph used to navigate through the operations graph.
Definition at line 35 of file bidir_graph.hpp.
|
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().