|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectstatalign.postprocess.plugins.contree.CNetworkNode
public class CNetworkNode
Nodes in the consensus network Also includes a substantial amount of code that draws the edges from the node.
| Field Summary | |
|---|---|
double |
angleDirection
|
double |
angleWidth
|
boolean |
consideration
|
CNetworkNode |
CopiedToNode
|
boolean |
drawn
|
java.util.ArrayList<CNetworkEdge> |
joins
|
int |
outputNumber
|
java.util.ArrayList<CNetworkPath> |
paths
|
java.lang.String |
Taxaname
|
double |
xPos
|
double |
yPos
|
| Constructor Summary | |
|---|---|
CNetworkNode()
Initialise the node |
|
| Method Summary | |
|---|---|
void |
AddToPaths(CNetworkPath pathToAdd,
java.util.ArrayList<CNetworkNode> nodesToClearUp)
Add a path to the node path list.. |
java.util.ArrayList<CNetworkNode> |
DrawEdges(int noOfTaxa)
Function to draw the network i.e. find x and y co-ordinates for nodes. |
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 |
double |
FindWeighting(CNetworkEdge compEdge,
int noOfTaxa)
Finds the weighting of this this node using the joins that join to it. |
void |
ListToAdd(CNetworkEdge neighbourLink,
boolean start,
java.util.ArrayList<CNetworkEdge> ListToAddTo)
Function returns joined up ArrayList if must be joined in a certain order... |
double |
returnAngle(double inputAngle)
Return an angle that is in the range 0 to 2*pi.... |
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
public java.util.ArrayList<CNetworkEdge> joins
public java.lang.String Taxaname
public int outputNumber
public CNetworkNode CopiedToNode
public java.util.ArrayList<CNetworkPath> paths
public boolean consideration
public boolean drawn
public double angleDirection
public double angleWidth
public double xPos
public double yPos
| Constructor Detail |
|---|
public CNetworkNode()
| Method Detail |
|---|
public void AddToPaths(CNetworkPath pathToAdd,
java.util.ArrayList<CNetworkNode> nodesToClearUp)
pathToAdd - Path to add to this node's listnodesToClearUp - List of nodes to remove paths from at end of adding split
public CNetworkNode findFirstNonSubset(CNetworkSplit addSplit,
java.util.ArrayList<CNetworkNode> consideredNodes,
boolean zeroSide,
int noOfTaxa)
addSplit - Split that we are addingconsideredNodes - Nodes that we have so far consideredzeroSide - True if looking on zero side of split, otherwise false. Try to choose side with fewer taxa to improve efficiency.noOfTaxa - Number of taxapublic java.util.ArrayList<CNetworkNode> DrawEdges(int noOfTaxa)
noOfTaxa - Number of taxa
public double FindWeighting(CNetworkEdge compEdge,
int noOfTaxa)
compEdge - Edge that we want to find the weighting fornoOfTaxa - Number of taxa
public void ListToAdd(CNetworkEdge neighbourLink,
boolean start,
java.util.ArrayList<CNetworkEdge> ListToAddTo)
neighbourLink - start - begin from start if true, begin from end if falseListToAddTo - public double returnAngle(double inputAngle)
inputAngle - Any input angle
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||