/*
 * Copyright (c) 1999 Johnny C. Lam.
 * All rights reserved.
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  The author makes no representations
 * about the suitability of this software for any purpose.  It is
 * provided "as is" without express or implied warranty.
 */

// -*- C++ -*-

#ifndef PATH_STRATEGY_H_INCLUDED
#define PATH_STRATEGY_H_INCLUDED

#ifndef PATH_H_INCLUDED
#include "path.h"
#endif

#ifndef HAPLOTYPE_H_INCLUDED
#include "haplotype.h"
#endif

class Probability;

///////////////////////////////////////////////////////////////////////////
//
// PathStrategy
//
// Abstract class for generating maximum probability paths.
//
// Conceptually, this class is implemented separately so we can
// experiment with different strategies without major changes to the
// code base.
//
// Provides Context for HProbability Strategy class.
//
///////////////////////////////////////////////////////////////////////////

class PathStrategy {
public:
    typedef Haplotype::size_type size_type;
    
    virtual ~PathStrategy();
    PathStrategy(unsigned int, bool = false);
    
    bool		Verbose() const;
    virtual Path	MakePath(const Haplotype&, const Haplotype&,
				 size_type, Probability*) const = 0;

private:
    bool _verbose;
};

#include "path_strategy_inline.h"

#endif // PATH_STRATEGY_H_INCLUDED
