libvspell/pfs.h

   1 #ifndef __PFS_H__ // -*- tab-width: 2 mode: c++ -*-
   2 #define __PFS_H__
   3
   4 #ifndef __DAG_H__
   5 #include "dag.h"
   6 #endif
   7
   8 /**
   9    Priority-First Search.
  10    This is the PFS approach to the shortest path problem in graph.
  11  */
  12
  13 class PFS
  14 {
  15 public:
  16         //      void segment_best(const Lattice &words,Segmentation &seps);
  17         void search(const DAG &dag,Path &seps);
  18 };
  19
  20 #endif