FilesExpand file tree

 master

/

UndirectedGraph_test.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

51 lines (44 loc) · 1.13 KB

 master

/

UndirectedGraph_test.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

51 lines (44 loc) · 1.13 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

#include"Graph.h"

#include"DFSCC.h"

#include"BFSPath.h"

int initG(){

std::ifstream infile("./data/tinyG.txt");

string tmp;

int E,V;

int lineNum = 0;

while(std::getline(infile,tmp)){

std::istringstream iss(tmp);

int v1,v2;

if(lineNum==0) iss>>E;

else if(lineNum==1) iss>>V;

else iss>>v1>>v2;

lineNum++;

}

}

int main(){

Graph* G = new Graph("./data/tinyG.txt");

//基础测试

cout<<G->getE()<<endl;

cout<<G->getV()<<endl;

cout<<G->degree(0)<<endl;

//DFS得到图中连通集的数量

cout<<endl;

DFSCC* cc = new DFSCC(G);

cout<<cc->getSetNum(G)<<endl; //3个连通分量

//DFS思考:

//判断是否存在从节点V到节点W的路径？

//判断图是否存在环？

//判断图是否可以只用两种颜色标记？

//P599 两点之间最长路径 DFS变型

//BFS得到最短单点路径问题

cout<<endl;

BFSPath* bfs = new BFSPath(G);

stack<int> path;

bfs->bfs(G,0);

bfs->pathTo(path,0,3);

while(!path.empty()){

cout<<path.top()<<" ";

path.pop();

}

return 0;

}