Class cv::dnn::Graph#

Represents graph or subgraph of a model. The graph (in mathematical terms it's rather a multigraph) is represented as a topologically-sorted linear sequence of operations. Each operation is a smart pointer to a Layer (some of its derivative class instance), which includes a list of inputs and outputs, as well as an optional list of subgraphs (e.g. 'If' contains 2 subgraphs).

Collaboration diagram for cv::dnn::Graph:

Detailed Description#

Represents graph or subgraph of a model. The graph (in mathematical terms it’s rather a multigraph) is represented as a topologically-sorted linear sequence of operations. Each operation is a smart pointer to a Layer (some of its derivative class instance), which includes a list of inputs and outputs, as well as an optional list of subgraphs (e.g. ‘If’ contains 2 subgraphs).

Constructor & Destructor Documentation#

~Graph()#

cv::dnn::Graph::~Graph()

Member Function Documentation#

create()#

static Ptr< Graph > cv::dnn::Graph::create(
void * netimpl,
const std::string & name,
const std::vector< Arg > & inputs )

append()#

Arg cv::dnn::Graph::append(
Ptr< Layer > & layer,
const std::string & outname = std::string() )

append()#

const std::vector< Arg > & cv::dnn::Graph::append(
Ptr< Layer > & layer,
const std::vector< std::string > & outnames = std::vector< std::string >() )

clear()#

void cv::dnn::Graph::clear()

dump()#

std::ostream & cv::dnn::Graph::dump(
std::ostream & strm,
int indent,
bool comma )

empty()#

bool cv::dnn::Graph::empty()

inputs()#

const std::vector< Arg > & cv::dnn::Graph::inputs()

name()#

std::string cv::dnn::Graph::name()

outputs()#

const std::vector< Arg > & cv::dnn::Graph::outputs()

prog()#

const std::vector< Ptr< Layer > > & cv::dnn::Graph::prog()

setOutputs()#

void cv::dnn::Graph::setOutputs(const std::vector< Arg > & outputs)

setProg()#

void cv::dnn::Graph::setProg(const std::vector< Ptr< Layer > > & newprog)

Source file#

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