source: tspsg/src/tspmodel.h @ 799ba1e3f2

/*
 *  TSPSG - TSP Solver and Generator
 *  Copyright (C) 2007-2009 Lёppa <contacts[at]oleksii[dot]name>
 *
 *  $Id$
 *  $URL$
 *
 *  This file is part of TSPSG.
 *
 *  TSPSG is free software: you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation, either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  TSPSG is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with TSPSG.  If not, see <http://www.gnu.org/licenses/>.
 */

#ifndef TSPMODEL_H
#define TSPMODEL_H

// Decided, that static array with 100 of cities maximum hard limit
// will be enough for most cases, but the code will be simplier than
// when using dynamic lists. If you need more, just change this value
// and recompile the program ;-)
#define MAX_CITIES 100
// This value means infinity :-)
#define INFINITY 1.7E+308
// This is string, which represents infinite value in table
#define INFSTR "---"

#include <QAbstractTableModel>

class CTSPModel: public QAbstractTableModel
{
        Q_OBJECT
public:
        CTSPModel(QObject *parent = 0);
        int rowCount(const QModelIndex &) const;
        int columnCount(const QModelIndex &) const;
        QVariant headerData(int, Qt::Orientation, int) const;
        QVariant data(const QModelIndex &, int) const;
        bool setData(const QModelIndex &, const QVariant &, int);
        Qt::ItemFlags flags(const QModelIndex &) const;
        int numCities() const;
        void setNumCities(int);
        void randomize();
        int randMin;
        int randMax;
private:
        double table[MAX_CITIES][MAX_CITIES];
        int nCities;
        int rand(int, int);
};

#endif // TSPMODEL_H