AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
PrimMinimumSpanningTree.java
Go to the documentation of this file.
1package aud.example.graph;
2
5
7 super(g);
8 }
9
10 @Override protected double priority(MyNode node, MyEdge e) {
11 assert(!Double.isInfinite(node.d));
12 return (e.hasWeight() ? e.getWeight() : 1.0);
13 }
14
15 @Override public String name() { return "PFS (Prim MST)"; }
16
17}
edge with all possible attributes that we require ;-)
Definition: MyEdge.java:6
graph based on aud.graph.GraphAM
Definition: MyGraph.java:11
node with all possible attributes that we require ;-)
Definition: MyNode.java:6
double d
distance to start node (sum of weighs or edge count if no weights defined)
Definition: MyNode.java:21
implements Prim's algorithm by defining priority
double priority(MyNode node, MyEdge e)
Compute priority of a node:
Priority first search implementation.
boolean hasWeight()
determine if edge weight is defined
double getWeight()
set edge weight
Definition: SimpleEdge.java:19