dijkstra.icc

每对节点间最短路径 Floyd-Warshall 算法 D[i,j]表示从i到j的最短距离； P[i,j]表示从i到j的最短路径上j 的父节点

target "Dijkstra.exe"
{
   option macros('global', 'yes')
   {
      source type('cpp') 'stdio.h'
      source type('cpp') 'string.h'
      source type('cpp') 'wchar.h'
      source type('cpp') 'cstddef'
      source type('cpp') 'stdlib.h'
      source type('cpp') 'new'
      source type('cpp') 'assert.h'
      source type('cpp') 'iostream'
      source type('cpp') 'math.h'
   }
   source type('cpp') 'iterator'
   source type('cpp') 'memory'
   source type('cpp') 'algorithm'
   source type('cpp') 'cassert'
   source type('cpp') 'cmath'
   source type('cpp') 'ctime'
   source type('cpp') 'string'
   source type('cpp') 'bitset'
   source type('cpp') 'float.h'
   option macros('global', 'yes')
   {
      source type('cpp') 'Graph.h'
   }
   source "Dijkstra.cpp"
}