-
Notifications
You must be signed in to change notification settings - Fork 0
/
Edge.h
52 lines (44 loc) · 1.5 KB
/
Edge.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
// *********************************************************
// Edge Class
// Author : Tamy Boubekeur ([email protected]).
// Copyright (C) 2008 Tamy Boubekeur.
// All rights reserved.
// *********************************************************
#ifndef EDGE_H
#define EDGE_H
#include <map>
// -------------------------------------------------
// Intermediate Edge structure for hashed adjacency
// -------------------------------------------------
struct Edge {
public:
inline Edge (unsigned int v0, unsigned int v1) {
if (v0 < v1) {v[0] = v0; v[1] = v1; } else {v[0] = v1; v[1] = v0; }
}
inline Edge (const Edge & e) { v[0] = e.v[0]; v[1] = e.v[1]; }
inline virtual ~Edge () {}
inline Edge & operator= (const Edge & e) { v[0] = e.v[0]; v[1] = e.v[1]; return (*this); }
inline bool operator== (const Edge & e) { return (v[0] == e.v[0] && v[1] == e.v[1]); }
inline bool operator< (const Edge & e) { return (v[0] < e.v[0] || (v[0] == e.v[0] && v[1] < e.v[1])); }
inline bool contains (unsigned int i) const { return (v[0] == i || v[1] == i); }
unsigned int v[2];
};
struct compareEdge {
inline bool operator()(const Edge e1, const Edge e2) const {
if (e1.v[0] < e2.v[0])
return true;
if (e1.v[0] > e2.v[0])
return false;
if (e1.v[1] > e2.v[1])
return true;
return false;
}
};
typedef std::map<Edge, unsigned int, compareEdge> EdgeMapIndex;
#endif // EDGE_H
// Some Emacs-Hints -- please don't remove:
//
// Local Variables:
// mode:C++
// tab-width:4
// End: