FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
DataMiningAlgorithm/GraphMining/DataMining_GSpan/Graph.java at master · yangjava/DataMiningAlgorithm · GitHub
yangjava
DataMiningAlgorithm
Repository navigation
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
DataMiningAlgorithm
/
GraphMining
/
DataMining_GSpan
/
Graph.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
155 lines (135 loc) · 3.41 KB
Breadcrumbs
DataMiningAlgorithm
/
GraphMining
/
DataMining_GSpan
/
Graph.java
Copy path
File metadata and controls
155 lines (135 loc) · 3.41 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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
package
DataMining_GSpan
;
import
java
.
util
.
ArrayList
;
/**
* 图结构类
*
* @author lyq
*
*/
public
class
Graph
{
// 图节点标号组
ArrayList
<
Integer
>
nodeLabels
;
// 图的边标号组
ArrayList
<
ArrayList
<
Integer
>>
edgeLabels
;
// 边2头的节点id号,在这里可以理解为下标号
ArrayList
<
ArrayList
<
Integer
>>
edgeNexts
;
public
Graph
() {
nodeLabels
=
new
ArrayList
<>();
edgeLabels
=
new
ArrayList
<>();
edgeNexts
=
new
ArrayList
<>();
}
public
ArrayList
<
Integer
>
getNodeLabels
() {
return
nodeLabels
;
}
public
void
setNodeLabels
(
ArrayList
<
Integer
>
nodeLabels
) {
this
.
nodeLabels
=
nodeLabels
;
}
/**
* 判断图中是否存在某条边
*
* @param x
* 边的一端的节点标号
* @param a
* 边的标号
* @param y
* 边的另外一端节点标号
* @return
*/
public
boolean
hasEdge
(
int
x
,
int
a
,
int
y
) {
boolean
isContained
=
false
;
int
t
;
for
(
int
i
=
0
;
i
<
nodeLabels
.
size
();
i
++) {
// 先寻找2个端点标号,t代表找到的点的另外一个端点标号
if
(
nodeLabels
.
get
(
i
) ==
x
) {
t
=
y
;
}
else
if
(
nodeLabels
.
get
(
i
) ==
y
) {
t
=
x
;
}
else
{
continue
;
}
for
(
int
j
=
0
;
j
<
edgeNexts
.
get
(
i
).
size
();
j
++) {
// 从此端点的所连接的点去比较对应的点和边
if
(
edgeLabels
.
get
(
i
).
get
(
j
) ==
a
&&
nodeLabels
.
get
(
edgeNexts
.
get
(
i
).
get
(
j
)) ==
t
) {
isContained
=
true
;
return
isContained
;
}
}
}
return
isContained
;
}
/**
* 在图中移除某个边
*
* @param x
* 边的某端的一个点标号
* @param a
* 边的标号
* @param y
* 边的另一端的一个点标号
*/
public
void
removeEdge
(
int
x
,
int
a
,
int
y
) {
int
t
;
for
(
int
i
=
0
;
i
<
nodeLabels
.
size
();
i
++) {
// 先寻找2个端点标号,t代表找到的点的另外一个端点标号
if
(
nodeLabels
.
get
(
i
) ==
x
) {
t
=
y
;
}
else
if
(
nodeLabels
.
get
(
i
) ==
y
) {
t
=
x
;
}
else
{
continue
;
}
for
(
int
j
=
0
;
j
<
edgeNexts
.
get
(
i
).
size
();
j
++) {
// 从此端点的所连接的点去比较对应的点和边
if
(
edgeLabels
.
get
(
i
).
get
(
j
) ==
a
&&
nodeLabels
.
get
(
edgeNexts
.
get
(
i
).
get
(
j
)) ==
t
) {
int
id
;
// 在连接的点中去除该点
edgeLabels
.
get
(
i
).
remove
(
j
);
id
=
edgeNexts
.
get
(
i
).
get
(
j
);
edgeNexts
.
get
(
i
).
remove
(
j
);
for
(
int
k
=
0
;
k
<
edgeNexts
.
get
(
id
).
size
();
k
++) {
if
(
edgeNexts
.
get
(
id
).
get
(
k
) ==
i
) {
edgeNexts
.
get
(
id
).
remove
(
k
);
break
;
}
}
break
;
}
}
}
}
/**
* 根据图数据构造一个图
*
* @param gd
* 图数据
* @return
*/
public
Graph
constructGraph
(
GraphData
gd
) {
Graph
graph
=
new
Graph
();
// 构造一个图需要知道3点，1.图中有哪些点2.图中的每个点周围连着哪些点3.每个点周围连着哪些边
for
(
int
i
=
0
;
i
<
gd
.
getNodeVisibles
().
size
();
i
++) {
if
(
gd
.
getNodeVisibles
().
get
(
i
)) {
graph
.
getNodeLabels
().
add
(
gd
.
getNodeLabels
().
get
(
i
));
}
// 添加对应id下的集合
// id节点后有多少相连的边的标号
graph
.
edgeLabels
.
add
(
new
ArrayList
<
Integer
>());
// id节点后有多少相连的节点的id
graph
.
edgeNexts
.
add
(
new
ArrayList
<
Integer
>());
}
for
(
int
i
=
0
;
i
<
gd
.
getEdgeLabels
().
size
();
i
++) {
if
(
gd
.
getEdgeVisibles
().
get
(
i
)) {
// 在此后面添加一个边标号
graph
.
edgeLabels
.
get
(
gd
.
getEdgeX
().
get
(
i
)).
add
(
gd
.
getEdgeLabels
().
get
(
i
));
graph
.
edgeLabels
.
get
(
gd
.
getEdgeY
().
get
(
i
)).
add
(
gd
.
getEdgeLabels
().
get
(
i
));
graph
.
edgeNexts
.
get
(
gd
.
getEdgeX
().
get
(
i
)).
add
(
gd
.
getEdgeY
().
get
(
i
));
graph
.
edgeNexts
.
get
(
gd
.
getEdgeY
().
get
(
i
)).
add
(
gd
.
getEdgeX
().
get
(
i
));
}
}
return
graph
;
}
}
Back
|
FazBrowse Home
|
New Git URL