Graph node data structure. More...
#include <memory>#include <string>#include <vector>#include <utility>#include <unordered_map>#include "base.h"#include "op.h"#include "c_api.h"
Include dependency graph for node.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Classes | |
| struct | nnvm::NodeEntry |
| an entry that represents output data from a node More... | |
| struct | nnvm::NodeEntryHash |
| This lets you use a NodeEntry as a key in a unordered_map of the form unordered_map<NodeEntry, ValueType, NodeEntryHash, NodeEntryEqual> More... | |
| struct | nnvm::NodeEntryEqual |
| This lets you use a NodeEntry as a key in a unordered_map of the form unordered_map<NodeEntry, ValueType, NodeEntryHash, NodeEntryEqual> More... | |
| struct | nnvm::NodeAttrs |
| The attributes of the current operation node. Usually are additional parameters like axis,. More... | |
| class | nnvm::Node |
| Node represents an operation in a computation graph. More... | |
Namespaces | |
| nnvm | |
Typedefs | |
| using | nnvm::ObjectPtr = std::shared_ptr< Node > |
| we always used ObjectPtr for a reference pointer to the node, so this alias can be changed in case. More... | |
| template<typename ValueType > | |
| using | nnvm::NodeEntryMap = std::unordered_map< NodeEntry, ValueType, NodeEntryHash, NodeEntryEqual > |
Functions | |
| NodeEntry | nnvm::MakeNode (const char *op_name, std::string node_name, std::vector< NodeEntry > inputs, std::unordered_map< std::string, std::string > attrs=std::unordered_map< std::string, std::string >()) |
| Quick utilities make node. More... | |
Detailed Description
Graph node data structure.
