===========
TABLE SETUP
===========

Creating records from the dc_shape.csv file.
192238 records inserted into graph_s_dc_shortest_path_turn.dc_shape table.


===========
GRAPH SETUP
===========

Creating graph: graph_s_dc_shortest_path_turn.dc_shape_graph
- OK

====================================
SOLVE GRAPH - TURN PENALTY EXAMPLE 1
====================================

Cost for shortest path between source (['POINT(-77.04489135742188 38.91112899780273)']) and destination (['POINT(-77.03193664550781 38.91188049316406)']):
+---------------------+
|   Cost (in seconds) |
|---------------------|
|             106.994 |
+---------------------+

====================================
SOLVE GRAPH - TURN PENALTY EXAMPLE 2
====================================

Cost for shortest path between source (['POINT(-77.04489135742188 38.91112899780273)']) and destination (['POINT(-77.03193664550781 38.91188049316406)']) with intersection penalty:
+---------------------+
|   Cost (in seconds) |
|---------------------|
|             155.317 |
+---------------------+

====================================
SOLVE GRAPH - TURN PENALTY EXAMPLE 3
====================================

Cost for shortest path between source (['POINT(-77.04489135742188 38.91112899780273)']) and destination (['POINT(-77.03193664550781 38.91188049316406)']) with one turn restriction:
+---------------------+
|   Cost (in seconds) |
|---------------------|
|             108.284 |
+---------------------+