-
Notifications
You must be signed in to change notification settings - Fork 0
/
Node.h
54 lines (48 loc) · 1.49 KB
/
Node.h
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
/**************************************************************************************************
* Implementation of the TAD Node
**************************************************************************************************/
#ifndef NODE_H_INCLUDED
#define NODE_H_INCLUDED
#include "Edge.h" // Include of the Edge class
using namespace std;
// Definition of the Node class
class Node{
friend class Graph; // Friend class Graph
// Attributes
private:
Edge* first_edge;
Edge* last_edge;
int id;
unsigned int in_degree;
unsigned int out_degree;
float weight;
Node* next_node;
public:
// Constructor
Node(int id);
// Destructor
~Node();
// Getters
Edge* getFirstEdge();
Edge* getLastEdge();
int getId();
int getInDegree();
int getOutDegree();
float getWeight();
Node* getNextNode();
// Setters
void setNextNode(Node* node);
void setWeight(float weight);
// Other methods
bool searchEdge(int target_id);
void insertEdge(int target_id, float weight);
void removeAllEdges(bool directed);
int removeEdge(int id, bool directed, Node* target_node);
void incrementOutDegree();
void decrementOutDegree();
void incrementInDegree();
void decrementInDegree();
Edge* hasEdgeBetween(int target_id);
// Auxiliar methods
};
#endif // NODE_H_INCLUDED