Uses of Interface
uk.ac.ebi.arrayexpress2.magetab.datamodel.graph.Node

Packages that use Node

Package	Description
uk.ac.ebi.arrayexpress2.magetab.datamodel.adf.node	Classes that model the nodes in the ADF graph datastructure, as described by the MAGE-TAB specification.
uk.ac.ebi.arrayexpress2.magetab.datamodel.graph	Some high-level graph modelling classes, for representing abstract graphs.
uk.ac.ebi.arrayexpress2.magetab.datamodel.graph.utils
uk.ac.ebi.arrayexpress2.magetab.datamodel.sdrf.node	Classes that model nodes in the SDRF graph datastructure, as described by the MAGE-TAB specification.

Uses of Node in uk.ac.ebi.arrayexpress2.magetab.datamodel.adf.node

Subinterfaces of Node in uk.ac.ebi.arrayexpress2.magetab.datamodel.adf.node

Modifier and Type	Interface and Description
interface	ADFNode A node in the ADF data structure.

Classes in uk.ac.ebi.arrayexpress2.magetab.datamodel.adf.node that implement Node

Modifier and Type	Class and Description
class	AbstractADFNode An abstract top-level implementation of an ADFNode.
class	CompositeElementNode Models "Composite Element" nodes in the ADF graph, according to the MAGE-TAB specification.
class	FeatureNode Models "Feature" nodes in the ADF graph, according to the MAGE-TAB specification.
class	ReporterNode Models "Reporter" nodes in the ADF graph, according to the MAGE-TAB specification.

Uses of Node in uk.ac.ebi.arrayexpress2.magetab.datamodel.graph

Classes in uk.ac.ebi.arrayexpress2.magetab.datamodel.graph with type parameters of type Node

Modifier and Type	Class and Description
class	AbstractGraph<S extends Node> An abstract top-level implementation of a MAGE-TAB graph.
interface	Graph<S extends Node> A directed, acyclic graph that can be used to store Nodes that are linked together.

Classes in uk.ac.ebi.arrayexpress2.magetab.datamodel.graph that implement Node

Modifier and Type	Class and Description
class	AbstractNode An abstract top-level implementation of a Node in the MAGE-TAB graph.
class	UnresolvedPlaceholderNode A dedicated type of graph node that serves as a simple placeholder in lieu of the node being fully parsed.

Methods in uk.ac.ebi.arrayexpress2.magetab.datamodel.graph that return types with arguments of type Node

Modifier and Type	Method and Description
Set<Node>	Node.getChildNodes() Returns the set of nodes that are children of this node.
Set<Node>	AbstractNode.getChildNodes()
Set<Node>	Node.getParentNodes() Returns the set of nodes that are parents of this node.
Set<Node>	AbstractNode.getParentNodes()

Methods in uk.ac.ebi.arrayexpress2.magetab.datamodel.graph with parameters of type Node

Modifier and Type	Method and Description
void	Node.addChildNode(Node childNode) Adds the child node to this Node.
void	AbstractNode.addChildNode(Node childNode)
void	Node.addParentNode(Node parentNode) Adds a parent node to this node
void	AbstractNode.addParentNode(Node parentNode)
void	AbstractGraph.checkForCycles(Node node, Node childNode)
void	Graph.checkForCycles(Node node, Node childNode) Assertain whether this graph contains any cycles.
void	Node.removeChildNode(Node childNode) Removes the reference to the child from this node
void	AbstractNode.removeChildNode(Node childNode)
void	AbstractGraph.removeNode(Node node)
void	Node.removeParentNode(Node parentNode) Removes the reference to the parent from this node
void	AbstractNode.removeParentNode(Node parentNode)
boolean	Node.updateChildNode(Node nodeToUpdate) Updates a child node equal to the supplied node with a new object reference.
boolean	AbstractNode.updateChildNode(Node nodeToUpdate)
boolean	Node.updateParentNode(Node nodeToUpdate) Updates a parent node equal to the supplied node with a new object reference.
boolean	AbstractNode.updateParentNode(Node nodeToUpdate)

