1 /*******************************************************************************
\r
2 * Copyright (c) 2007, 2010 Association for Decentralized Information Management
\r
3 * in Industry THTH ry.
\r
4 * All rights reserved. This program and the accompanying materials
\r
5 * are made available under the terms of the Eclipse Public License v1.0
\r
6 * which accompanies this distribution, and is available at
\r
7 * http://www.eclipse.org/legal/epl-v10.html
\r
10 * VTT Technical Research Centre of Finland - initial API and implementation
\r
11 *******************************************************************************/
\r
12 package org.simantics.g2d.routing;
\r
14 public class Connection {
\r
16 * An array containing route points (also the start and end point)
\r
18 public double[] routePath;
\r
20 * Combination of the flags defined in Constants:
\r
22 public int startDirections;
\r
24 * Combination of the flags defined in Constants:
\r
26 public int endDirections;
\r
28 public Connection(double[] routePoints, int startDirections, int endDirections) {
\r
29 this.routePath = routePoints;
\r
30 this.startDirections = startDirections;
\r
31 this.endDirections = endDirections;
\r
34 public double minLength() {
\r
35 double length = 0.0;
\r
36 for(int i=2;i<routePath.length;i+=2)
\r
37 length += Math.abs(routePath[i]-routePath[i-2])
\r
38 + Math.abs(routePath[i+1]-routePath[i-1]);
\r