digraph G
{
  bgcolor="transparent";
  edge [fontname="FreeSans.ttf",fontsize="10",labelfontname="FreeSans.ttf",labelfontsize="10"];
  node [fontname="FreeSans.ttf",fontsize="10",shape=record];
  rankdir=LR;
  Node1 [label="mrpt::math::CDijkstra\< TYPE_EDGES, MAPS_IMPLEMENTATION \>",height=0.2,width=0.4,color="black",URL="$classmrpt_1_1math_1_1_c_dijkstra.html",tooltip="The Dijkstra algorithm for finding the shortest path between a given source node in a (weighted) dire..."];
}