| 
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectpedviz.algorithms.Highlighter
public class Highlighter
This class provides some generally useful methods for finding parents and children by a given node and checking if exists a path between two nodes.
| Field Summary | |
|---|---|
static int | 
ANCESTORS
All ancestors of a person.  | 
static int | 
MATERNAL
Maternal lineage of a person.  | 
static int | 
MATERNAL_AND_PATERNAL
Maternal and paternal lineage of a person.  | 
static int | 
PATERNAL
Paternal lineage of a person.  | 
static int | 
SUCCESSORS
All successors of a person.  | 
static int | 
SUCCESSORS_AND_ANCESTORS
All successors and ancestors of a person.  | 
| Constructor Summary | |
|---|---|
Highlighter()
 | 
|
| Method Summary | |
|---|---|
static java.util.ArrayList<Node> | 
findLineOfDescents(Graph graph,
                   Node node,
                   int mode)
Returns a collection of nodes dependent on the given mode.  | 
static java.util.ArrayList<Node> | 
findParentsAndChilds(Node node)
Returns all ancestors and successor for the given node.  | 
static java.util.ArrayList<Node> | 
findParentsAndChilds(Node node,
                     int max)
Returns the ancestors and successors for the given node.  | 
static java.util.ArrayList<Node> | 
findPath(Node nodeA,
         Node nodeB)
Checks if exists a path between nodeA and nodeB.  | 
| Methods inherited from class java.lang.Object | 
|---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait | 
| Field Detail | 
|---|
public static final int MATERNAL
public static final int PATERNAL
public static final int MATERNAL_AND_PATERNAL
public static final int SUCCESSORS
public static final int ANCESTORS
public static final int SUCCESSORS_AND_ANCESTORS
| Constructor Detail | 
|---|
public Highlighter()
| Method Detail | 
|---|
public static java.util.ArrayList<Node> findPath(Node nodeA,
                                                 Node nodeB)
nodeA - start nodenodeB - destination node
public static java.util.ArrayList<Node> findParentsAndChilds(Node node,
                                                             int max)
node - The nodemax - Number of max generations that should be considered.
public static java.util.ArrayList<Node> findParentsAndChilds(Node node)
node - The node
public static java.util.ArrayList<Node> findLineOfDescents(Graph graph,
                                                           Node node,
                                                           int mode)
Returns a collection of nodes dependent on the given mode.
graph - Graph objectnode - strat nodemode - mode
  | 
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||