listIdProcess = BenchmarkMemory.listIdProcess();
+ for (Integer integer : listIdProcess) {
+ System.out.println(BenchmarkMemory.ioProcess(integer, PROCESS.READ));
+ System.out.println(BenchmarkMemory.ioProcess(integer, PROCESS.WRITE));
+ }
+ }
+}
diff --git a/core/src/main/java/org/graphast/util/ConnectionJDBC.java b/core/src/main/java/org/graphast/util/ConnectionJDBC.java
new file mode 100644
index 0000000..1d997f7
--- /dev/null
+++ b/core/src/main/java/org/graphast/util/ConnectionJDBC.java
@@ -0,0 +1,38 @@
+package org.graphast.util;
+
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.IOException;
+import java.sql.Connection;
+import java.sql.DriverManager;
+import java.sql.SQLException;
+import java.util.Properties;
+
+public class ConnectionJDBC {
+
+ private static Connection connection = null;
+ private static final String FILE_NAME_PROPERTIES = "db.properties";
+ private static final String STR_DRIVER = "driver";
+ private static final String STR_HOST = "host";
+ private static final String STR_USER = "user";
+ private static final String STR_PASS = "password";
+
+
+ public static Connection getConnection() throws ClassNotFoundException,
+ SQLException, IOException {
+
+ if (connection == null || connection.isClosed()) {
+
+ Properties properties = new Properties();
+ properties.load(new FileInputStream(new File(FILE_NAME_PROPERTIES)));
+ Class.forName(properties.getProperty(STR_DRIVER));
+ String host = properties.getProperty(STR_HOST);
+ String user = properties.getProperty(STR_USER);
+ String password = properties.getProperty(STR_PASS);
+
+ connection = DriverManager.getConnection(host, user, password);
+ }
+
+ return connection;
+ }
+}
diff --git a/core/src/main/java/org/graphast/util/GeoUtils.java b/core/src/main/java/org/graphast/util/GeoUtils.java
index da91e13..2c7c48d 100644
--- a/core/src/main/java/org/graphast/util/GeoUtils.java
+++ b/core/src/main/java/org/graphast/util/GeoUtils.java
@@ -1,93 +1,103 @@
-package org.graphast.util;
-
-public class GeoUtils {
-
- final private static double R_MAJOR = 6378137.0;
- final private static double R_MINOR = 6356752.3142;
-
- /**
- * Factor used to convert and round latitude and longitude to/from int.
- */
- public static int LAT_LONG_CONVERTION_FACTOR = 1000000;
-
-
- public GeoUtils() {
- }
-
- public static int latLongToInt(double number) {
- return (int) NumberUtils.convert(number, LAT_LONG_CONVERTION_FACTOR);
- }
-
- public static double latLongToDouble(int number) {
- return number / (double) LAT_LONG_CONVERTION_FACTOR;
- }
-
- public static String long2XSpherical(String number) {
- try {
- double d = Double.parseDouble(number);
- return String.valueOf(long2XSpherical(d));
- } catch (Exception e) {
- throw new IllegalArgumentException("Could not convert " + number + " to double.", e);
- }
- }
-
- public static String lat2YSpherical(String number) {
- try {
- double d = Double.parseDouble(number);
- return String.valueOf(lat2YSpherical(d));
- } catch (Exception e) {
- throw new IllegalArgumentException("Could not convert " + number + " to double.", e);
- }
- }
-
- /**
- *
- * @param longitude in degrees
- * @return X offset from your original position in meters.
- */
- public static double long2XSpherical(double longitude) {
- return 6378137 * Math.toRadians(longitude);
- }
-
- /**
- *
- * @param latitude in degrees
- * @return Y offset from your original position in meters.
- */
- public static double lat2YSpherical(double latitude) {
- return 6378137 * Math.log(Math.tan(Math.PI / 4 + Math.toRadians(latitude) / 2.0));
- }
-
- public static double x2LongSpherical(double x) {
- return Math.toDegrees(x / 6378137.0);
- }
-
- public static double y2LatSpherical(double y) {
- return Math.toDegrees(Math.atan(Math.sinh(y / 6378137)));
- }
-
- public static double long2XElliptical(double lon) {
- return R_MAJOR * Math.toRadians(lon);
- }
-
- public static double lat2YElliptical(double lat) {
- if (lat > 89.5) {
- lat = 89.5;
- }
- if (lat < -89.5) {
- lat = -89.5;
- }
- double temp = R_MINOR / R_MAJOR;
- double es = 1.0 - (temp * temp);
- double eccent = Math.sqrt(es);
- double phi = Math.toRadians(lat);
- double sinphi = Math.sin(phi);
- double con = eccent * sinphi;
- double com = 0.5 * eccent;
- con = Math.pow(((1.0-con)/(1.0+con)), com);
- double ts = Math.tan(0.5 * ((Math.PI*0.5) - phi))/con;
- double y = 0 - R_MAJOR * Math.log(ts);
- return y;
- }
-
-}
+package org.graphast.util;
+
+import org.graphast.model.Edge;
+import org.graphast.model.GraphBounds;
+import org.graphast.model.Node;
+
+public class GeoUtils {
+
+ final private static double R_MAJOR = 6378137.0;
+ final private static double R_MINOR = 6356752.3142;
+
+ /**
+ * Factor used to convert and round latitude and longitude to/from int.
+ */
+ public static int LAT_LONG_CONVERTION_FACTOR = 1000000;
+
+
+ public GeoUtils() {
+ }
+
+ public static int latLongToInt(double number) {
+ return (int) NumberUtils.convert(number, LAT_LONG_CONVERTION_FACTOR);
+ }
+
+ public static double latLongToDouble(int number) {
+ return number / (double) LAT_LONG_CONVERTION_FACTOR;
+ }
+
+ public static String long2XSpherical(String number) {
+ try {
+ double d = Double.parseDouble(number);
+ return String.valueOf(long2XSpherical(d));
+ } catch (Exception e) {
+ throw new IllegalArgumentException("Could not convert " + number + " to double.", e);
+ }
+ }
+
+ public static String lat2YSpherical(String number) {
+ try {
+ double d = Double.parseDouble(number);
+ return String.valueOf(lat2YSpherical(d));
+ } catch (Exception e) {
+ throw new IllegalArgumentException("Could not convert " + number + " to double.", e);
+ }
+ }
+
+ /**
+ *
+ * @param longitude in degrees
+ * @return X offset from your original position in meters.
+ */
+ public static double long2XSpherical(double longitude) {
+ return 6378137 * Math.toRadians(longitude);
+ }
+
+ /**
+ *
+ * @param latitude in degrees
+ * @return Y offset from your original position in meters.
+ */
+ public static double lat2YSpherical(double latitude) {
+ return 6378137 * Math.log(Math.tan(Math.PI / 4 + Math.toRadians(latitude) / 2.0));
+ }
+
+ public static double x2LongSpherical(double x) {
+ return Math.toDegrees(x / 6378137.0);
+ }
+
+ public static double y2LatSpherical(double y) {
+ return Math.toDegrees(Math.atan(Math.sinh(y / 6378137)));
+ }
+
+ public static double long2XElliptical(double lon) {
+ return R_MAJOR * Math.toRadians(lon);
+ }
+
+ public static double lat2YElliptical(double lat) {
+ if (lat > 89.5) {
+ lat = 89.5;
+ }
+ if (lat < -89.5) {
+ lat = -89.5;
+ }
+ double temp = R_MINOR / R_MAJOR;
+ double es = 1.0 - (temp * temp);
+ double eccent = Math.sqrt(es);
+ double phi = Math.toRadians(lat);
+ double sinphi = Math.sin(phi);
+ double con = eccent * sinphi;
+ double com = 0.5 * eccent;
+ con = Math.pow(((1.0-con)/(1.0+con)), com);
+ double ts = Math.tan(0.5 * ((Math.PI*0.5) - phi))/con;
+ double y = 0 - R_MAJOR * Math.log(ts);
+ return y;
+ }
+
+ public static boolean isPointInEdgeLine(GraphBounds graph, Node point, Edge edge) {
+ Node start = graph.getNode(edge.getFromNode());
+ Node end = graph.getNode(edge.getToNode());
+ return DistanceUtils.distanceLatLong(start, point)+DistanceUtils.distanceLatLong(point, end)-DistanceUtils.distanceLatLong(start, end)<=0.1;
+ }
+
+}
diff --git a/core/src/main/java/org/graphast/util/NumberUtils.java b/core/src/main/java/org/graphast/util/NumberUtils.java
index f19eea8..1cb6b78 100755
--- a/core/src/main/java/org/graphast/util/NumberUtils.java
+++ b/core/src/main/java/org/graphast/util/NumberUtils.java
@@ -1,116 +1,121 @@
-package org.graphast.util;
-
-import java.math.BigDecimal;
-import java.math.RoundingMode;
-
-import org.graphast.exception.GraphastException;
-
-public class NumberUtils {
-
- public final static int SEGMENT_SHIFT = 14;
-
- public final static int SEGMENT_SIZE = 1 << SEGMENT_SHIFT;
-
- public final static int SEGMENT_MASK = SEGMENT_SIZE - 1;
-
- /**
- * Returns a numeric value rounded to a specified number of digits.
- * Negative decimals indicates the number of digits to the left of the
- * decimal point to round. For example:
- *
- * NumberUtils.round(10.4, 0) // Result: 10.0
- * NumberUtils.round(10.5, 0) // Result: 11.0
- * NumberUtils.round(-10.5, 0) // Result: -11.0
- * NumberUtils.round(10.51, 0) // Result: 11.0
- * NumberUtils.round(10.49999999999999, 2) // Result: 10.5
- *
- * Digits between five to nine, inclusive, are rounded up. Digits below
- * five are rounded down.
- * @param number the numeric value to round.
- * @param decimals defines the number of decimal places to retain.
- * @return the numeric value rounded to a specified number of digits.
- */
- public static double round(double number, int decimals) {
- double factor = (int)Math.pow(10, decimals);
- number = number * factor;
- if (number > 0) {
- number = Math.round(number);
- } else {
- number = -Math.round(-number);
- }
- return number / factor;
- }
-
- /**
- * Returns a numeric value rounded to a specified number of digits.
- * Negative decimals indicates the number of digits to the left of the
- * decimal point to round. For example:
- *
- * NumberUtils.round(10.4, 0) // Result: 10.0
- * NumberUtils.round(10.5, 0) // Result: 11.0
- * NumberUtils.round(-10.5, 0) // Result: -11.0
- * NumberUtils.round(10.51, 0) // Result: 11.0
- * NumberUtils.round(10.49999999999999, 2) // Result: 10.5
- *
- * Digits between five to nine, inclusive, are rounded up. Digits below
- * five are rounded down.
- * @param number the numeric value to round.
- * @param decimals defines the number of decimal places to retain.
- * @return the numeric value rounded to a specified number of digits.
- */
- public static BigDecimal round(BigDecimal number, int decimals) {
- return number.setScale(decimals, RoundingMode.HALF_UP);
- }
-
- public static long convert(double number, int factor) {
- number = number * factor;
- if (number > 0) {
- number = Math.round(number);
- } else {
- number = -Math.round(-number);
- }
- return (long)number;
- }
-
- public static int convertToInt(Object obj){
- if(obj instanceof Long){
- return (int) ((long) obj);
- }else if(obj instanceof String){
- return Integer.parseInt((String) obj);
- }else{
- throw new GraphastException("Can not convert to int type");
- }
- }
-
- /**
- * Returns the segment part (a 'short' number) of a passed 'int' number.
- *
- * @param number an 'int' number to be segmented
- * @return the segment part (a 'short' number) of the passed 'int'
- */
- public static short segment(int number) {
- return (short)(number >> 16);
- }
-
- /**
- * Returns the displacement part (a 'short' number) of a passed 'int' number.
- *
- * @param number an 'int' number to be 'displacemented'
- * @return the displacement part (a 'short' number) of the passed 'int'
- */
- public static short displacement(int number ) {
- return (short)number;
- }
-
- /**
- * Turns two 'short' type numbers (segment and displacement) into a new 'int' number.
- *
- * @param segment segment part of the new 'int' number that will be created
- * @param displacement displacement part of the new 'int' number that will be created
- * @return an 'int' number based on the segment and displacement passed
- */
- public static int index( final short segment, final short displacement ) {
- return (short)segment << 16 | displacement & 0xFFFF;
- }
-
-}
+package org.graphast.util;
+
+import java.math.BigDecimal;
+import java.math.RoundingMode;
+import java.util.Random;
+
+import org.graphast.exception.GraphastException;
+
+public class NumberUtils {
+
+ public final static int SEGMENT_SHIFT = 14;
+
+ public final static int SEGMENT_SIZE = 1 << SEGMENT_SHIFT;
+
+ public final static int SEGMENT_MASK = SEGMENT_SIZE - 1;
+
+ /**
+ * Returns a numeric value rounded to a specified number of digits.
+ * Negative decimals indicates the number of digits to the left of the
+ * decimal point to round. For example:
+ *
+ * NumberUtils.round(10.4, 0) // Result: 10.0
+ * NumberUtils.round(10.5, 0) // Result: 11.0
+ * NumberUtils.round(-10.5, 0) // Result: -11.0
+ * NumberUtils.round(10.51, 0) // Result: 11.0
+ * NumberUtils.round(10.49999999999999, 2) // Result: 10.5
+ *
+ * Digits between five to nine, inclusive, are rounded up. Digits below
+ * five are rounded down.
+ * @param number the numeric value to round.
+ * @param decimals defines the number of decimal places to retain.
+ * @return the numeric value rounded to a specified number of digits.
+ */
+ public static double round(double number, int decimals) {
+ double factor = (int)Math.pow(10, decimals);
+ number = number * factor;
+ if (number > 0) {
+ number = Math.round(number);
+ } else {
+ number = -Math.round(-number);
+ }
+ return number / factor;
+ }
+
+ /**
+ * Returns a numeric value rounded to a specified number of digits.
+ * Negative decimals indicates the number of digits to the left of the
+ * decimal point to round. For example:
+ *
+ * NumberUtils.round(10.4, 0) // Result: 10.0
+ * NumberUtils.round(10.5, 0) // Result: 11.0
+ * NumberUtils.round(-10.5, 0) // Result: -11.0
+ * NumberUtils.round(10.51, 0) // Result: 11.0
+ * NumberUtils.round(10.49999999999999, 2) // Result: 10.5
+ *
+ * Digits between five to nine, inclusive, are rounded up. Digits below
+ * five are rounded down.
+ * @param number the numeric value to round.
+ * @param decimals defines the number of decimal places to retain.
+ * @return the numeric value rounded to a specified number of digits.
+ */
+ public static BigDecimal round(BigDecimal number, int decimals) {
+ return number.setScale(decimals, RoundingMode.HALF_UP);
+ }
+
+ public static long convert(double number, int factor) {
+ number = number * factor;
+ if (number > 0) {
+ number = Math.round(number);
+ } else {
+ number = -Math.round(-number);
+ }
+ return (long)number;
+ }
+
+ public static int convertToInt(Object obj){
+ if(obj instanceof Long){
+ return (int) ((long) obj);
+ }else if(obj instanceof String){
+ return Integer.parseInt((String) obj);
+ }else{
+ throw new GraphastException("Can not convert to int type");
+ }
+ }
+
+ /**
+ * Returns the segment part (a 'short' number) of a passed 'int' number.
+ *
+ * @param number an 'int' number to be segmented
+ * @return the segment part (a 'short' number) of the passed 'int'
+ */
+ public static short segment(int number) {
+ return (short)(number >> 16);
+ }
+
+ /**
+ * Returns the displacement part (a 'short' number) of a passed 'int' number.
+ *
+ * @param number an 'int' number to be 'displacemented'
+ * @return the displacement part (a 'short' number) of the passed 'int'
+ */
+ public static short displacement(int number ) {
+ return (short)number;
+ }
+
+ /**
+ * Turns two 'short' type numbers (segment and displacement) into a new 'int' number.
+ *
+ * @param segment segment part of the new 'int' number that will be created
+ * @param displacement displacement part of the new 'int' number that will be created
+ * @return an 'int' number based on the segment and displacement passed
+ */
+ public static int index( final short segment, final short displacement ) {
+ return (short)segment << 16 | displacement & 0xFFFF;
+ }
+
+ public static double generatePdseurandom(int rangeMin, int rangeMax) {
+ return rangeMin + (rangeMax - rangeMin) * new Random().nextDouble();
+ }
+
+}
diff --git a/core/src/main/resources/log4j.properties b/core/src/main/resources/log4j.properties
index 31249d0..790f3f2 100755
--- a/core/src/main/resources/log4j.properties
+++ b/core/src/main/resources/log4j.properties
@@ -1,27 +1,29 @@
-# Log levels: TRACE, DEBUG, INFO, WARN, ERROR, FATAL
-log4j.threshold=ALL
-log4j.rootLogger=ALL, stdout, logfile
-
-log4j.appender.stdout=org.apache.log4j.ConsoleAppender
-log4j.appender.stdout.layout=org.apache.log4j.PatternLayout
-log4j.appender.stdout.layout.ConversionPattern=%-5p %d [%c:%L] - %m%n
-log4j.appender.stdout.threshold=DEBUG
-#log4j.appender.stdout.threshold=INFO
-
-log4j.appender.logfile=org.apache.log4j.RollingFileAppender
-log4j.appender.logfile.File=${user.home}/graphast.log
-log4j.appender.logfile.MaxFileSize=1024KB
-log4j.appender.logfile.MaxBackupIndex=5
-log4j.appender.logfile.layout=org.apache.log4j.PatternLayout
-#log4j.appender.logfile.layout.ConversionPattern=%-5p %d [%c:%L] - %m%n
-log4j.appender.logfile.layout.ConversionPattern=%m%n
-log4j.appender.logfile.threshold=TRACE
-#log4j.appender.logfile.threshold=INFO
-
-log4j.category.br.com.caelum.vraptor=INFO
-log4j.category.org.springframework=WARN
-log4j.category.org.apache=INFO
-log4j.category.br.com.nex2me.mobme.network.road.model.RoadGraphAdapter=INFO
-log4j.category.br.com.nex2me.mobme.core.model.GraphAdapter=INFO
-log4j.category.com.thinkaurelius.titan=ERROR
-log4j.category.org.apache.cassandra=ERROR
\ No newline at end of file
+# Log levels: TRACE, DEBUG, INFO, WARN, ERROR, FATAL
+log4j.threshold=ALL
+log4j.rootLogger=ALL, stdout, logfile
+
+log4j.appender.stdout=org.apache.log4j.ConsoleAppender
+log4j.appender.stdout.layout=org.apache.log4j.PatternLayout
+log4j.appender.stdout.layout.ConversionPattern=%-5p %d [%c:%L] - %m%n
+log4j.appender.stdout.threshold=DEBUG
+#log4j.appender.stdout.threshold=INFO
+
+log4j.appender.logfile=org.apache.log4j.RollingFileAppender
+log4j.appender.logfile.File=${user.home}/graphast.log
+log4j.appender.logfile.MaxFileSize=1024KB
+log4j.appender.logfile.MaxBackupIndex=5
+log4j.appender.logfile.layout=org.apache.log4j.PatternLayout
+#log4j.appender.logfile.layout.ConversionPattern=%-5p %d [%c:%L] - %m%n
+log4j.appender.logfile.layout.ConversionPattern=%m%n
+log4j.appender.logfile.threshold=TRACE
+#log4j.appender.logfile.threshold=INFO
+
+log4j.category.br.com.caelum.vraptor=INFO
+log4j.category.org.springframework=WARN
+log4j.category.org.apache=INFO
+log4j.category.br.com.nex2me.mobme.network.road.model.RoadGraphAdapter=INFO
+log4j.category.br.com.nex2me.mobme.core.model.GraphAdapter=INFO
+log4j.category.com.thinkaurelius.titan=ERROR
+log4j.category.org.apache.cassandra=ERROR
+
+log4j.category.org.graphast.importer.OSMDBImporter=ERROR
\ No newline at end of file
diff --git a/core/src/main/resources/piecewise.sql b/core/src/main/resources/piecewise.sql
new file mode 100644
index 0000000..abf1a20
--- /dev/null
+++ b/core/src/main/resources/piecewise.sql
@@ -0,0 +1,15 @@
+-- Table: public.tester
+
+-- DROP TABLE public.tester;
+
+CREATE TABLE public.piecewise
+(
+ edgeId double precision,
+ timeDay double precision,
+ totalTime double precision
+)
+WITH (
+ OIDS=FALSE
+);
+ALTER TABLE public.tester
+ OWNER TO postgres;
\ No newline at end of file
diff --git a/core/src/test/java/org/graphast/graphgenerator/GraphGenerator.java b/core/src/test/java/org/graphast/graphgenerator/GraphGenerator.java
index 92e57b5..0c76773 100644
--- a/core/src/test/java/org/graphast/graphgenerator/GraphGenerator.java
+++ b/core/src/test/java/org/graphast/graphgenerator/GraphGenerator.java
@@ -1,5 +1,6 @@
package org.graphast.graphgenerator;
+import java.io.File;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
@@ -572,5 +573,512 @@ public Graph generateAndorra() {
return graph;
}
+
+public GraphBounds generateExampleTAXI() {
+
+ GraphBounds graph = new GraphImpl(Configuration.USER_HOME + "/graphast/test/examplePoI");
+
+ Node node;
+ Edge edge;
+
+ node = new NodeImpl(0l, 0.0d, 1.0d);
+ graph.addNode(node);
+
+ node = new NodeImpl(1l, 0.0d, 10.0d);
+ int[] costs = new int[]{0};
+ node.setCategory(1);
+ node.setLabel("TAXI I");
+ node.setCosts(costs);
+ graph.addNode(node);
+
+ node = new NodeImpl(2l, 0.0d, 20.0d);
+ graph.addNode(node);
+
+ node = new NodeImpl(3l, 0.0d, 30.0d);
+ graph.addNode(node);
+
+ node = new NodeImpl(4l, 0.0d, 40.0d);
+ costs = new int[]{0};
+ node.setCategory(2);
+ node.setLabel("TAXI II");
+ node.setCosts(costs);
+ graph.addNode(node);
+
+ node = new NodeImpl(5l, 10.0d, 0.0d);
+ graph.addNode(node);
+
+ node = new NodeImpl(6l, 10.0d, 10.0d);
+ graph.addNode(node);
+
+ node = new NodeImpl(7l, 10.0d, 20.0d);
+ graph.addNode(node);
+
+ node = new NodeImpl(8l, 10.0d, 30.0d);
+ graph.addNode(node);
+
+ node = new NodeImpl(9l, 10.0d, 40.0d);
+ costs = new int[]{0};
+ node.setCategory(3);
+ node.setLabel("TAXI III");
+ node.setCosts(costs);
+ graph.addNode(node);
+
+ //EDGES
+
+ edge = new EdgeImpl(1l, 0l, 1l, 15);
+ int[] costsEdge1 = new int[]{900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 1200000,
+ 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000, 900000, 900000,
+ 900000, 900000, 900000};
+ edge.setCosts(costsEdge1);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(2l, 1l, 2l, 15);
+ int[] costsEdge2 = new int[]{900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000};
+ edge.setCosts(costsEdge2);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(3l, 1l, 7l, 12);
+ int[] costsEdge3 = new int[]{720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000, 720000,
+ 720000, 720000, 720000};
+ edge.setCosts(costsEdge3);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(4l, 2l, 3l, 10);
+ int[] costsEdge4 = new int[]{600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000};
+ edge.setCosts(costsEdge4);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(5l, 3l, 4l, 12);
+ int[] costsEdge5 = new int[]{720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000,
+ 720000, 720000, 720000, 720000};
+ edge.setCosts(costsEdge5);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(6l, 4l, 8l, 12);
+ int[] costsEdge6 = new int[]{720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000};
+ edge.setCosts(costsEdge6);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(7l, 4l, 9l, 12);
+ int[] costsEdge7 = new int[]{720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1500000, 1500000, 1500000, 1500000, 600000, 600000,
+ 600000, 600000, 600000};
+ edge.setCosts(costsEdge7);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(8l, 5l, 0l, 12);
+ int[] costsEdge8 = new int[]{720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 1080000, 1080000, 1080000, 600000, 600000, 600000, 1080000, 1080000, 1080000,
+ 1080000, 600000, 600000, 600000, 600000, 600000};
+ edge.setCosts(costsEdge8);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(9l, 6l, 5l, 15);
+ int[] costsEdge9 = new int[]{900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 1200000, 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000,
+ 900000, 900000, 900000, 900000, 900000};
+ edge.setCosts(costsEdge9);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(10l, 7l, 2l, 15);
+ int[] costsEdge10 = new int[]{900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000};
+ edge.setCosts(costsEdge10);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(11l, 7l, 6l, 12);
+ int[] costsEdge11 = new int[]{720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1080000, 1080000, 1080000, 1080000, 600000, 600000,
+ 600000, 600000, 600000};
+ edge.setCosts(costsEdge11);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(12l, 8l, 7l, 12);
+ int[] costsEdge12 = new int[]{720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000, 720000,
+ 720000, 720000, 720000};
+ edge.setCosts(costsEdge12);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(13l, 9l, 8l, 15);
+ int[] costsEdge13 = new int[]{900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000};
+ edge.setCosts(costsEdge13);
+ graph.addEdge(edge);
+
+ graph.createBounds();
+
+ return graph;
+ }
+
+ public GraphBounds generateExampleTaxi15to15minutes() {
+
+ String separator = File.separator;
+ final String directory = Configuration.USER_HOME + separator +
+ "graphast" + separator + "test" +separator + "exampleTaxi";
+
+ GraphBounds graph = new GraphImpl(directory);
+
+ graph.addNode(new NodeImpl(0l, 0.0d, 1.0d));
+
+ Node nodeCategory1 = new NodeImpl(1l, 0.0d, 10.0d);
+ int[] costs = new int[]{0};
+ nodeCategory1.setCategory(1);
+ nodeCategory1.setLabel("TAXI I");
+ nodeCategory1.setCosts(costs);
+ graph.addNode(nodeCategory1);
+
+ graph.addNode(new NodeImpl(2l, 0.0d, 20.0d));
+ graph.addNode(new NodeImpl(3l, 0.0d, 30.0d));
+
+ Node nodeCategory2 = new NodeImpl(4l, 0.0d, 40.0d);
+ costs = new int[]{0};
+ nodeCategory2.setCategory(2);
+ nodeCategory2.setLabel("TAXI II");
+ nodeCategory2.setCosts(costs);
+ graph.addNode(nodeCategory2);
+
+ graph.addNode(new NodeImpl(5l, 10.0d, 0.0d));
+ graph.addNode(new NodeImpl(6l, 10.0d, 10.0d));
+ graph.addNode(new NodeImpl(7l, 10.0d, 20.0d));
+ graph.addNode(new NodeImpl(8l, 10.0d, 30.0d));
+
+ Node nodeCategory3 = new NodeImpl(9l, 10.0d, 40.0d);
+ costs = new int[]{0};
+ nodeCategory3.setCategory(3);
+ nodeCategory3.setLabel("TAXI III");
+ nodeCategory3.setCosts(costs);
+ graph.addNode(nodeCategory3);
+
+ //Edges com custo de 15 em 15 minutos
+
+ Edge edge = new EdgeImpl(1l, 0l, 1l, 15);
+ int[] costsEdge1 = new int[]{900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 1200000,
+ 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 1200000,
+ 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000, 900000, 900000,
+ 900000, 900000, 900000,900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 1200000,
+ 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 1200000,
+ 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 1200000,
+ 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 1200000,
+ 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000, 900000, 900000,
+ 900000, 900000, 900000,900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 1200000,
+ 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 1200000,
+ 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000, 900000, 900000,
+ 900000, 900000, 900000};
+ edge.setCosts(costsEdge1);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(2l, 1l, 2l, 15);
+ int[] costsEdge2 = new int[]{900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000};
+ edge.setCosts(costsEdge2);
+ graph.addEdge(edge);
+
+ Edge edge1to7 = new EdgeImpl(3l, 1l, 7l, 12);
+ int[] costsEdge1To7 = new int[]{960000, 960000, 300000, 300000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 300000, 300000, 1800000, 720000, 720000,
+ 720000, 720000, 720000};
+ edge1to7.setCosts(costsEdge1To7);
+ graph.addEdge(edge1to7);
+
+ Edge edge7to1 = new EdgeImpl(3l, 7l, 1l, 12);
+ int[] costsEdge7to1 = new int[]{600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000};
+ edge7to1.setCosts(costsEdge7to1);
+ graph.addEdge(edge7to1);
+
+ edge = new EdgeImpl(4l, 2l, 3l, 10);
+ int[] costsEdge4 = new int[]{600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000};
+ edge.setCosts(costsEdge4);
+ graph.addEdge(edge);
+ edge = new EdgeImpl(5l, 3l, 4l, 12);
+ int[] costsEdge5 = new int[]{720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000,
+ 720000, 720000, 720000, 720000};
+ edge.setCosts(costsEdge5);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(6l, 4l, 8l, 12);
+ int[] costsEdge6 = new int[]{720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000,
+ 720000, 720000, 720000};
+ edge.setCosts(costsEdge6);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(7l, 4l, 9l, 12);
+ int[] costsEdge7 = new int[]{720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1500000, 1500000, 1500000, 1500000, 600000, 600000,
+ 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1500000, 1500000, 1500000, 1500000, 600000, 600000,
+ 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1500000, 1500000, 1500000, 1500000, 600000, 600000,
+ 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1500000, 1500000, 1500000, 1500000, 600000, 600000,
+ 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1500000, 1500000, 1500000, 1500000, 600000, 600000,
+ 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1500000, 1500000, 1500000, 1500000, 600000, 600000,
+ 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1500000, 1500000, 1500000, 1500000, 600000, 600000,
+ 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1500000, 1500000, 1500000, 1500000, 600000, 600000,
+ 600000, 600000, 600000};
+ edge.setCosts(costsEdge7);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(8l, 5l, 0l, 12);
+ int[] costsEdge8 = new int[]{720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 1080000, 1080000, 1080000, 600000, 600000, 600000, 1080000, 1080000, 1080000,
+ 1080000, 600000, 600000, 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 1080000, 1080000, 1080000, 600000, 600000, 600000, 1080000, 1080000, 1080000,
+ 1080000, 600000, 600000, 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 1080000, 1080000, 1080000, 600000, 600000, 600000, 1080000, 1080000, 1080000,
+ 1080000, 600000, 600000, 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 1080000, 1080000, 1080000, 600000, 600000, 600000, 1080000, 1080000, 1080000,
+ 1080000, 600000, 600000, 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 1080000, 1080000, 1080000, 600000, 600000, 600000, 1080000, 1080000, 1080000,
+ 1080000, 600000, 600000, 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 1080000, 1080000, 1080000, 600000, 600000, 600000, 1080000, 1080000, 1080000,
+ 1080000, 600000, 600000, 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 1080000, 1080000, 1080000, 600000, 600000, 600000, 1080000, 1080000, 1080000,
+ 1080000, 600000, 600000, 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 1080000, 1080000, 1080000, 600000, 600000, 600000, 1080000, 1080000, 1080000,
+ 1080000, 600000, 600000, 600000, 600000, 600000};
+ edge.setCosts(costsEdge8);
+ graph.addEdge(edge);
+
+ Edge edge6to5 = new EdgeImpl(9l, 6l, 5l, 15);
+ int[] costsEdge6to5 = new int[]{900000, 900000, 960000, 960000, 900000, 900000, 900000, 900000, 900000,
+ 1200000, 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 1200000, 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 1200000, 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 1200000, 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 1200000, 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 1200000, 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 1200000, 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 1200000, 1200000, 1200000, 900000, 900000, 900000, 1500000, 1500000, 1500000, 1500000,
+ 900000, 900000, 900000, 900000, 900000};
+ edge6to5.setCosts(costsEdge6to5);
+ graph.addEdge(edge6to5);
+
+ Edge edge5to6 = new EdgeImpl(9l, 5l, 6l, 15);
+ int[] costsEdge5to6 = new int[]{600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 600000,
+ 600000, 600000, 600000};
+ edge5to6.setCosts(costsEdge5to6);
+ graph.addEdge(edge5to6);
+
+ edge = new EdgeImpl(10l, 7l, 2l, 15);
+ int[] costsEdge10 = new int[]{900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000};
+ edge.setCosts(costsEdge10);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(11l, 7l, 6l, 12);
+ int[] costsEdge11 = new int[]{720000, 720000, 480000, 480000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1080000, 1080000, 1080000, 1080000, 600000, 600000,
+ 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1080000, 1080000, 1080000, 1080000, 600000, 600000,
+ 600000, 600000, 600000, 780000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1080000, 1080000, 1080000, 1080000, 600000, 600000,
+ 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1080000, 1080000, 1080000, 1080000, 600000, 600000,
+ 600000, 600000, 600000, 780000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1080000, 1080000, 1080000, 1080000, 600000, 600000,
+ 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1080000, 1080000, 1080000, 1080000, 600000, 600000,
+ 600000, 600000, 600000, 780000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1080000, 1080000, 1080000, 1080000, 600000, 600000,
+ 600000, 600000, 600000, 720000, 720000, 600000, 600000, 600000, 600000, 600000, 600000, 600000, 1080000,
+ 1080000, 1080000, 600000, 600000, 600000, 1080000, 120000, 120000, 1080000, 600000, 600000,
+ 600000, 600000, 600000};
+ edge.setCosts(costsEdge11);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(12l, 8l, 7l, 12);
+ int[] costsEdge12 = new int[]{720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000, 720000,
+ 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 720000, 1320000,
+ 1320000, 1320000, 720000, 720000, 720000, 1800000, 1800000, 1800000, 1800000, 720000, 720000,
+ 720000, 720000, 720000};
+ edge.setCosts(costsEdge12);
+ graph.addEdge(edge);
+
+ edge = new EdgeImpl(13l, 9l, 8l, 15);
+ int[] costsEdge13 = new int[]{900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000, 900000,
+ 900000, 900000, 900000, 900000, 900000, 900000};
+ edge.setCosts(costsEdge13);
+ graph.addEdge(edge);
+
+ graph.createBounds();
+
+ return graph;
+ }
}
\ No newline at end of file
diff --git a/core/src/test/java/org/graphast/graphgenerator/GraphGeneratorGridTest.java b/core/src/test/java/org/graphast/graphgenerator/GraphGeneratorGridTest.java
new file mode 100644
index 0000000..6632a6f
--- /dev/null
+++ b/core/src/test/java/org/graphast/graphgenerator/GraphGeneratorGridTest.java
@@ -0,0 +1,216 @@
+package org.graphast.graphgenerator;
+
+import org.graphast.config.Configuration;
+import org.graphast.model.GraphBounds;
+import org.junit.Assert;
+import org.junit.Ignore;
+import org.junit.Test;
+
+public class GraphGeneratorGridTest {
+
+ private String PATH_GRAPH = Configuration.USER_HOME + "/graphast/test/example";
+
+ @Test
+ public void gererateGraphSynthetic2x2() {
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, 2,2,0);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ Assert.assertEquals(4, graph.getNumberOfNodes());
+ Assert.assertEquals(8, graph.getNumberOfEdges());
+ Assert.assertNotNull(graph.getEdgeCost(graph.getEdge(0), 0));
+ }
+
+ @Test
+ public void gererateGraphSynthetic4x4() {
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, 4,4, 0);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ Assert.assertEquals(16, graph.getNumberOfNodes());
+ Assert.assertEquals(48, graph.getNumberOfEdges());
+ Assert.assertNotNull(graph.getEdgeCost(graph.getEdge(0), 0));
+ }
+
+ @Test
+ public void gererateGraphSynthetic5x5() {
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, 5,5, 0);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ Assert.assertEquals(graph.getNumberOfNodes(), 25);
+ Assert.assertEquals(graph.getNumberOfEdges(), 80);
+ }
+
+ @Test
+ public void gererateGraphSynthetic100x100() {
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, 100,100, 0);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ Assert.assertEquals(graph.getNumberOfNodes(), 10000);
+ Assert.assertEquals(graph.getNumberOfEdges(), 39600);
+ }
+
+ @Ignore
+ @Test
+ public void gererateGraphSyntheticLimit() {
+
+ int comprimento = 992;
+ int altura = 992;
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, comprimento,altura, 0);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ Assert.assertEquals(graph.getNumberOfNodes(), comprimento*altura);
+ Assert.assertEquals(graph.getNumberOfEdges(), 2*altura*(2*(comprimento-1)));
+ }
+
+ @Ignore
+ @Test
+ public void gererateGraphSyntheticLimitWithPoi() {
+
+ int comprimento = 992;
+ int altura = 992;
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, comprimento,altura, 1);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ Assert.assertEquals(graph.getNumberOfNodes(), comprimento*altura);
+ Assert.assertEquals(graph.getNumberOfEdges(), 2*altura*(2*(comprimento-1)));
+ Assert.assertEquals(graph.getCategories().size(), 9840);
+ }
+
+ @Test
+ @Ignore
+ public void gererateGraphSyntheticDifferentSize() {
+
+ int comprimento = 3;
+ int altura = 2;
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, comprimento,altura, 0);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ Assert.assertEquals(graph.getNumberOfNodes(), comprimento*altura);
+ Assert.assertEquals(graph.getNumberOfEdges(), 2*altura*(2*(comprimento-1)));
+ }
+
+ @Test
+ public void gererateGraphSyntheticWithPoiShort() {
+
+ int comprimento = 4;
+ int altura = 4;
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, comprimento, altura, 1);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ Assert.assertEquals(graph.getCategories().size(), 1);
+ }
+
+ @Test
+ public void gererateGraphSyntheticWithPoi() {
+
+ int comprimento = 10;
+ int altura = 10;
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, comprimento, altura, 2);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ Assert.assertEquals(graph.getCategories().size(), 2);
+ }
+
+ @Test
+ public void gererateGraphSyntheticMin() {
+
+ int comprimento = 1;
+ int altura = 1;
+ int percentagemPoi = 1;
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, comprimento, altura, percentagemPoi);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ Assert.assertEquals(graph.getCategories().size(), 1);
+ }
+
+ // grafos para o teste do algoritmo =============
+
+ // 1k (1024 pontos)
+ @Test
+ public void gererateGraphSyntheticLimitWithPoi1k() {
+
+ int comprimento = 32;
+ int altura = 32;
+ int qtdPoi = 10;
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, comprimento,altura, 1);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ Assert.assertEquals(graph.getNumberOfNodes(), comprimento*altura);
+ Assert.assertEquals(graph.getNumberOfEdges(), 2*altura*(2*(comprimento-1)));
+ Assert.assertEquals(graph.getCategories().size(), qtdPoi);
+ }
+
+ // 10k (10000 pontos)
+ @Test
+ public void gererateGraphSyntheticLimitWithPoi10k() {
+
+ int comprimento = 100;
+ int altura = 100;
+ int qtdPoi = 100;
+ int percentualPoi = 1;
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, comprimento,altura, percentualPoi);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ Assert.assertEquals(comprimento*altura, graph.getNumberOfNodes());
+ Assert.assertEquals(2*altura*(2*(comprimento-1)), graph.getNumberOfEdges());
+ Assert.assertEquals(qtdPoi, graph.getCategories().size());
+ }
+
+ // 100k (99856 pontos)
+ @Test
+ public void gererateGraphSyntheticLimitWithPoi100k() {
+
+ int comprimento = 316;
+ int altura = 316;
+ int qtdPoi = 998;
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, comprimento,altura, 1);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ Assert.assertEquals(graph.getNumberOfNodes(), comprimento*altura);
+ Assert.assertEquals(graph.getNumberOfEdges(), 2*altura*(2*(comprimento-1)));
+ Assert.assertEquals(graph.getCategories().size(), qtdPoi);
+ }
+
+ // 1G (1000000 pontos)
+ @Test
+ public void gererateGraphSyntheticLimitWithPoi1000k() {
+
+ int comprimento = 1000;
+ int altura = 1000;
+ int qtdPoi = 10000;
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, comprimento,altura, 1);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ Assert.assertEquals(graph.getNumberOfNodes(), comprimento*altura);
+ Assert.assertEquals(graph.getNumberOfEdges(), 2*altura*(2*(comprimento-1)));
+ Assert.assertEquals(graph.getCategories().size(), qtdPoi);
+ }
+
+}
diff --git a/core/src/test/java/org/graphast/graphgenerator/GraphGeneratorGridTester.java b/core/src/test/java/org/graphast/graphgenerator/GraphGeneratorGridTester.java
new file mode 100644
index 0000000..a7070f3
--- /dev/null
+++ b/core/src/test/java/org/graphast/graphgenerator/GraphGeneratorGridTester.java
@@ -0,0 +1,135 @@
+package org.graphast.graphgenerator;
+
+import java.math.BigDecimal;
+import java.math.RoundingMode;
+import java.util.HashSet;
+import java.util.Random;
+import java.util.Set;
+
+import org.graphast.importer.CostGenerator;
+import org.graphast.model.Edge;
+import org.graphast.model.EdgeImpl;
+import org.graphast.model.GraphBounds;
+import org.graphast.model.GraphImpl;
+import org.graphast.model.Node;
+import org.graphast.model.NodeImpl;
+
+public class GraphGeneratorGridTester {
+
+ private int width;
+ private int length;
+ private GraphBounds graph;
+ private double percentagemPoi;
+ private BigDecimal distance_largura;
+ private BigDecimal distance_altura;
+
+ public GraphGeneratorGridTester(String pathGraph, int width, int length, double percentualPoi) {
+ this.width = width;
+ this.length = length;
+ this.percentagemPoi = percentualPoi;
+ this.graph = new GraphImpl(pathGraph);
+
+ }
+
+ public GraphGeneratorGridTester(String pathGraph, int size, double percentualPoi) {
+ this(pathGraph, size, size, percentualPoi);
+ }
+
+ public void generateGraph() {
+ plotNodes();
+ plotEdges();
+ graph.createBounds();
+ }
+
+ private void plotNodes() {
+
+ BigDecimal interador_largura = BigDecimal.valueOf(180).divide(BigDecimal.valueOf(width), 8, RoundingMode.HALF_UP);
+ BigDecimal interador_altura = BigDecimal.valueOf(180).divide(BigDecimal.valueOf(length), 8, RoundingMode.HALF_UP);
+ this.distance_largura = interador_largura;
+ this.distance_altura = interador_altura;
+
+ Set listaIdsPoi = getListIdsPois();
+
+ Integer category = 0;
+ for (int i = 0; i < width; i++) {
+ BigDecimal latitude = interador_altura.multiply(BigDecimal.valueOf(i)).add(BigDecimal.valueOf(-90));
+ for (int j = 0; j < length; j++) {
+ BigDecimal longitude = interador_largura.multiply(BigDecimal.valueOf(j)).add(BigDecimal.valueOf(-90));;
+ Node node = new NodeImpl(Long.valueOf(category), latitude.doubleValue(), longitude.doubleValue());
+ if(listaIdsPoi.contains(category)) {
+ int[] costs = new int[]{0};
+ node.setCategory(category);
+ node.setLabel("CATEGORY "+category);
+ node.setCosts(costs);
+ listaIdsPoi.remove(category);
+ }
+ graph.addNode(node);
+ category++;
+ }
+ }
+ }
+
+ private Set getListIdsPois() {
+
+ int quantidadeVerticesPoi = BigDecimal.valueOf(width).multiply(BigDecimal.valueOf(length)).multiply(BigDecimal.valueOf(percentagemPoi)).divide(BigDecimal.valueOf(100.0f), 8, RoundingMode.UP).intValue();
+
+ Set listIdPoi = new HashSet<>();
+ do {
+ int rangeMax = width*length - 1;
+ Double idRandom = generatePdseurandom(0, rangeMax);
+ listIdPoi.add(idRandom.intValue());
+ } while(listIdPoi.size() accessNeighborhood = graph.accessNeighborhood(node, 0);
+ int size = accessNeighborhood.size();
+ //System.out.println(String.format("the node %s contens %s neighbors", i, size));
+ System.out.println(String.format("%s,%s", i, size));
+
+ }
+ }
+
+ @Test
+ public void costEdgeTest() {
+ OSMDBImporter importer = new OSMDBImporter("view_exp_1k", PATH_GRAPH);
+ GraphBounds graphBounds = importer.execute();
+
+ for (int i = 0; i < graphBounds.getNumberOfEdges() - 1; i++) {
+ Edge edge = graphBounds.getEdge(i);
+ Assert.assertEquals(96, edge.getCosts().length);
+ }
+ }
+
+ @Test
+ public void createGraphTest10k() {
+
+ OSMDBImporter importer = new OSMDBImporter("view_exp_10k", PATH_GRAPH);
+ GraphBounds graph = importer.execute();
+ Assert.assertNotNull(graph);
+ Assert.assertEquals(73, graph.getCategories().size()); //77
+ Assert.assertEquals(6870, graph.getNumberOfNodes()); //6947
+ Assert.assertEquals(8334, graph.getNumberOfEdges()); //
+
+ for (int i = 0; i < graph.getNumberOfNodes(); i++) {
+ Node node = graph.getNode(i);
+ HashMap accessNeighborhood = graph.accessNeighborhood(node, 0);
+ int size = accessNeighborhood.size();
+ //System.out.println(String.format("the node %s contens %s neighbors", i, size));
+ System.out.println(String.format("%s,%s", i, size));
+
+ }
+ }
+
+ @Test
+ public void createGraphTest100k() {
+ OSMDBImporter importer = new OSMDBImporter("view_exp_100k", PATH_GRAPH);
+ GraphBounds graph = importer.execute();
+ Assert.assertNotNull(graph);
+ Assert.assertEquals(379, graph.getCategories().size());//379
+ Assert.assertEquals(75489, graph.getNumberOfNodes()); //75919
+ Assert.assertEquals(98223, graph.getNumberOfEdges()); //98653
+
+ for (int i = 0; i < graph.getNumberOfNodes(); i++) {
+ Node node = graph.getNode(i);
+ HashMap accessNeighborhood = graph.accessNeighborhood(node, 0);
+ int size = accessNeighborhood.size();
+ System.out.println(String.format("%s,%s", i, size));
+
+ }
+ }
+
+ @Test
+ public void createGraphTest50k() {
+ OSMDBImporter importer = new OSMDBImporter("view_exp_50k", PATH_GRAPH);
+ GraphBounds graph = importer.execute();
+ Assert.assertNotNull(graph);
+ Assert.assertEquals(328, graph.getCategories().size()); // 425
+ Assert.assertEquals(33595, graph.getNumberOfNodes()); // 236216
+ Assert.assertEquals(42385, graph.getNumberOfEdges());
+
+ for (int i = 0; i < graph.getNumberOfNodes(); i++) {
+ Node node = graph.getNode(i);
+ HashMap accessNeighborhood = graph.accessNeighborhood(node, 0);
+ int size = accessNeighborhood.size();
+ System.out.println(String.format("%s,%s", i, size));
+
+ }
+ }
+
+ @Test
+ public void createGraphTest300k() {
+ OSMDBImporter importer = new OSMDBImporter("view_exp_300mil", PATH_GRAPH);
+ GraphBounds graph = importer.execute();
+ Assert.assertNotNull(graph);
+ Assert.assertEquals(425, graph.getCategories().size());
+ Assert.assertEquals(236216, graph.getNumberOfNodes());
+ Assert.assertEquals(275720, graph.getNumberOfEdges());
+ }
+}
diff --git a/core/src/test/java/org/graphast/importer/PoiTaxiFortalezaImporterTest.java b/core/src/test/java/org/graphast/importer/PoiTaxiFortalezaImporterTest.java
new file mode 100644
index 0000000..577964a
--- /dev/null
+++ b/core/src/test/java/org/graphast/importer/PoiTaxiFortalezaImporterTest.java
@@ -0,0 +1,26 @@
+package org.graphast.importer;
+
+import org.graphast.config.Configuration;
+import org.graphast.model.GraphBounds;
+import org.junit.Assert;
+import org.junit.Test;
+
+public class PoiTaxiFortalezaImporterTest {
+ private static final String PATH_GRAPH = Configuration.USER_HOME + "/graphast/test/example";
+
+ @Test
+ public void createGraphWithPoiTaxiTest() {
+
+ OSMDBImporter importer = new OSMDBImporter("view_exp_1k", PATH_GRAPH);
+ GraphBounds graph = importer.execute();
+
+ PoiTaxiFortalezaImporter importerWithPoi = new PoiTaxiFortalezaImporter(graph);
+ GraphBounds graphWithPoi = importerWithPoi.getGraph();
+
+ Assert.assertNotNull(graphWithPoi);
+ Assert.assertEquals(809, graph.getNumberOfNodes());
+ Assert.assertEquals(844, graph.getNumberOfEdges());
+ Assert.assertEquals(15, graph.getCategories().size());
+
+ }
+}
diff --git a/core/src/test/java/org/graphast/knn/RNNBreadthFirstSearchTest.java b/core/src/test/java/org/graphast/knn/RNNBreadthFirstSearchTest.java
new file mode 100644
index 0000000..5ca41f4
--- /dev/null
+++ b/core/src/test/java/org/graphast/knn/RNNBreadthFirstSearchTest.java
@@ -0,0 +1,330 @@
+package org.graphast.knn;
+
+import static org.junit.Assert.assertEquals;
+
+import java.io.IOException;
+import java.text.ParseException;
+import java.util.ArrayList;
+import java.util.Date;
+
+import org.graphast.config.Configuration;
+import org.graphast.exception.PathNotFoundException;
+import org.graphast.graphgenerator.GraphGenerator;
+import org.graphast.graphgenerator.GraphGeneratorGridTester;
+import org.graphast.model.GraphBounds;
+import org.graphast.query.knn.NearestNeighbor;
+import org.graphast.query.rnn.RNNBreadthFirstSearch;
+import org.graphast.util.DateUtils;
+import org.graphast.util.FileUtils;
+import org.junit.AfterClass;
+import org.junit.Assert;
+import org.junit.Test;
+
+public class RNNBreadthFirstSearchTest {
+
+ private static GraphBounds graphBounds;
+ private static GraphBounds graphBoundsReverse;
+
+ private Integer idCustomer;
+ private Date maxTravelTime;
+ private Date hourServiceTime;
+ private String PATH_GRAPH = Configuration.USER_HOME + "/graphast/test/example";
+
+ public void setUpNoRandomGraph() throws ParseException, IOException {
+
+ // Tempo para atendiemento
+ maxTravelTime = DateUtils.parseDate(23, 59, 59);
+
+ // Hora que ele realiza a chamada do serviço meia-noite e vinte minutos
+ hourServiceTime = DateUtils.parseDate(00, 00, 00);
+
+ graphBounds = new GraphGenerator().generateExampleTAXI();
+// graphBoundsReverse = new GraphGenerator().generateExampleTAXI();
+// graphBoundsReverse.reverseGraph();
+ }
+
+ public void setUpRandomGraph(int qtdX, int qtdY, int percentPois) throws ParseException {
+
+ // Tempo para atendiemento
+ maxTravelTime = DateUtils.parseDate(23, 59, 59);
+
+ // Hora que ele realiza a chamada do serviço meia-noite e vinte minutos
+ hourServiceTime = DateUtils.parseDate(00, 00, 00);
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, qtdX, qtdY, percentPois);
+ graphSynthetic.generateGraph();
+
+ graphBoundsReverse = graphSynthetic.getGraph();
+ graphBounds = graphBoundsReverse;
+ graphBoundsReverse.reverseGraph();
+ }
+
+ // TESTE 1: (EXCEPTION) Verificamos se o cliente que chama o táxi está no mesmo ponto
+ // de um determinado taxita.
+ @Test
+ public void taxiSearchExpected_I() throws ParseException, IOException {
+
+ setUpNoRandomGraph();
+
+ // Cliente que realiza a chamada do serviço
+ idCustomer = Integer.valueOf(4);
+
+ RNNBreadthFirstSearch taxiSearch = new RNNBreadthFirstSearch(graphBounds);
+ NearestNeighbor nearestNeighbor = taxiSearch.search(graphBounds.getNode(idCustomer), maxTravelTime, hourServiceTime);
+
+ Assert.assertNotNull(nearestNeighbor);
+ assertEquals("Deve retornar o vid esperado.", 4, nearestNeighbor.getId());
+ assertEquals("Deve retornar o custo esperado.", 0, nearestNeighbor.getDistance()/1000/60);
+
+ ArrayList path = new ArrayList<>();
+ path.add(4l);
+ assertEquals("Deve retornar o caminho esperado.", path.get(0), nearestNeighbor.getPath().get(0));
+ }
+
+ // TESTE 1.1: (EXCEPTION) Nenhum taxista é encontrado na malha, para a quantidade de tempo
+ // superior necessario para atendimento (11 minutos e 59 segundos)
+ @Test(expected = PathNotFoundException.class)
+ public void taxiSearchExpected_II() throws ParseException, IOException {
+
+ setUpNoRandomGraph();
+
+ // Cliente que realiza a chamada do serviço
+ idCustomer = Integer.valueOf(8);
+
+ // Tempo para atendiemento
+ maxTravelTime = DateUtils.parseDate(0, 11, 59);
+
+ RNNBreadthFirstSearch taxiSearch = new RNNBreadthFirstSearch(graphBounds);
+ taxiSearch.search(graphBounds.getNode(idCustomer), maxTravelTime, hourServiceTime);
+ }
+
+ // TESTE 2: O cliente está em um vértice vizinho ao taxista. CLIENTE -> TAXISTA (NÃO REVERSO)
+ @Test
+ public void taxiSearchNeighbor() throws IOException, ParseException {
+
+ setUpNoRandomGraph();
+
+ // Cliente que realiza a chamada do serviço
+ idCustomer = Integer.valueOf(7);
+
+ RNNBreadthFirstSearch taxiSearch = new RNNBreadthFirstSearch(graphBounds);
+ NearestNeighbor nearestNeighbor = taxiSearch.search(graphBounds.getNode(idCustomer), maxTravelTime, hourServiceTime);
+
+ ArrayList path_result = new ArrayList<>();
+ path_result.add(4l);
+ path_result.add(3l);
+ path_result.add(2l);
+ path_result.add(7l);
+
+ assertEquals("Deve retornar o vid esperado.", 4l, nearestNeighbor.getId());
+ assertEquals("Deve retornar o custo esperado.", 37, nearestNeighbor.getDistance()/1000/60);
+ assertEquals("Deve retornar o caminho esperado.", path_result , nearestNeighbor.getPath());
+ }
+
+ // TESTE 2.1: O cliente está em um vértice vizinho ao taxista. CLIENTE -> TAXISTA (REVERSO)
+ @Test
+ public void taxiSearchNeighborReverso() throws IOException, ParseException {
+
+ setUpNoRandomGraph();
+
+ // Cliente que realiza a chamada do serviço
+ idCustomer = Integer.valueOf(7);
+
+ RNNBreadthFirstSearch taxiSearch = new RNNBreadthFirstSearch(graphBoundsReverse);
+ NearestNeighbor nearestNeighbor = taxiSearch.search(graphBounds.getNode(idCustomer), maxTravelTime, hourServiceTime);
+
+ ArrayList path_result = new ArrayList<>();
+ path_result.add(1l);
+ path_result.add(7l);
+
+ assertEquals("Deve retornar o vid esperado.", 1l, nearestNeighbor.getId());
+ assertEquals("Deve retornar o custo esperado.", 12, nearestNeighbor.getDistance()/1000/60);
+ assertEquals("Deve retornar o caminho esperado.", path_result , nearestNeighbor.getPath());
+ }
+
+ // Tem três taxista na malha, custumer = 5, cab 1 = 1, cab 2 = 4 e cab 3 = 9
+ @Test
+ public void returnBetterSolution() throws IOException, ParseException {
+
+ //Cliente que realiza a chamada do serviço
+ Integer idCustomer = Integer.valueOf(5);
+
+ //Tempo para atendiemento - 39 minutos
+ Date serviceTime = DateUtils.parseDate(0, 39, 0);
+
+ //Hora que ele realiza a chamada do serviço - meia-noite e vinte segundos
+ Date hourServiceTime = DateUtils.parseDate(00, 00, 00);
+
+ graphBounds = new GraphGenerator().generateExampleTAXI();
+ graphBoundsReverse = new GraphGenerator().generateExampleTAXI();
+ graphBoundsReverse.reverseGraph();
+
+
+ RNNBreadthFirstSearch taxiSearch = new RNNBreadthFirstSearch(graphBoundsReverse);
+ NearestNeighbor nearestNeighbor = taxiSearch.search(graphBoundsReverse.getNode(idCustomer), serviceTime, hourServiceTime);
+
+ Assert.assertNotNull(nearestNeighbor);
+
+ ArrayList path_result = new ArrayList<>();
+ path_result.add(1l);
+ path_result.add(7l);
+ path_result.add(6l);
+ path_result.add(5l);
+
+ assertEquals("Deve retornar o vid esperado.", 1l, nearestNeighbor.getId());
+ assertEquals("Deve retornar o custo esperado.", 39, nearestNeighbor.getDistance()/1000/60);
+ assertEquals("Deve retornar o caminho esperado.", path_result , nearestNeighbor.getPath());
+ }
+
+
+ // TESTE 3: O cliente está em um vértice vizinho a dois taxistas. Mas com
+ // pesos das aresta para chegar ao cliente diferente. Cliente:8; Taxista 1: 4, 12 minutos; Taxista 1: 9, 15 minutos.
+ @Test
+ public void taxiSearchNeighborWithDifferentWeight() throws IOException, ParseException {
+
+ setUpNoRandomGraph();
+
+ // Cliente que realiza a chamada do serviço
+ idCustomer = Integer.valueOf(8);
+
+ RNNBreadthFirstSearch taxiSearch = new RNNBreadthFirstSearch(graphBoundsReverse);
+ NearestNeighbor nearestNeighbor = taxiSearch.search(graphBoundsReverse.getNode(idCustomer), maxTravelTime, hourServiceTime);
+
+ ArrayList path_result = new ArrayList<>();
+ path_result.add(4l);
+ path_result.add(8l);
+
+ assertEquals("Deve retornar o vid esperado.", 4l, nearestNeighbor.getId());
+ assertEquals("Deve retornar o custo esperado.", 12, nearestNeighbor.getDistance()/1000/60);
+ assertEquals("Deve retornar o caminho esperado.", path_result , nearestNeighbor.getPath());
+ }
+
+ // TESTE 4: O cliente está em um vértice vizinho a dois taxistas. Mas com
+ // pesos das arestas para chegar ao cliente iguais
+ @Test
+ public void taxiSearchNeighborWithEqualsWeight() throws IOException, ParseException {
+
+ setUpNoRandomGraph();
+
+ // Cliente que realiza a chamada do serviço
+ idCustomer = Integer.valueOf(8);
+
+ RNNBreadthFirstSearch taxiSearch = new RNNBreadthFirstSearch(graphBoundsReverse);
+ NearestNeighbor nearestNeighbor = taxiSearch.search(graphBoundsReverse.getNode(idCustomer), maxTravelTime, hourServiceTime);
+
+ ArrayList path_result = new ArrayList<>();
+ path_result.add(4l);
+ path_result.add(8l);
+
+ //Retorna o que possui o menor tempo para a travessia, a Queue realiza o compare para a ordenação.
+ assertEquals("Deve retornar o vid esperado.", 4l, nearestNeighbor.getId());
+ assertEquals("Deve retornar o custo esperado.", 12, nearestNeighbor.getDistance()/1000/60);
+ assertEquals("Deve retornar o caminho esperado.", path_result , nearestNeighbor.getPath());
+ }
+
+ // Tem três taxista na malha, customer = 5, cab 1 = 1, cab 2 = 4 e cab 3 = 9
+ @Test
+ public void returnBetterSolutionTimeForTheCallMidnight() throws IOException, ParseException {
+
+ GraphBounds graphBoundsReverse = new GraphGenerator().generateExampleTaxi15to15minutes();
+ graphBoundsReverse.reverseGraph();
+
+ //Tempo para atendiemento - 40 minutos
+ maxTravelTime = DateUtils.parseDate(00, 38, 00);
+
+ //Hora que ele realiza a chamada do serviço - meia-noite
+ hourServiceTime = DateUtils.parseDate(00, 00, 00);
+
+ // Cliente que realiza a chamada do serviço
+ idCustomer = Integer.valueOf(5);
+
+ RNNBreadthFirstSearch taxiSearch = new RNNBreadthFirstSearch(graphBoundsReverse);
+ NearestNeighbor nearestNeighbor = taxiSearch.search(graphBoundsReverse.getNode(idCustomer), maxTravelTime, hourServiceTime);
+
+ System.out.println(nearestNeighbor);
+ Assert.assertNotNull(nearestNeighbor);
+
+ ArrayList path_result = new ArrayList<>();
+ path_result.add(1l);
+ path_result.add(7l);
+ path_result.add(6l);
+ path_result.add(5l);
+
+ assertEquals("Deve retornar o vid esperado.", 1l, nearestNeighbor.getId());
+ assertEquals("Deve retornar o custo esperado.", 28, nearestNeighbor.getDistance()/1000/60);
+ assertEquals("Deve retornar o caminho esperado.", path_result , nearestNeighbor.getPath());
+ }
+
+ // Tem três taxista na malha, customer = 5, cab 1 = 1, cab 2 = 4 e cab 3 = 9
+ @Test
+ public void returnBetterSolutionTimeForTheCallHourServiceInit() throws IOException, ParseException {
+
+ GraphBounds graphBoundsReverse = new GraphGenerator().generateExampleTaxi15to15minutes();
+ graphBoundsReverse.reverseGraph();
+
+ //Tempo para atendiemento - 40 minutos
+ maxTravelTime = DateUtils.parseDate(2, 52, 00);
+
+ //Hora que ele realiza a chamada do serviço - meia-noite e quinze minutos
+ hourServiceTime = DateUtils.parseDate(00, 15, 00);
+
+ // Cliente que realiza a chamada do serviço
+ idCustomer = Integer.valueOf(5);
+
+ RNNBreadthFirstSearch taxiSearch = new RNNBreadthFirstSearch(graphBoundsReverse);
+ NearestNeighbor nearestNeighbor = taxiSearch.search(graphBoundsReverse.getNode(idCustomer), maxTravelTime, hourServiceTime);
+
+ System.out.println(nearestNeighbor);
+ Assert.assertNotNull(nearestNeighbor);
+
+ ArrayList path_result = new ArrayList<>();
+ path_result.add(1l);
+ path_result.add(7l);
+ path_result.add(6l);
+ path_result.add(5l);
+
+ assertEquals("Deve retornar o vid esperado.", 1l, nearestNeighbor.getId());
+ assertEquals("Deve retornar o custo esperado.", 52, nearestNeighbor.getDistance()/1000/60);
+ assertEquals("Deve retornar o caminho esperado.", path_result , nearestNeighbor.getPath());
+ }
+
+ @Test
+ public void taxiBetterWaytRandomGraphOneByOne() throws ParseException {
+
+ setUpRandomGraph(1,1,1);
+
+ // Cliente que realiza a chamada do serviço
+ idCustomer = Integer.valueOf(0);
+
+ RNNBreadthFirstSearch taxiSearch = new RNNBreadthFirstSearch(graphBoundsReverse);
+ NearestNeighbor nearestNeighbor = taxiSearch.search(graphBoundsReverse.getNode(idCustomer), maxTravelTime, hourServiceTime);
+
+ assertEquals("Deve retornar o vid esperado.", 0l, nearestNeighbor.getId());
+ assertEquals("Deve retornar o custo esperado.", 0, nearestNeighbor.getDistance()/1000/60);
+
+ ArrayList path = new ArrayList<>();
+ path.add(0l);
+ assertEquals("Deve retornar o caminho esperado.", path , nearestNeighbor.getPath());
+ }
+
+ @Test
+ public void taxiBetterWaytRandomGraphTwoByTwo() throws ParseException {
+
+ setUpRandomGraph(2, 2, 1);
+
+ // Cliente que realiza a chamada do serviço
+ idCustomer = Integer.valueOf(0);
+
+ RNNBreadthFirstSearch taxiSearch = new RNNBreadthFirstSearch(graphBoundsReverse);
+ NearestNeighbor nearestNeighbor = taxiSearch.search(graphBoundsReverse.getNode(idCustomer), maxTravelTime, hourServiceTime);
+
+ Assert.assertNotNull(nearestNeighbor);
+ }
+
+ @AfterClass
+ public static void tearDown() {
+
+ FileUtils.deleteDir(Configuration.USER_HOME + "/graphhopper/test");
+ FileUtils.deleteDir(Configuration.USER_HOME + "/graphast/test");
+ }
+}
diff --git a/core/src/test/java/org/graphast/knn/RNNComparatorTest.java b/core/src/test/java/org/graphast/knn/RNNComparatorTest.java
new file mode 100644
index 0000000..1533543
--- /dev/null
+++ b/core/src/test/java/org/graphast/knn/RNNComparatorTest.java
@@ -0,0 +1,191 @@
+package org.graphast.knn;
+
+import java.io.IOException;
+import java.text.ParseException;
+import java.util.Date;
+
+import org.graphast.config.Configuration;
+import org.graphast.graphgenerator.GraphGeneratorGridTester;
+import org.graphast.model.GraphBounds;
+import org.graphast.query.knn.NearestNeighbor;
+import org.graphast.query.rnn.RNNBacktrackingSearch;
+import org.graphast.query.rnn.RNNBreadthFirstSearch;
+import org.graphast.util.DateUtils;
+import org.graphast.util.FileUtils;
+import org.junit.AfterClass;
+import org.junit.Before;
+import org.junit.Test;
+
+public class RNNComparatorTest {
+
+ private Integer idCustomer = null;
+ private Date endServiceTime = null;
+ private Date startServiceTime = null;
+ private Double percentagemPoi = null;
+ private String PATH_GRAPH = Configuration.USER_HOME + "/graphast/test/example";
+
+ @Before
+ public void setUp() throws ParseException, IOException {
+
+ //Cliente que realiza a chamada do serviço
+ idCustomer = Integer.valueOf(0);
+
+ //Tempo para atendiemento - 23h 59m 59s
+ endServiceTime = DateUtils.parseDate(0, 20, 00);
+
+ //Hora que ele realiza a chamada do serviço
+ startServiceTime = DateUtils.parseDate(00, 00, 00);
+
+ percentagemPoi = Double.valueOf(1);
+ }
+
+ // 1k (1024 pontos)
+ @Test
+ public void taxiSearchSytenticGraph1k() throws IOException, ParseException {
+
+ for(int i=0; i<100; i++) {
+
+ int comprimento = 32;
+ int altura = 32;
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, comprimento,altura, percentagemPoi);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ //==== SOLUÇÃO I ====
+ long startSolution1 = System.currentTimeMillis();
+ RNNBacktrackingSearch taxiSearch = new RNNBacktrackingSearch(graph);
+ NearestNeighbor solution1 = taxiSearch.search(graph.getNode(idCustomer), endServiceTime, startServiceTime);
+ long endSolution1 = System.currentTimeMillis();
+ long timeSolution1 = endSolution1-startSolution1;
+
+ graph.reverseGraph();
+
+ //==== SOLUÇÃO III ====
+ long startSolution3 = System.currentTimeMillis();
+ RNNBreadthFirstSearch taxiSearchRestritionsOSR = new RNNBreadthFirstSearch(graph);
+ NearestNeighbor solution3 = taxiSearchRestritionsOSR.search(graph.getNode(idCustomer), endServiceTime, startServiceTime);
+ long endSolution3 = System.currentTimeMillis();
+ long timeSolution3 = endSolution3-startSolution3;
+
+ System.out.println(String.format("%s;%s;%s;%s;%s;%s;%s;%s;%s;%s", timeSolution1, timeSolution3, solution1.getId(), solution3.getId(), solution1.getDistance(),
+ solution3.getDistance(), solution1.getPath().size(), solution3.getPath().size(), solution1.getPath(), solution3.getPath()));
+ }
+ }
+
+ // 10k (10000 pontos)
+ @Test
+ public void taxiSearchSytenticGraph10k() throws IOException, ParseException {
+
+ for(int i=0; i<100; i++) {
+
+ int comprimento = 100;
+ int altura = 100;
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, comprimento,altura, percentagemPoi);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ //==== SOLUÇÃO I ====
+ long startSolution1 = System.currentTimeMillis();
+ RNNBacktrackingSearch taxiSearch = new RNNBacktrackingSearch(graph);
+ NearestNeighbor solution1 = taxiSearch.search(graph.getNode(idCustomer), endServiceTime, startServiceTime);
+ long endSolution1 = System.currentTimeMillis();
+ long timeSolution1 = endSolution1-startSolution1;
+
+ graph.reverseGraph();
+
+ //==== SOLUÇÃO III ====
+ long startSolution3 = System.currentTimeMillis();
+ RNNBreadthFirstSearch taxiSearchRestritionsOSR = new RNNBreadthFirstSearch(graph);
+ NearestNeighbor solution3 = taxiSearchRestritionsOSR.search(graph.getNode(idCustomer), endServiceTime, startServiceTime);
+ long endSolution3 = System.currentTimeMillis();
+ long timeSolution3 = endSolution3-startSolution3;
+
+ System.out.println(String.format("%s;%s;%s;%s;%s;%s;%s;%s;%s;%s", timeSolution1, timeSolution3, solution1.getId(), solution3.getId(), solution1.getDistance(),
+ solution3.getDistance(), solution1.getPath().size(), solution3.getPath().size(), solution1.getPath(), solution3.getPath()));
+ }
+ }
+
+ // 100k (99856 pontos)
+ @Test
+ public void taxiSearchSytenticGraph100k() throws IOException, ParseException {
+
+ for(int i=0; i<100; i++) {
+
+ int comprimento = 316;
+ int altura = 316;
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, comprimento,altura, percentagemPoi);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ GraphBounds reverseGraph = graphSynthetic.getGraph();
+ graph = reverseGraph;
+ reverseGraph.reverseGraph();
+
+ //==== SOLUÇÃO I ====
+ long startSolution1 = System.currentTimeMillis();
+ RNNBacktrackingSearch taxiSearch = new RNNBacktrackingSearch(graph);
+ NearestNeighbor solution1 = taxiSearch.search(graph.getNode(idCustomer), endServiceTime, startServiceTime);
+ long endSolution1 = System.currentTimeMillis();
+ long timeSolution1 = endSolution1-startSolution1;
+
+
+ //==== SOLUÇÃO III ====
+ long startSolution3 = System.currentTimeMillis();
+ RNNBreadthFirstSearch taxiSearchRestritionsOSR = new RNNBreadthFirstSearch(reverseGraph);
+ NearestNeighbor solution3 = taxiSearchRestritionsOSR.search(reverseGraph.getNode(idCustomer), endServiceTime, startServiceTime);
+ long endSolution3 = System.currentTimeMillis();
+ long timeSolution3 = endSolution3-startSolution3;
+
+ System.out.println(String.format("%s;%s;%s;%s;%s;%s;%s;%s;%s;%s", timeSolution1, timeSolution3, solution1.getId(), solution3.getId(), solution1.getDistance(),
+ solution3.getDistance(), solution1.getPath().size(), solution3.getPath().size(), solution1.getPath(), solution3.getPath()));
+ }
+ }
+
+ // 1G (1000000 pontos)
+ @Test
+ public void taxiSearchSytenticGraph1000k() throws IOException, ParseException {
+
+ for(int i=0; i<10; i++) {
+
+ int comprimento = 1000;
+ int altura = 1000;
+
+ GraphGeneratorGridTester graphSynthetic = new GraphGeneratorGridTester(PATH_GRAPH, comprimento,altura, percentagemPoi);
+ graphSynthetic.generateGraph();
+ GraphBounds graph = graphSynthetic.getGraph();
+
+ GraphBounds reverseGraph = graphSynthetic.getGraph();
+ graph = reverseGraph;
+ reverseGraph.reverseGraph();
+
+ //==== SOLUÇÃO I ====
+ long startSolution1 = System.currentTimeMillis();
+ RNNBacktrackingSearch taxiSearch = new RNNBacktrackingSearch(graph);
+ NearestNeighbor solution1 = taxiSearch.search(graph.getNode(idCustomer), endServiceTime, startServiceTime);
+ long endSolution1 = System.currentTimeMillis();
+ long timeSolution1 = endSolution1-startSolution1;
+
+
+ //==== SOLUÇÃO III ====
+ long startSolution3 = System.currentTimeMillis();
+ RNNBreadthFirstSearch taxiSearchRestritionsOSR = new RNNBreadthFirstSearch(reverseGraph);
+ NearestNeighbor solution3 = taxiSearchRestritionsOSR.search(reverseGraph.getNode(idCustomer), endServiceTime, startServiceTime);
+ long endSolution3 = System.currentTimeMillis();
+ long timeSolution3 = endSolution3-startSolution3;
+
+ System.out.println(String.format("%s;%s;%s;%s;%s;%s;%s;%s;%s;%s", timeSolution1, timeSolution3, solution1.getId(), solution3.getId(), solution1.getDistance(),
+ solution3.getDistance(), solution1.getPath().size(), solution3.getPath().size(), solution1.getPath(), solution3.getPath()));
+ }
+ }
+
+
+ @AfterClass
+ public static void tearDown() {
+
+ FileUtils.deleteDir(Configuration.USER_HOME + "/graphhopper/test");
+ FileUtils.deleteDir(Configuration.USER_HOME + "/graphast/test");
+ }
+}
diff --git a/core/src/test/java/org/graphast/knn/RNNDepthFirstSearchTest.java b/core/src/test/java/org/graphast/knn/RNNDepthFirstSearchTest.java
new file mode 100644
index 0000000..9a8e253
--- /dev/null
+++ b/core/src/test/java/org/graphast/knn/RNNDepthFirstSearchTest.java
@@ -0,0 +1,265 @@
+package org.graphast.knn;
+
+import static org.junit.Assert.assertEquals;
+
+import java.io.IOException;
+import java.text.ParseException;
+import java.util.ArrayList;
+import java.util.Date;
+import java.util.List;
+
+import org.graphast.config.Configuration;
+import org.graphast.exception.PathNotFoundException;
+import org.graphast.graphgenerator.GraphGenerator;
+import org.graphast.importer.OSMDBImporter;
+import org.graphast.model.Edge;
+import org.graphast.model.GraphBounds;
+import org.graphast.query.knn.NearestNeighbor;
+import org.graphast.query.rnn.RNNBacktrackingSearch;
+import org.graphast.query.route.shortestpath.dijkstra.Dijkstra;
+import org.graphast.query.route.shortestpath.dijkstra.DijkstraLinearFunction;
+import org.graphast.query.route.shortestpath.model.Path;
+import org.graphast.util.DateUtils;
+import org.graphast.util.FileUtils;
+import org.graphast.util.NumberUtils;
+import org.junit.AfterClass;
+import org.junit.Assert;
+import org.junit.Before;
+import org.junit.Ignore;
+import org.junit.Test;
+
+public class RNNDepthFirstSearchTest {
+ private static final String PATH_GRAPH = Configuration.USER_HOME + "/graphast/test/example";
+
+ private Integer idCustomer;
+ private Date maxTravelTime;
+ private Date hourServiceTime;
+
+ @Before
+ public void setUp() throws ParseException, IOException {
+
+ //Cliente que realiza a chamada do serviço
+ idCustomer = Integer.valueOf(5);
+
+ //Hora que ele realiza a chamada do serviço - meia-noite e vinte segundo
+ hourServiceTime = DateUtils.parseDate(00, 00, 00);
+ }
+
+ @Test
+ public void reverteGraphTest() throws IOException {
+
+ GraphBounds graphBounds = new GraphGenerator().generateExampleTAXI();
+ GraphBounds graphBoundsReverse = new GraphGenerator().generateExampleTAXI();
+ graphBoundsReverse.reverseGraph();
+
+ //checar quantidade de vértices que foram invertidos
+ assertEquals("A quantidade de Vértices esperado não corresponde com a quantidade retornada.",
+ 10, graphBounds.getNumberOfNodes());
+
+ //checar quantidade de edge que foram invertidos
+ assertEquals("A quantidade de Edges esperados não corresponde com a quantidade retornada.",
+ 13, graphBounds.getNumberOfEdges());
+
+ List latitudesTo = new ArrayList();
+ List longitudeTo = new ArrayList();
+ List idTo = new ArrayList();
+
+ for (int i = 0; i < graphBounds.getNumberOfEdges(); i++) {
+ Edge edge = graphBounds.getEdge(i);
+ double latitude = graphBounds.getNode(edge.getToNode()).getLatitude();
+ double longitude = graphBounds.getNode(edge.getToNode()).getLongitude();
+ double id = graphBounds.getNode(edge.getToNode()).getId();
+
+ latitudesTo.add(latitude);
+ longitudeTo.add(longitude);
+ idTo.add(id);
+ }
+
+ //Reverse Graph
+ graphBounds.reverseGraph();
+
+ List