*/
public DijkstraShortestPathFinder(
Graph graph, Graphable source, EdgeWeighter weighter, NodeWeighter nweighter
) {
m_graph = graph;
m_iterator = new DijkstraIterator(weighter,nweighter);
m_iterator.setSource(source);
m_traversal = new BasicGraphTraversal(graph, this, m_iterator);
}