fork download
copy 
  1. #include <iostream>
  2. #include <vector>
  3.  
  4. const int MAX = 1001;
  5.  
  6. class Staque {
  7. private:
  8. 	int staque[MAX * 20] = {}, top = 1, front = 1;
  9. public:
  10. 	bool empty()
  11. 	{
  12. 		if (top == front)
  13. 			return true;
  14. 		else
  15. 			return false;
  16. 	}
  17. 	bool full()
  18. 	{
  19. 		if ((top + 1) % MAX == front)
  20. 			return true;
  21. 		else
  22. 			return false;
  23. 	}
  24. 	void push(int a)
  25. 	{
  26. 		if (full()) return;
  27. 		if (top == 0)
  28. 			++top;
  29. 		staque[(top++)%MAX] = a;
  30. 	}
  31. 	int pop()
  32. 	{
  33. 		if (empty())
  34. 			return 0;
  35. 		return staque[(--top)%MAX];
  36. 	}
  37. 	int deStq()
  38. 	{
  39. 		if (empty())
  40. 			return 0;
  41. 		return staque[(front++)%MAX];
  42. 	}
  43. };
  44.  
  45. class Graph
  46. {
  47. private:
  48. 	std::vector<int> vertex[MAX];
  49. public:
  50. 	void linkVertex(int a, int b) 
  51. 	{
  52. 		int left = 0, right = vertex[a].size() - 1;
  53. 		while (right >= left) {
  54. 			if (b > vertex[a].at((left + right) / 2))
  55. 				left = (left + right) / 2 + 1;
  56. 			else if (b < vertex[a].at((left + right) / 2))
  57. 				right = (left + right) / 2 - 1;
  58. 			else
  59. 				return;
  60. 		}
  61. 		vertex[a].insert(vertex[a].begin() + left, b);
  62. 	}
  63. 	void insertEdge(int a, int b)
  64. 	{
  65. 		if (a == b)
  66. 			return;
  67. 		linkVertex(a, b);
  68. 		linkVertex(b, a);
  69. 	}
  70. 	void DFS(int v)
  71. 	{
  72. 		Staque staque;
  73. 		int visited[MAX] = {}, w;
  74. 		visited[v] = 1;
  75. 		printf("%d ", v);
  76. 		staque.push(v);
  77. 		while (!staque.empty()) {
  78. 			v = staque.pop();
  79. 			if (visited[v] == 0) {
  80. 				visited[v] = 1;
  81. 				printf("%d ", v);
  82. 			}
  83. 			for (w = vertex[v].size() - 1; w >= 0; w--) {
  84. 				if (visited[vertex[v].at(w)] == 0) {
  85. 					staque.push(vertex[v].at(w));
  86. 				}
  87. 			}
  88. 		}
  89. 	}
  90. 	void BFS(int v)
  91. 	{
  92. 		Staque staque;
  93. 		int visited[MAX] = {}, temp;
  94. 		visited[v] = 1;
  95. 		printf("%d ", v);
  96. 		staque.push(v);
  97. 		while (!staque.empty()) {
  98. 			v = staque.deStq();
  99. 			for (int w = 0; w < vertex[v].size(); w++) {
  100. 				temp = vertex[v].at(w);
  101. 				if (visited[temp] == 0) {
  102. 					visited[temp] = 1;
  103. 					printf("%d ", temp);
  104. 					staque.push(temp);
  105. 				}
  106. 			}
  107. 		}
  108. 	}
  109. };
  110.  
  111. int main(void)
  112. {
  113. 	Graph graph;
  114. 	int n, m, v, v1, v2;
  115.  
  116. 	scanf("%d %d %d", &n, &m, &v);
  117. 	for (int i = 0; i < m; i++) {
  118. 		scanf("%d %d", &v1, &v2);
  119. 		graph.insertEdge(v1, v2);
  120. 	}
  121. 	if (v <= n) {
  122. 		graph.DFS(v);
  123. 		printf("\n");
  124. 		graph.BFS(v);
  125. 	}
  126. }
Success #stdin #stdout 0s 4408KB
comments (?)
stdin
copy 
5 2 3
3 1
1 2
stdout
copy 
3 1 2 
3 1 2
https://ideone.com/O3ZiMy
language:
C++14 (gcc 8.3)
created:
8 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!