{@inheritDoc} The distance between two nodes is {@code 1} when an edge exists, or {@code Double.POSITIVE_INFINITY} when no such edge exists.

Returns the format of edge data; or {@code null} if edge data is not explicitly defined. @return the format of edge data; or {@code null} if edge dat

Returns the format of the edge weight matrix when explicit weights are used; or {@code null} if edge weights are not explicit. @return the format of

Returns the identifier of the first node. @return the identifier of the first node

Returns the identifier of the second node. @return the identifier of the second node

Returns the format of node coordinate data. @return the format of node coordinate data

Returns the demands and depot nodes for vehicle routing problems; or {@code null} if this is not a vehicle routing problem instance. @return the dema

Returns {@code true} if this is a depot node; {@code false} otherwise. @param id the identifier of the node @return {@code true} if this is a depot n

Loads the distance table from the specified reader. @param reader the reader containing the distance table @throws IOException if an I/O error occurr

Runs the example TSP optimization problem. @param args the command line arguments; none are defined @throws IOException if an I/O error occurred

Removes the specified tour from this display. @param tour the tour to remove

Sets the border around the graphical display. This border should be at least half the node width to ensure nodes are fully contained inside the panel

Sets the width of nodes in the graphical display. @param nodeWidth the width of nodes in the graphical display

Tests the boundary case of 3 nodes; no change to the tour should occur. @throws IOException should not occur

Tests if a simple tour with intersecting edges is correctly improved by the 2-opt heuristic. Because TSPLIB rounds to integers, the node coordinates