FilesExpand file tree

 master

/

Graph.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

75 lines (55 loc) · 1.8 KB

 master

/

Graph.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

75 lines (55 loc) · 1.8 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

#include "include/Graph.h"

// #include "include/JointSort.h"

#include <algorithm>

using namespace rwNameSpace;

//Basic binary search procedure

// Input: pointer array, index of last entry end, and val to search for

// Output: index if val is found, and -1 otherwise

// VertexIdx rwNameSpace::binarySearch(vector<EdgeIdx> array, VertexIdx end, EdgeIdx val)

// {

// VertexIdx low = 0;

// VertexIdx high = end - 1;

// VertexIdx mid;

// while (low <= high) {

// mid = (low + high) / 2;

// if (array[mid] == val)

// return mid;

// if (array[mid] > val)

// high = mid - 1;

// if (array[mid] < val)

// low = mid + 1;

// }

// return -1;

// }

// comparator that only compares the first in pair

// bool rwNameSpace::pairCompareFirst(Pair firstPair, Pair nextPair) {

// return firstPair.first < nextPair.first;

// }

// int rwNameSpace :: Graph :: printGraphDetails()

// {

// std::cout << "num of nodes = " << nVertices << " num of edges = " << nEdges << "\n";

// return 0;

// }

// rwNameSpace :: Graph :: Graph(vector <VertexIdx> &v, vector<ePair> &e)

// // Graph::Graph(vector <VertexIdx> &v, vector<ePair> &edList)

// {

// nVertices = v.size();

// nEdges = e.size();

// // std::cout << "num of nodes = " << nVertices << " num of edges = " << nEdges << "\n";

// vector<VertexIdx>::iterator vIt;

// for(vIt = v.begin(); vIt != v.end(); vIt++)

// {

// nodeList.push_back(*vIt);

// }

// // std::cout << "got vertices \n";

// adjList.resize(nVertices);

// // vector<ePair>::iterator edgeIt;

// for(const ePair &edgeIt : e)

// {

// VertexIdx src = edgeIt.first;

// VertexIdx dest = edgeIt.second;

// adjList[src].push_back(dest);

// adjList[dest].push_back(src);

// }

// }

// int rwNameSpace::printGraphDetails()