FilesExpand file tree

 master

/

graph.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

109 lines (82 loc) · 1.64 KB

 master

/

graph.java

Copy path

Top

File metadata and controls

• Code
• Blame

109 lines (82 loc) · 1.64 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

101

102

103

104

105

106

107

108

109

package coding;

import java.util.ArrayList;

public class graph {

public class graph_node

{

int node_id;

graph_node next;

public graph_node(int id)

{

this.node_id = id;

}

}

ArrayList<graph_node> nodeList;

public graph()

{

nodeList = new ArrayList<graph_node>();

}

public graph_node addNode(int id)

{

graph_node node = new graph_node(id);

nodeList.add(0, node);

return nodeList.get(0);

}

// adding edge from id1 to id2

// if either of these does not exist then create and add

public void addEdge(int id1, int id2)

{

// search for id1 and id2

boolean node1_found = false, node2_found = false;

graph_node node1 = null, node2 = null;

for (int i = 0; i < nodeList.size(); i++)

{

if (nodeList.get(i).node_id == id1)

{

node1_found = true;

node1 = nodeList.get(i);

}

if (nodeList.get(i).node_id == id2)

{

node2_found = true;

node2 = nodeList.get(i);

}

if (node1_found && node2_found) break;

}

if (!node1_found)

{

node1 = this.addNode(id1);

}

if (!node2_found)

{

node2 = this.addNode(id2);

}

graph_node temp = new graph_node(id2);

temp.next = node1.next;

node1.next = temp;

return;

}

public graph_node getNode(int id)

{

for(int i = 0; i < nodeList.size(); i++)

{

if (id == nodeList.get(i).node_id)

{

return nodeList.get(i);

}

}

return null;

}

public void printGraph()

{

for (int i = 0; i < nodeList.size(); i++)

{

graph_node temp = nodeList.get(i);

while (temp != null)

{

System.out.print(" ->"+temp.node_id);

temp = temp.next;

}

System.out.println();

}

}

}