blob: 38483731cd3febc5e067482236a445157ae5a123 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
|
package com.c2kernel.graph.model;
import java.io.Serializable;
public abstract class DirectedEdge implements Serializable
{
// Persistent data
private int mId = -1;
private GraphPoint mOriginPoint = new GraphPoint(0, 0);
private GraphPoint mTerminusPoint = new GraphPoint(0, 0);
private int mOriginVertexId = -1;
private int mTerminusVertexId = -1;
public void setID(int id)
{
mId = id;
}
public int getID()
{
return mId;
}
public void setOriginPoint(GraphPoint p)
{
mOriginPoint = p;
}
public GraphPoint getOriginPoint()
{
return mOriginPoint;
}
public void setTerminusPoint(GraphPoint p)
{
mTerminusPoint = p;
}
public GraphPoint getTerminusPoint()
{
return mTerminusPoint;
}
public boolean containsPoint(GraphPoint p)
{
int midX = mOriginPoint.x + (mTerminusPoint.x - mOriginPoint.x)/2;
int midY = mOriginPoint.y + (mTerminusPoint.y - mOriginPoint.y)/2;
int minX = midX - 10;
int minY = midY - 10;
int maxX = midX + 10;
int maxY = midY + 10;
return (p.x >= minX) && (p.x <= maxX) && (p.y >= minY) && (p.y <= maxY);
}
public void setOriginVertexId(int id)
{
mOriginVertexId = id;
}
public int getOriginVertexId()
{
return mOriginVertexId;
}
public void setTerminusVertexId(int id)
{
mTerminusVertexId = id;
}
public int getTerminusVertexId()
{
return mTerminusVertexId;
}
public void setName(String name)
{
}
public String getName()
{
return null;
}
}
|