---CODE---
std::vector<Vertex> p(num_vertices(g));
  std::vector<long> d(num_vertices(g));
  dijkstra_shortest_paths(g, s,
                          predecessor_map(boost::make_iterator_property_map(p.begin(), get(boost::vertex_index, g))).
                          distance_map(boost::make_iterator_property_map(d.begin(), get(boost::vertex_index, g))));

---ERROR---
north.cpp: In function 'void findShortestPath()':
north.cpp:101:114: error: no matching function for call to 'dijkstra_shortest_pat
hs(Graph&, std::array<long int, 51500ul>&, boost::bgl_named_params<boost::iterato
r_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, b
oost::vec_adj_list_vertex_id_map<boost::allow_parallel_edge_tag, long unsigned in
t>, long int, long int&>, boost::vertex_distance_t, boost::bgl_named_params<boost
::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vec
tor<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::allow_parallel
_edge_tag, long unsigned int>, long unsigned int, long unsigned int&>, boost::ver
tex_predecessor_t, boost::no_property> >)'
 map(boost::make_iterator_property_map(d.begin(), get(boost::vertex_index, g))));
                                                                               ^
north.cpp:101:114: note: candidates are:
In file included from north.cpp:10:0:
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:347:3: note: template<class
VertexListGraph, class DijkstraVisitor, class PredecessorMap, class DistanceMap,
class WeightMap, class IndexMap, class Compare, class Combine, class DistInf, cla
ss DistZero, class T, class Tag, class Base> void boost::dijkstra_shortest_paths(
const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, P
redecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZ
ero, DijkstraVisitor, const boost::bgl_named_params<T, Tag, Base>&, typename boos
t::enable_if_c<boost::is_base_and_derived<boost::vertex_list_graph_tag, typename
boost::graph_traits<Graph>::traversal_category>::value, boost::graph::detail::no_
parameter>::type)
   dijkstra_shortest_paths
   ^
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:347:3: note:   template argu
ment deduction/substitution failed:
north.cpp:101:114: note:   candidate expects 13 arguments, 3 provided
 map(boost::make_iterator_property_map(d.begin(), get(boost::vertex_index, g))));
                                                                               ^
In file included from north.cpp:10:0:
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:369:3: note: template<class
VertexListGraph, class DijkstraVisitor, class PredecessorMap, class DistanceMap,
class WeightMap, class IndexMap, class Compare, class Combine, class DistInf, cla
ss DistZero, class ColorMap> void boost::dijkstra_shortest_paths(const VertexList
Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, PredecessorMap, D
istanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVis
itor, ColorMap)
   dijkstra_shortest_paths
   ^
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:369:3: note:   template argu
ment deduction/substitution failed:
north.cpp:101:114: note:   candidate expects 12 arguments, 3 provided
 map(boost::make_iterator_property_map(d.begin(), get(boost::vertex_index, g))));
                                                                               ^
In file included from north.cpp:10:0:
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:398:3: note: template<class
VertexListGraph, class DijkstraVisitor, class PredecessorMap, class DistanceMap,
class WeightMap, class IndexMap, class Compare, class Combine, class DistInf, cla
ss DistZero> void boost::dijkstra_shortest_paths(const VertexListGraph&, typename
 boost::graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, Weig
htMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor)
   dijkstra_shortest_paths
   ^
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:398:3: note:   template argu
ment deduction/substitution failed:
north.cpp:101:114: note:   candidate expects 11 arguments, 3 provided
 map(boost::make_iterator_property_map(d.begin(), get(boost::vertex_index, g))));
                                                                               ^
In file included from north.cpp:10:0:
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:473:3: note: void boost::dij
kstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<Graph>:
:vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&) [with VertexLis
tGraph = boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost
::allow_parallel_edge_tag, boost::property<boost::edge_weight_t, long int> >; Par
am = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::ve
ctor<long int> >, boost::vec_adj_list_vertex_id_map<boost::allow_parallel_edge_ta
g, long unsigned int>, long int, long int&>; Tag = boost::vertex_distance_t; Rest
 = boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_itera
tor<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_ver
tex_id_map<boost::allow_parallel_edge_tag, long unsigned int>, long unsigned int,
 long unsigned int&>, boost::vertex_predecessor_t, boost::no_property>; typename
boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]
   dijkstra_shortest_paths
   ^
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:473:3: note:   no known conv
ersion for argument 2 from 'std::array<long int, 51500ul>' to 'boost::graph_trait
s<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::allow
_parallel_edge_tag, boost::property<boost::edge_weight_t, long int> > >::vertex_d
escriptor {aka long unsigned int}'