@Test void GraphWith0Nodes_ThrowsArgumentException() { graph = GraphBuilder.Build().WithNodes(0).getGraph(); Assertions.assertThrows(ArrayStoreException.class, () -> DijkstraAlgorithm.findShortestPath(graph, "0", "0")); }
public static PathData findShortestPath(Graph graph, String sourceNodeIdentifier, String targetNodeIdentifier) throws ArrayStoreException { return findShortestPath(graph, graph.getNode(sourceNodeIdentifier), graph.getNode(targetNodeIdentifier)); }
DijkstraAlgorithm { public static PathData findShortestPath(Graph graph, String sourceNodeIdentifier, String targetNodeIdentifier) throws ArrayStoreException { return findShortestPath(graph, graph.getNode(sourceNodeIdentifier), graph.getNode(targetNodeIdentifier)); } }
DijkstraAlgorithm { public static PathData findShortestPath(Graph graph, String sourceNodeIdentifier, String targetNodeIdentifier) throws ArrayStoreException { return findShortestPath(graph, graph.getNode(sourceNodeIdentifier), graph.getNode(targetNodeIdentifier)); }  }
DijkstraAlgorithm { public static PathData findShortestPath(Graph graph, String sourceNodeIdentifier, String targetNodeIdentifier) throws ArrayStoreException { return findShortestPath(graph, graph.getNode(sourceNodeIdentifier), graph.getNode(targetNodeIdentifier)); }  static PathData findShortestPath(Graph graph, String sourceNodeIdentifier, String targetNodeIdentifier); static PathDataObject findShortestPath(GraphObject graph, String sourceNodeIdentifier, String targetNodeIdentifier); static PathData findShortestPath(Graph graph, GraphNode sourceNode, GraphNode targetNode); static PathDataObject findShortestPath(GraphObject graph, NodeGraphObject sourceNode, NodeGraphObject targetNode); }
DijkstraAlgorithm { public static PathData findShortestPath(Graph graph, String sourceNodeIdentifier, String targetNodeIdentifier) throws ArrayStoreException { return findShortestPath(graph, graph.getNode(sourceNodeIdentifier), graph.getNode(targetNodeIdentifier)); }  static PathData findShortestPath(Graph graph, String sourceNodeIdentifier, String targetNodeIdentifier); static PathDataObject findShortestPath(GraphObject graph, String sourceNodeIdentifier, String targetNodeIdentifier); static PathData findShortestPath(Graph graph, GraphNode sourceNode, GraphNode targetNode); static PathDataObject findShortestPath(GraphObject graph, NodeGraphObject sourceNode, NodeGraphObject targetNode);  }