FilesExpand file tree

 master

/

MainApp.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

100 lines (86 loc) · 3.12 KB

 master

/

MainApp.java

Copy path

Top

File metadata and controls

• Code
• Blame

100 lines (86 loc) · 3.12 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

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

/*

* To change this license header, choose License Headers in Project Properties.

* To change this template file, choose Tools | Templates

* and open the template in the editor.

*/

package mainapp;

/**

*

* @author rudra

*/

import java.util.LinkedList;

import java.util.Scanner;

public class MainApp {

//private static final String START = "A";

//private static final String END = "E";

static String START = "A";

static String END = "E";

public static void main(String[] args) {

// this graph is directional

mainapp.Graph graph = new mainapp.Graph();

Scanner scanIn = new Scanner(System.in);

String cont="n";

do{

System.out.println("Enter Start and End vertex of an edge... Press Enter after entering...");

String str1 = scanIn.nextLine();

String str2 = scanIn.nextLine();

graph.addEdge(str1.toUpperCase(), str2.toUpperCase());

System.out.println("Add another edge? (y / n) :");

cont=scanIn.nextLine();

}while(cont.equals("y"));

System.out.println("\n\n Enter Start Vertex for Searching :");

START=scanIn.nextLine().toUpperCase();

System.out.println("\n\n Enter End Vertex for Searching :");

END=scanIn.nextLine().toUpperCase();

// graph.addEdge("A", "B");

// graph.addEdge("A", "C");

// graph.addEdge("B", "A");

// graph.addEdge("B", "D");

// graph.addEdge("B", "E"); // this is the only one-way connection

// graph.addEdge("B", "F");

// graph.addEdge("C", "A");

// graph.addEdge("C", "E");

// graph.addEdge("C", "F");

// graph.addEdge("D", "B");

// graph.addEdge("E", "C");

// graph.addEdge("E", "F");

// graph.addEdge("F", "B");

// graph.addEdge("F", "C");

// graph.addEdge("F", "E");

LinkedList<String> visited = new LinkedList<String>();

visited.add(START);

new MainApp().breadthFirst(graph, visited);

}

private void breadthFirst(Graph graph, LinkedList<String> visited) {

LinkedList<String> nodes = graph.adjacentNodes(visited.getLast());

// examine adjacent nodes

for (String node : nodes) {

if (visited.contains(node)) {

continue;

}

if (node.equals(END)) {

visited.add(node);

printPath(visited);

visited.removeLast();

break;

}

}

// in breadth-first, recursion needs to come after visiting adjacent nodes

for (String node : nodes) {

if (visited.contains(node) || node.equals(END)) {

continue;

}

visited.addLast(node);

breadthFirst(graph, visited);

visited.removeLast();

}

}

private void printPath(LinkedList<String> visited) {

System.out.println(" The Path(s) are, ");

for (String node : visited) {

System.out.print(node);

System.out.print(" -> ");

}

System.out.println();

}

}