We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Graph()(value, ...) -> value... creates a copy of Graph and connects the new values and initializers to the value's graph.
Graph()(value, ...) -> value...
I think option (1) is more intuitive.
The text was updated successfully, but these errors were encountered:
I understand it as Graph()(graph1, graph2, ...) -> composed_graph..., is it right?
Graph()(graph1, graph2, ...) -> composed_graph...
connects the new values
is it about node inputs\outputs or graph inputs\outputs?
What if two initializers share name but not value? Will it sort the result graph? What it will do if cycle appeared?
Sorry, something went wrong.
It's more like
input = ir.Value() output1 = some_graph(input) output2 = some_other_graph(output1) new_graph = ir.Graph([input], [output2])
Aha, and usual name conflict resolution is used? ok.
No branches or pull requests
Make graph callable
Graph()(value, ...) -> value...
creates a copy of Graph and connects the new values and initializers to the value's graph.Or: Create a composition tool
I think option (1) is more intuitive.
The text was updated successfully, but these errors were encountered: