/* Represents an undirected graph.
 * Also contains the vertex and edge classes
 * vertexes know their center point on the SDL Surface - 
 * bad decoupling maybe, but not too bad, all things considered
 */

#ifndef _GRAPH_H_
#define _GRAPH_H_

#include <list>

using std::list;

struct Vertex
{
    int x;
    int y;
    int x_min;
    int x_max;
    int y_min;
    int y_max;
};

struct Edge
{
    Vertex a;
    Vertex b;
};

class Graph
{
 public:
    Graph() {}

    bool vertex_present(int x, int y, int size);

    list<Vertex> get_vertices() { return vertices; }
    list<Edge> get_edges() { return edges; }

    void add_vertex(int x, int y, int size);

 private:
    Vertex last_vertex;
    list<Vertex> vertices;
    list<Edge> edges;
};

#endif