Uses of Node in uk.ac.ebi.arrayexpress2.magetab.datamodel.graph.utils

Methods in uk.ac.ebi.arrayexpress2.magetab.datamodel.graph.utils with type parameters of type Node

Modifier and Type	Method and Description
static <T extends Node> Collection<T>	GraphUtils.findDownstreamNodes(Node currentNode, Class<T> downstreamNodeType) Finds nodes downstream of the given node in the graph, searching for nodes of a particular type.
static <T extends Node> Collection<T>	GraphUtils.findUpstreamNodes(Node currentNode, Class<T> upstreamNodeType) Finds nodes upstream of the given node in the graph, searching for nodes of a particular type.

Methods in uk.ac.ebi.arrayexpress2.magetab.datamodel.graph.utils that return types with arguments of type Node

Modifier and Type	Method and Description
static Collection<? extends Node>	GraphUtils.findDownstreamNodes(Node currentNode, String downstreamNodeType) Finds nodes downstream of the given node in the graph, searching for nodes of a particular type.
static Collection<? extends Node>	GraphUtils.findUpstreamNodes(Node currentNode, String upstreamNodeType) Finds nodes upstream of the given node in the graph, searching for nodes of a particular type.

Methods in uk.ac.ebi.arrayexpress2.magetab.datamodel.graph.utils with parameters of type Node

Modifier and Type	Method and Description
static <T extends Node> Collection<T>	GraphUtils.findDownstreamNodes(Node currentNode, Class<T> downstreamNodeType) Finds nodes downstream of the given node in the graph, searching for nodes of a particular type.
static Collection<? extends Node>	GraphUtils.findDownstreamNodes(Node currentNode, String downstreamNodeType) Finds nodes downstream of the given node in the graph, searching for nodes of a particular type.
static <T extends Node> Collection<T>	GraphUtils.findUpstreamNodes(Node currentNode, Class<T> upstreamNodeType) Finds nodes upstream of the given node in the graph, searching for nodes of a particular type.
static Collection<? extends Node>	GraphUtils.findUpstreamNodes(Node currentNode, String upstreamNodeType) Finds nodes upstream of the given node in the graph, searching for nodes of a particular type.
static boolean	GraphUtils.isDirectlyDownstream(Node currentNode, Node maybeDownstreamNode) Determine whether the query node, "maybeDownstreamNode", is downstream of the current node in the given SDRF graph.
static boolean	GraphUtils.isDirectlyUpstream(Node currentNode, Node maybeUpstreamNode) Determine whether the query node, "maybeUpstreamNode", is upstream of the current node in the given graph.

Uses of Node in uk.ac.ebi.arrayexpress2.magetab.datamodel.sdrf.node

Subinterfaces of Node in uk.ac.ebi.arrayexpress2.magetab.datamodel.sdrf.node

Modifier and Type	Interface and Description
interface	SDRFNode A node in the SDRF data structure.

Classes in uk.ac.ebi.arrayexpress2.magetab.datamodel.sdrf.node that implement Node

Modifier and Type	Class and Description
class	AbstractSDRFNode An abstract top-level implementation of an SDRFNode.
class	ArrayDataMatrixNode An array data matrix node in the graph.
class	ArrayDataNode An array data node in the graph.
class	ArrayDesignNode Deprecated. since version 1.1
class	AssayNode An Assay Node, in the SDRF graph.
class	DerivedArrayDataMatrixNode A derived array data matrix node in the graph.
class	DerivedArrayDataNode A derived array data node in the graph.
class	ExtractNode An extract node in the graph.
class	HybridizationNode A hybridization node in the graph.
class	ImageNode An image node in the graph.
class	LabeledExtractNode A labeled extract node in the graph.
class	NormalizationNode A normalization node in the graph.
class	ProtocolApplicationNode A protocol "node" in the graph.
class	SampleNode A sample node in the graph.
class	ScanNode A scan node in the graph.
class	SourceNode A source node in the graph.