Package | Description |
---|---|
de.unihalle.informatik.MiToBo.core.datatypes |
Provides basic datatypes for MiToBo.
|
de.unihalle.informatik.MiToBo.tracking.multitarget.algo |
Modifier and Type | Class and Description |
---|---|
class |
MTBNeuriteSkelGraphNode<T>
Class implements a MTBSkeletonGraphNode, which is a type of the MTBGraphNode.
|
Modifier and Type | Field and Description |
---|---|
protected MTBGraphNode<?> |
MTBGraphEdge.src
Source node of the MTBGraphEdge.
|
protected MTBGraphNode<?> |
MTBGraphEdge.tgt
Target node of the MTBGraphEdge.
|
Modifier and Type | Field and Description |
---|---|
protected Vector<MTBGraphNode<?>> |
MTBGraph.nodes
Vector of included graph nodes.
|
Modifier and Type | Method and Description |
---|---|
MTBGraphNode<?> |
MTBGraphEdge.getSrcNode()
Get source node of the MTBGraphEdge.
|
MTBGraphNode<?> |
MTBGraphEdge.getTgtNode()
Get target node of the MTBGraphEdge.
|
Modifier and Type | Method and Description |
---|---|
Vector<MTBGraphNode<T>> |
MTBGraphNode.getNeighbors()
Get all neighbors of the current node.
|
Vector<MTBGraphNode<?>> |
MTBGraph.getNodes()
Get all nodes of the MTBGraph.
|
Modifier and Type | Method and Description |
---|---|
void |
MTBGraph.addNode(MTBGraphNode<?> node)
Add a node to MTBGraph.
|
boolean |
MTBGraphEdge.nodeIsSrc(MTBGraphNode<?> node) |
boolean |
MTBGraphEdge.nodeIsTgt(MTBGraphNode<?> node) |
void |
MTBGraph.removeNode(MTBGraphNode<?> node)
Remove the specified node from the graph as well as the edges connected to it.
|
protected void |
MTBGraphEdge.setSrcNode(MTBGraphNode<?> node)
Set source node of the MTBGraphEdge.
|
protected void |
MTBGraphEdge.setTgtNode(MTBGraphNode<?> node)
Set target node of the MTBGraphEdge.
|
Constructor and Description |
---|
MTBGraphEdge(MTBGraphNode<?> src,
MTBGraphNode<?> tgt,
Vector<?> edgeData)
Constructor to create a new MTBGraphEdge.
|
MTBGraphEdge(MTBGraphNode<?> src,
MTBGraphNode<?> tgt,
Vector<?> edgeData)
Constructor to create a new MTBGraphEdge.
|
MTBGraphEdge(MTBGraphNode<?> src,
MTBGraphNode<?> tgt,
Vector<?> edgeData,
double cost)
Constructor to create a new MTBGraphEdge.
|
MTBGraphEdge(MTBGraphNode<?> src,
MTBGraphNode<?> tgt,
Vector<?> edgeData,
double cost)
Constructor to create a new MTBGraphEdge.
|
Constructor and Description |
---|
MTBGraph(Vector<MTBGraphNode<?>> nodes,
Vector<MTBGraphEdge> edges,
boolean directed)
Constructor to create an undirected or directed MTBGraph with the given
nodes and edges.
|
Modifier and Type | Field and Description |
---|---|
(package private) HashMap<Integer,Vector<MTBGraphNode<PartitGraphNodeID>>> |
GreedyGourmetPartitioning.partitions |
Modifier and Type | Method and Description |
---|---|
private MTBGraphNode<PartitGraphNodeID> |
GreedyGourmetPartitioning.getGraphNode(int subgraphID,
int partitionID)
Get the graph node from partition 'partitionID' in subgraph 'subgraphID'.
|
private MTBGraphNode<PartitGraphNodeID> |
GreedyGourmetPartitioning.getOptimalNeighbor(MTBGraphNode<PartitGraphNodeID> currentNode,
int partitionID)
Get node of partition 'partitionID' which is connected to current node and has optimal weight
|
Modifier and Type | Method and Description |
---|---|
private boolean |
GreedyGourmetPartitioning.connectNodesCase1(MTBGraphNode<PartitGraphNodeID> n1,
MTBGraphNode<PartitGraphNodeID> n2,
MTBGraphNode<PartitGraphNodeID> nstar1,
MTBGraphNode<PartitGraphNodeID> nstar2,
boolean do_connect)
Connect nodes if case 1
|
private boolean |
GreedyGourmetPartitioning.connectNodesCase1(MTBGraphNode<PartitGraphNodeID> n1,
MTBGraphNode<PartitGraphNodeID> n2,
MTBGraphNode<PartitGraphNodeID> nstar1,
MTBGraphNode<PartitGraphNodeID> nstar2,
boolean do_connect)
Connect nodes if case 1
|
private boolean |
GreedyGourmetPartitioning.connectNodesCase1(MTBGraphNode<PartitGraphNodeID> n1,
MTBGraphNode<PartitGraphNodeID> n2,
MTBGraphNode<PartitGraphNodeID> nstar1,
MTBGraphNode<PartitGraphNodeID> nstar2,
boolean do_connect)
Connect nodes if case 1
|
private boolean |
GreedyGourmetPartitioning.connectNodesCase1(MTBGraphNode<PartitGraphNodeID> n1,
MTBGraphNode<PartitGraphNodeID> n2,
MTBGraphNode<PartitGraphNodeID> nstar1,
MTBGraphNode<PartitGraphNodeID> nstar2,
boolean do_connect)
Connect nodes if case 1
|
private MTBGraphNode<PartitGraphNodeID> |
GreedyGourmetPartitioning.getOptimalNeighbor(MTBGraphNode<PartitGraphNodeID> currentNode,
int partitionID)
Get node of partition 'partitionID' which is connected to current node and has optimal weight
|
Copyright © 2010–2020 Martin Luther University Halle-Wittenberg, Institute of Computer Science, Pattern Recognition and Bioinformatics. All rights reserved.