edge.h
Go to the documentation of this file.
1 #ifndef EDGE_H
2 #define EDGE_H
3 
4 using namespace std;
5 
9 class edge
10 {
11 public:
19  edge(int f, int t, int c, bool v = false);
20 
26  bool operator== (const edge &e) const;
27 
31  int from;
32 
36  int to;
37 
41  int cost;
42 
46  bool vertical;
47 };
48 
53 {
60  bool operator() (const edge& a, const edge& b) const;
61 };
62 
66 struct hash_edge
67 {
73  size_t operator() (const edge& e) const;
74 };
75 
76 #endif // EDGE_H
f
A struct that provides the comparison of edge objects. It allows sorting of edges for priority queues...
Definition: edge.h:52
int cost
The cost of the edge, i.e., length.
Definition: edge.h:41
int to
The ending vertex of the edge.
Definition: edge.h:36
A class for representing edges.
Definition: edge.h:9
A struct that provides the hash function of edge objects.
Definition: edge.h:66
int from
The starting vertex of the edge.
Definition: edge.h:31
bool vertical
Whether the sweeping pattern is vertical or horizontal.
Definition: edge.h:46


coverage_path
Author(s): Micha Sende
autogenerated on Tue Jan 19 2021 03:30:03