libvspell/bellman.h

   1 #ifndef __BELLMAN_H__ // -*- tab-width: 2 mode: c++ -*-
   2 #define __BELLMAN_H__
   3
   4 #ifndef __DAG_H__
   5 #include "dag.h"
   6 #endif
   7
   8 /**
   9    Bellman shortest path search.
  10    The reason to use Bellman-Ford instead of PFS is to be able to find
  11    the shortest path  with negative weight. Negative weights is made
  12    from graph normalization process.
  13  */
  14
  15 class Bellman
  16 {
  17 public:
  18         void search(const DAG &dag,Path &seps);
  19 };
  20
  21 #endif