Last change
on this file since 8471 was
8308,
checked in by spimming, 12 years ago
|
#1894:
- get neighbors for specific node
- method to calculate weight between two nodes
- interface for router
- Dijkstra algorithm initial commit
- Utils methods added
|
File size:
569 bytes
|
Line | |
---|
1 |
|
---|
2 | namespace HeuristicLab.Problems.RoutePlanning.Osm {
|
---|
3 | public class Node : OsmBase {
|
---|
4 | private PointD point;
|
---|
5 |
|
---|
6 | public double Longitude {
|
---|
7 | get { return point.X; }
|
---|
8 | set { point.X = value; }
|
---|
9 | }
|
---|
10 | public double Latitude {
|
---|
11 | get { return point.Y; }
|
---|
12 | set { point.Y = value; }
|
---|
13 | }
|
---|
14 |
|
---|
15 | public PointD Point {
|
---|
16 | get { return point; }
|
---|
17 | }
|
---|
18 |
|
---|
19 | public Node() {
|
---|
20 | point = new PointD();
|
---|
21 | }
|
---|
22 |
|
---|
23 | public Node(long id, double lat, double lon)
|
---|
24 | : base(id) {
|
---|
25 | point = new PointD(lat, lon);
|
---|
26 | }
|
---|
27 | }
|
---|
28 | }
|
---|
Note: See
TracBrowser
for help on using the repository browser.