|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Edge | |
---|---|
fr.curie.BiNoM.pathways.analysis.structure | Tools for structural analysis of biological graphs |
Uses of Edge in fr.curie.BiNoM.pathways.analysis.structure |
---|
Methods in fr.curie.BiNoM.pathways.analysis.structure that return Edge | |
---|---|
Edge |
Edge.copy()
|
Edge |
Graph.getCreateEdge(java.lang.String id)
|
Edge |
Graph.getEdge(java.lang.String id)
|
Edge |
Graph.getEdgeByLabel(java.lang.String label)
|
Methods in fr.curie.BiNoM.pathways.analysis.structure that return types with arguments of type Edge | |
---|---|
java.util.Vector<Edge> |
Graph.getEdge(Node source,
Node target,
boolean directedGraph)
|
static java.util.Vector<java.util.Vector<Edge>> |
GraphAlgorithms.neighboursOfNodeHash(Graph graph,
boolean directedGraph)
Sub-routine for Dijkstra's algorithm Returns vector (of length number of nodes) of vectors of outgoing edges numbers |
Methods in fr.curie.BiNoM.pathways.analysis.structure with parameters of type Edge | |
---|---|
void |
Graph.addEdge(Edge e)
|
void |
Graph.addEdgeIdUnique(Edge e)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |