Class JacobianChainGraph.GraphConstructor
java.lang.Object
org.ddogleg.chainrule.JacobianChainGraph.GraphConstructor
- Enclosing class:
JacobianChainGraph<T>
Used to define an in-graph using dependencies between chains
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionchain(int chainID) Declares a chain to be part of the graph.depMid(int chainSrc, int blockSrc, int chainDst, int blockDst, int blockDstInput) Specifies a dependency where output is taken from any block inside the source chain and placed into an input in any block in the output chaindepOut(int chainSrc, int chainDst, int dstInput) Specifies a simple dependency where the output from the source chain feeds into the first block in the destination chain.intfixate()Creates the graph and verifies its structure
-
Constructor Details
-
GraphConstructor
public GraphConstructor()
-
-
Method Details
-
chain
Declares a chain to be part of the graph. Only needed for one no dependency names, which means a graph of a single chain: the same thing the chain does on its own, reached through the graph so that a caller does not have to switch between the two -
depMid
public JacobianChainGraph<T>.GraphConstructor depMid(int chainSrc, int blockSrc, int chainDst, int blockDst, int blockDstInput) Specifies a dependency where output is taken from any block inside the source chain and placed into an input in any block in the output chain -
depOut
Specifies a simple dependency where the output from the source chain feeds into the first block in the destination chain. Shorthand for callingdepMid(int, int, int, int, int). -
fixate
public int fixate()Creates the graph and verifies its structure- Returns:
- The graph ID for the new graph
-