Files
Graph_Theory_Using_Flat_Buf…/graph.h

51 lines
906 B
C++

#pragma once
#include <iostream>
#include <random>
#include <vector>
using namespace std;
class d_linked_list {
struct Point {
private:
string name;
int x;
int y;
vector<Point*> edges[5];
Point() : name("Unnamed"), x(0), y(0) {};
Point(string new_name, int new_x, int new_y) : name(new_name), x(new_x), y(new_y) {};
Point(string new_name, int new_x, int new_y, Point* edge) : name(new_name), x(new_x), y(new_y) {
edges->push_back(edge);
};
};
private:
Point* start;
Point* end;
public:
//class constructor
d_linked_list() : start(nullptr), end(nullptr) {};
int rand_int() {};
void del_all_data(){};
void del_element(int){};
void insert(int, int, vector<Point*>){};
void gen_list(int){};
void print_graph(){};
//Setters
int rand_int() {
random_device rd;
mt19937 gen(rd());
uniform_int_distribution<int> dist(1, 30);
return dist(gen);
}
//Mutators
};