Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
aidge_core
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Iterations
Wiki
Requirements
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Code review analytics
Issue analytics
Insights
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Eclipse Projects
aidge
aidge_core
Commits
f9890e6a
Commit
f9890e6a
authored
4 months ago
by
Octave Perrin
Browse files
Options
Downloads
Patches
Plain Diff
Continuation adds
parent
9ea12add
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
include/aidge/graph/GraphView.hpp
+14
-12
14 additions, 12 deletions
include/aidge/graph/GraphView.hpp
with
14 additions
and
12 deletions
include/aidge/graph/GraphView.hpp
+
14
−
12
View file @
f9890e6a
...
...
@@ -129,7 +129,7 @@ public:
* @brief Save the GraphView as a Mermaid graph in a .md file at the
* specified location.
* @param path: Path where the file should be put
* @param verbose
@todo i have no idea what it's doing
* @param verbose
If true give more informations in the console during the saving process
* @param showProducers if true, shows additional informations
*/
void
save
(
const
std
::
string
&
path
,
bool
verbose
=
false
,
bool
showProducers
=
true
)
const
;
...
...
@@ -239,7 +239,7 @@ public:
*/
inline
auto
dataInputs
(
const
std
::
string
name
)
const
{
return
mNodeRegistry
.
at
(
name
)
->
dataInputs
();
}
/**
@todo the nullptr behavior is strange: how is a node defined as an "input node" of the graph?
/**
* @brief List outside input connections of the GraphView. The vector
* size is guaranteed to match the number of outside inputs of the GraphView. If there is
* no external connection to a given input, a pair of nullptr and gk_IODefaultIndex is returned.
...
...
@@ -247,7 +247,7 @@ public:
*/
std
::
vector
<
std
::
pair
<
NodePtr
,
IOIndex_t
>>
inputs
()
const
;
/**
@todo having two inputs function, one without args that treat graph's inpput and one with args treating a node's input is fishy
/**
* @TODO @warning what if the node isn't found? where is the try catch of the .at?
* @brief List all input connections (within and outside) of the specified GraphView node named "name".
* @return std::vector<std::pair<NodePtr, IOIndex_t>>
...
...
@@ -281,8 +281,8 @@ public:
* compatible with the selected kernel.
* If not, add a Transpose Operator.
* 4 - Propagate Tensor dimensions through the consecutive Operators.
@params string: backend
@todo: explain params
@params Aidge Datatype: datatype
@params string: backend
Backend used, default is cpu
@params Aidge Datatype: datatype
used, default is float32
@params vector of vector of DimSize_t: dims
*/
void
compile
(
const
std
::
string
&
backend
=
"cpu"
,
...
...
@@ -404,8 +404,8 @@ public:
void
setInputId
(
IOIndex_t
inID
,
IOIndex_t
newNodeOutID
);
/**
//@tod
o he
re i am
*
@brief Include a Node to the current GraphView object.
* @brief Include a Node t
o
t
he
current GraphView's set of Nodes.
*
If the Node is named, it is added in the registery as well
* @details If the GraphView has no root Node (most likely this GraphView is empty)
* the added Node becomes the GraphView's root Node
* @param otherNode Node to add.
...
...
@@ -416,8 +416,9 @@ public:
/**
* @brief Include a set of Nodes to the current GraphView object.
* @param otherNodes
* @param includeLearnableParam
* @param otherNodes Nodes to add to the GraphView
* @param includeLearnableParam Include non-data inputs, like weights and biases
* in the GraphView automatically. Default: true.
* @return true if graph ordering is unique (meaning inputs/outputs order is well defined).
*/
bool
add
(
std
::
set
<
NodePtr
>
otherNodes
,
...
...
@@ -425,7 +426,7 @@ public:
/**
* @brief Include a set of Nodes to the current GraphView object.
* The first element of the otherNodes pair is the
start node
and
* The first element of the otherNodes pair is the
new RootNode of the GraphView
and
* the second is the remaining nodes to add.
* @param otherNodes
* @param includeLearnableParam
...
...
@@ -435,8 +436,8 @@ public:
bool
includeLearnableParam
=
true
);
/**
* @brief Include every Node inside another GraphView to the current
* GraphView
.
* @brief Include every Node inside another GraphView to the current
GraphView.
*
@details If the current GraphView has no RootNode it takes the RootNode of the new
GraphView
* @param other_graph GraphView containing the Nodes to include.
* @return true if graph ordering is unique (meaning inputs/outputs order is well defined).
*/
...
...
@@ -444,6 +445,7 @@ public:
bool
includeLearnableParam
=
true
);
/**
//@todo here i am
* @brief Include a Node in the current GraphView and link it to another
* already contained Node.
*
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment