CppADCodeGen 2.4.3
A C++ Algorithmic Differentiation Package with Source Code Generation
|
#include <bidir_graph.hpp>
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.
using CppAD::cg::BidirGraph< Base >::Node = OperationNode<Base> |
Definition at line 37 of file bidir_graph.hpp.
using CppAD::cg::BidirGraph< Base >::SourceCodePath = typename CodeHandler<Base>::SourceCodePath |
Definition at line 38 of file bidir_graph.hpp.
|
inlinevirtual |
Definition at line 42 of file bidir_graph.hpp.
|
inline |
Definition at line 48 of file bidir_graph.hpp.
|
inline |
Definition at line 53 of file bidir_graph.hpp.
|
inline |
Definition at line 66 of file bidir_graph.hpp.
|
inline |
Definition at line 44 of file bidir_graph.hpp.
|
inline |
Definition at line 87 of file bidir_graph.hpp.
|
inline |
Definition at line 71 of file bidir_graph.hpp.
|
inline |
Definition at line 79 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< Base >::solveFor().
|
inline |
Definition at line 91 of file bidir_graph.hpp.