Uses of Class
fr.curie.BiNoM.pathways.analysis.structure.Node

Packages that use Node

fr.curie.BiNoM.pathways.analysis.structure

Tools for structural analysis of biological graphs

Uses of Node in fr.curie.BiNoM.pathways.analysis.structure

Fields in fr.curie.BiNoM.pathways.analysis.structure declared as Node

Node	Edge.Node1 Source node
Node	Edge.Node2 Target node

Methods in fr.curie.BiNoM.pathways.analysis.structure that return Node

Node	Graph.getCreateNode(java.lang.String id)
Node	Graph.getNode(java.lang.String id)
Node	Graph.getNodeByLabel(java.lang.String label)
Node	Node.makeCopy() Clones the node

Methods in fr.curie.BiNoM.pathways.analysis.structure with parameters of type Node

void	Graph.addNode(Node n)
static java.util.Vector<Graph>	GraphAlgorithms.Dijkstra(Graph graph, Node source, Node target, boolean directedGraph, boolean suboptimal, double searchRadius)
static java.util.Vector<Graph>	GraphAlgorithms.DijkstraAlgorithm(Graph graph, Node source, Node target, boolean directedGraph, double searchRadius)
static java.util.Vector<Graph>	GraphAlgorithms.FindAllPaths(Graph graph, Node source, java.util.Set<Node> targets, boolean directedGraph, double searchRadius) Note: searchRadius here is the number of edges from source (edge weights are not considered)
static Graph	GraphAlgorithms.GetConnectedComponent(Graph graph, Node n)
java.util.Vector<Edge>	Graph.getEdge(Node source, Node target, boolean directedGraph)

Method parameters in fr.curie.BiNoM.pathways.analysis.structure with type arguments of type Node

static java.util.Vector<Graph>

GraphAlgorithms.FindAllPaths(Graph graph, Node source, java.util.Set<Node> targets, boolean directedGraph, double searchRadius) Note: searchRadius here is the number of edges from source (edge weights are not considered)