* @brief Get a topological node order for an acyclic walk of the graph
* Graph cycles are broken on operator back edges such that resolution on
/**
* @brief Get a topological node order for an acyclic walk of the graph.
* @details Graph cycles are broken on operator back edges such that resolution on
* single level lattice can be done in a single pass as it is
* the case generally for static resolution of Tensor shapes/datatypes.
* When reversed is true, gets a topological order on the reversed graph
...
...
@@ -239,12 +239,12 @@ public:
* @brief List outside data input connections of the GraphView.
* Data inputs exclude inputs expecting parameters (weights or bias).
* The vector size is guaranteed to match the number of outside data inputs of the GraphView. If there is
* no external connection to a given input, a pair of nullptr and gk_IODefaultIndex is returned. @todo check it, for me it seem every unconnected input will add some nullptr to the list
* no external connection to a given input, a pair of nullptr and gk_IODefaultIndex is returned.