node_functions

This is summary documentation for hippynn.graphs.nodes.base.node_functions module. Click here for full documentation.

Links to Full Documentation:

Here we define some of the core operations for Nodes in the directed acyclic graph associated with a computation.

Functions

`find_relatives`(node_or_nodes, constraint_key)
`find_unique_relative`(node_or_nodes, constraint)	Look for a unique parent or child node type in the graph connected to the starting node.
`get_ancestors`(node_set)
`get_connected_nodes`(node_set[, ancestors, ...])	Recursively return nodes connected to the specified node_set.
`get_descendants`(node_set)
`is_in_loss_graph`(node_or_nodes[, why_desc])	Decide if a node or collection of nodes is in the loss graph.

Exceptions