graphs/GraphApp.hpp at master · caltechcs2/graphs · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
/**
 * @file GraphApp.hpp
 * @author The CS2 TA Team
 * @version 1.0
 * @date 2018
 * @copyright see License section
 *
 * @brief Definitions for the main application class.
 *
 * @section License
 * Copyright (c) 2013-2014 California Institute of Technology.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met:
 *
 * * Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * * Redistributions in binary form must reproduce the above
 *   copyright notice, this list of conditions and the following disclaimer
 *   in the documentation and/or other materials provided with the
 *   distribution.
 * * Neither the name of the  nor the names of its
 *   contributors may be used to endorse or promote products derived from
 *   this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 * The views and conclusions contained in the software and documentation are those
 * of the authors and should not be interpreted as representing official policies,
 * either expressed or implied, of the California Institute of Technology.
 *
 */

#pragma once

#include <SDL.h>
#include <SDL_gfxPrimitives.h>
#include <vector>
#include "structs.hpp"
#include <tuple>

using namespace std;

#define SCREEN_WIDTH    (800)
#define SCREEN_HEIGHT   (600)
#define POINTSIZE       (5)

#define NPOINTS         (10)

#define NEDGES          (25)

#define ANIMATION_DELAY     (25)

#define SELECTION_ACCURACY (10)


/**
 * @brief Encapsulates the main application class.
 */
class GraphApp
{
public:
    GraphApp();
    ~GraphApp();

    bool OnInit();
    int OnExecute();
    void OnEvent(SDL_Event *event);
    void OnRender(int choice);
    void OnCleanup();

    void add_to_mst(Edge * e);
    void add_to_path(Edge * e);
    void delete_mst();
    void delete_path();
    int testsuite();

private:
    /**
     * @brief Whether the application is running
     */
    bool running;

    /**
     * @brief Structure responsible for the pixel data
     */
    SDL_Surface *surf;

    /**
     * @brief The points
     */
    vector <Node *> nodes;
    vector <Edge *> edges;

    vector <Edge *> mst;
    vector <Edge *> path;

    int start;
    int end;
    int graph;

    void draw_nodes();
    void draw_mst();
    void generate_nodes();
    void generate_edges();
    void draw_edges(vector <Edge *> &v, int r, int g, int b);
    int find_point(int x, int y);

    void clean();
    void makeGraphs(int number);

};