AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
SimpleEdge.java
Go to the documentation of this file.
1package aud.graph;
2
4public class SimpleEdge extends AbstractEdge {
5
6 String label_ = null;
7 double weight_ = Double.NaN;
8
9 @Override public SimpleEdge create() {
10 return new SimpleEdge();
11 }
12 @Override public String getLabel() {
13 return label_==null ? super.getLabel() : label_;
14 }
15
17 public void setLabel(String label) { label_=label; }
18
19 @Override public double getWeight() { return weight_; }
20 @Override public void setWeight(double w) { weight_=w; }
21}
Interface to edges of a graph.
plain simple edge
Definition: SimpleEdge.java:4
void setLabel(String label)
set label (default label if label==null)
Definition: SimpleEdge.java:17
double getWeight()
set edge weight
Definition: SimpleEdge.java:19
void setWeight(double w)
set weight
Definition: SimpleEdge.java:20
SimpleEdge create()
Create new edge instance.
Definition: SimpleEdge.java:9
String getLabel()
get text description or null if there is none
Definition: SimpleEdge.java:12