AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
MyEdge.java
Go to the documentation of this file.
1package aud.example.graph;
2
3import aud.graph.SimpleEdge;
4
6public class MyEdge extends SimpleEdge {
7 @Override public MyEdge create() { // DON'T FORGET THIS !!!
8 return new MyEdge();
9 }
10
12 public String color = null;
13
15 public double penwidth = -1.0;
16}
edge with all possible attributes that we require ;-)
Definition: MyEdge.java:6
double penwidth
width for visualization (ignored if <0)
Definition: MyEdge.java:15
String color
color as string
Definition: MyEdge.java:12
MyEdge create()
Create new edge instance.
Definition: MyEdge.java:7
plain simple edge
Definition: SimpleEdge.java:4
Graph data structures and algorithms.
AuD lecture: Data structures, algorithms, examples.
Definition: A234Tree.java:1