|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Packages that use CNetworkNode | |
|---|---|
| statalign.postprocess.plugins.contree | |
| Uses of CNetworkNode in statalign.postprocess.plugins.contree |
|---|
| Fields in statalign.postprocess.plugins.contree declared as CNetworkNode | |
|---|---|
CNetworkNode |
CNetworkNode.CopiedToNode
|
CNetworkNode |
CNetworkEdge.networkNodeA
|
CNetworkNode |
CNetworkEdge.networkNodeB
|
| Fields in statalign.postprocess.plugins.contree with type parameters of type CNetworkNode | |
|---|---|
java.util.ArrayList<CNetworkNode> |
CNetwork.nodes
|
java.util.ArrayList<CNetworkNode> |
CNetworkPath.pathOfNodes
|
| Methods in statalign.postprocess.plugins.contree that return CNetworkNode | |
|---|---|
CNetworkNode |
CNetworkPath.endNode()
Returns the node at the end of the path |
CNetworkNode |
CNetworkNode.findFirstNonSubset(CNetworkSplit addSplit,
java.util.ArrayList<CNetworkNode> consideredNodes,
boolean zeroSide,
int noOfTaxa)
Recursive function used to find node at which we can add a split compatible with the network Goes up from first node and finds where edges joining are no longer subset of specified side of split we want to add |
CNetworkNode |
CNetworkPath.startNode()
Returns the node at the start of the path |
CNetworkNode |
CTMain.TaxonRefToNode(int taxonRef,
CNetwork network)
Find the taxon node in the network. |
| Methods in statalign.postprocess.plugins.contree that return types with arguments of type CNetworkNode | |
|---|---|
java.util.ArrayList<CNetworkNode> |
CNetworkNode.DrawEdges(int noOfTaxa)
Function to draw the network i.e. find x and y co-ordinates for nodes. |
| Methods in statalign.postprocess.plugins.contree with parameters of type CNetworkNode | |
|---|---|
CNetworkPath |
CNetworkPath.combineWith(CNetworkPath toAdd,
CNetworkNode nodeToLinkOver)
Combines this path with the argument path across the argument node |
| Method parameters in statalign.postprocess.plugins.contree with type arguments of type CNetworkNode | |
|---|---|
void |
CNetworkNode.AddToPaths(CNetworkPath pathToAdd,
java.util.ArrayList<CNetworkNode> nodesToClearUp)
Add a path to the node path list.. |
void |
CTMain.CopyNode(java.util.ArrayList<CNetworkNode> nodesToCopy,
CNetworkSplit splitToAdd,
CNetwork network,
java.util.ArrayList<CNetworkEdge> incompatibleEdges)
Copy the list of nodes that need copying when adding a new split into a network. |
CNetworkNode |
CNetworkNode.findFirstNonSubset(CNetworkSplit addSplit,
java.util.ArrayList<CNetworkNode> consideredNodes,
boolean zeroSide,
int noOfTaxa)
Recursive function used to find node at which we can add a split compatible with the network Goes up from first node and finds where edges joining are no longer subset of specified side of split we want to add |
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||