-
-
-
Serialized Fields
-
area
int area
-
distance
int[][] distance
DEPRECATED
2d array where each element A_ij is the distance to the j'th node on the
i'th iteration of dijkstra's. Each row is one iteration of Dijkstra's,
we remove a used edge from the original graph and perform another iteration of
dijsktra's to create a sample of possible paths.
DEPRECATED
-
nodeIndex
int nodeIndex
-
nodeNumber
double nodeNumber
nodeNumber represents the number shown on the nodule csv data to easily associate
a nodule node with it's nodule number. If the node is not a nodule, the value defaults to -1.
The notation is noduleNumber_noduleSubnumber, and the underscore is represented as a decimal.
-
paths
ArrayList<ArrayList<int[]>> paths
2d array where each element Aij is an int[] p. First index of paths is what node we're going to. The second index is
what iteration of shortest path. The first element of p is what node
the path goes to, the second element is the pixel distance, and the remaining elements
are the nodes of the path used to get there.
-
prevNode
int[] prevNode
-
type
int type
type == 0 -> skeleton node
type == 1 -> red nodule
type == 2 -> green nodule
type == 3 -> mixed nodule