Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
F
founder_vue
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
常超
founder_vue
Commits
b9515c2f
Commit
b9515c2f
authored
Apr 15, 2022
by
lp784568205
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
修改报错
parent
9ab22965
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
36 additions
and
37 deletions
+36
-37
src/views/ceshi/ceshi0225.vue
+36
-37
No files found.
src/views/ceshi/ceshi0225.vue
View file @
b9515c2f
...
@@ -692,7 +692,6 @@ export default {
...
@@ -692,7 +692,6 @@ export default {
// this.dataAll.gen = [ ...res.data.rows,...this.dataAll.gen ]
// this.dataAll.gen = [ ...res.data.rows,...this.dataAll.gen ]
// }
// }
// })
// })
},
},
async
mounted
()
{
async
mounted
()
{
this
.
setGraphData
();
this
.
setGraphData
();
...
@@ -932,10 +931,10 @@ export default {
...
@@ -932,10 +931,10 @@ export default {
});
});
for
(
let
i
=
0
;
i
<
linkarr
.
length
;
i
++
)
{
for
(
let
i
=
0
;
i
<
linkarr
.
length
;
i
++
)
{
let
j
=
i
++
;
let
j
=
i
++
;
let
a
=
linkarr
[
i
].
f
or
m
;
let
a
=
linkarr
[
i
].
f
ro
m
;
let
b
=
linkarr
[
i
].
to
;
let
b
=
linkarr
[
i
].
to
;
for
(
let
j
=
i
+
1
;
j
<
linkarr
.
length
;
j
++
)
{
for
(
let
j
=
i
+
1
;
j
<
linkarr
.
length
;
j
++
)
{
let
c
=
linkarr
[
j
].
f
or
m
;
let
c
=
linkarr
[
j
].
f
ro
m
;
let
d
=
linkarr
[
j
].
to
;
let
d
=
linkarr
[
j
].
to
;
if
((
a
==
c
&&
b
==
d
)
||
(
a
==
d
&&
b
==
c
))
{
if
((
a
==
c
&&
b
==
d
)
||
(
a
==
d
&&
b
==
c
))
{
linkarr
.
splice
(
j
,
1
);
linkarr
.
splice
(
j
,
1
);
...
@@ -1092,10 +1091,10 @@ export default {
...
@@ -1092,10 +1091,10 @@ export default {
});
});
for
(
let
i
=
0
;
i
<
linkarr
.
length
;
i
++
)
{
for
(
let
i
=
0
;
i
<
linkarr
.
length
;
i
++
)
{
let
j
=
i
++
;
let
j
=
i
++
;
let
a
=
linkarr
[
i
].
f
or
m
;
let
a
=
linkarr
[
i
].
f
ro
m
;
let
b
=
linkarr
[
i
].
to
;
let
b
=
linkarr
[
i
].
to
;
for
(
let
j
=
i
+
1
;
j
<
linkarr
.
length
;
j
++
)
{
for
(
let
j
=
i
+
1
;
j
<
linkarr
.
length
;
j
++
)
{
let
c
=
linkarr
[
j
].
f
or
m
;
let
c
=
linkarr
[
j
].
f
ro
m
;
let
d
=
linkarr
[
j
].
to
;
let
d
=
linkarr
[
j
].
to
;
if
((
a
==
c
&&
b
==
d
)
||
(
a
==
d
&&
b
==
c
))
{
if
((
a
==
c
&&
b
==
d
)
||
(
a
==
d
&&
b
==
c
))
{
linkarr
.
splice
(
j
,
1
);
linkarr
.
splice
(
j
,
1
);
...
@@ -1311,17 +1310,17 @@ export default {
...
@@ -1311,17 +1310,17 @@ export default {
});
});
});
});
for
(
let
i
=
0
;
i
<
linkarr
.
length
;
i
++
)
{
for
(
let
i
=
0
;
i
<
linkarr
.
length
;
i
++
)
{
let
j
=
i
++
;
let
j
=
i
++
;
let
a
=
linkarr
[
i
].
for
m
;
let
a
=
linkarr
[
i
].
fro
m
;
let
b
=
linkarr
[
i
].
to
;
let
b
=
linkarr
[
i
].
to
;
for
(
let
j
=
i
+
1
;
j
<
linkarr
.
length
;
j
++
)
{
for
(
let
j
=
i
+
1
;
j
<
linkarr
.
length
;
j
++
)
{
let
c
=
linkarr
[
j
].
for
m
;
let
c
=
linkarr
[
j
].
fro
m
;
let
d
=
linkarr
[
j
].
to
;
let
d
=
linkarr
[
j
].
to
;
if
((
a
==
c
&&
b
==
d
)
||
(
a
==
d
&&
b
==
c
))
{
if
((
a
==
c
&&
b
==
d
)
||
(
a
==
d
&&
b
==
c
))
{
linkarr
.
splice
(
j
,
1
);
linkarr
.
splice
(
j
,
1
);
}
}
}
}
}
}
this
.
$refs
.
seeksRelationGraph
.
appendJsonData
(
this
.
$refs
.
seeksRelationGraph
.
appendJsonData
(
{
{
nodes
:
nodearr
,
nodes
:
nodearr
,
...
@@ -1442,17 +1441,17 @@ export default {
...
@@ -1442,17 +1441,17 @@ export default {
});
});
});
});
for
(
let
i
=
0
;
i
<
linkarr
.
length
;
i
++
)
{
for
(
let
i
=
0
;
i
<
linkarr
.
length
;
i
++
)
{
let
j
=
i
++
;
let
j
=
i
++
;
let
a
=
linkarr
[
i
].
for
m
;
let
a
=
linkarr
[
i
].
fro
m
;
let
b
=
linkarr
[
i
].
to
;
let
b
=
linkarr
[
i
].
to
;
for
(
let
j
=
i
+
1
;
j
<
linkarr
.
length
;
j
++
)
{
for
(
let
j
=
i
+
1
;
j
<
linkarr
.
length
;
j
++
)
{
let
c
=
linkarr
[
j
].
for
m
;
let
c
=
linkarr
[
j
].
fro
m
;
let
d
=
linkarr
[
j
].
to
;
let
d
=
linkarr
[
j
].
to
;
if
((
a
==
c
&&
b
==
d
)
||
(
a
==
d
&&
b
==
c
))
{
if
((
a
==
c
&&
b
==
d
)
||
(
a
==
d
&&
b
==
c
))
{
linkarr
.
splice
(
j
,
1
);
linkarr
.
splice
(
j
,
1
);
}
}
}
}
}
}
this
.
$refs
.
seeksRelationGraph
.
appendJsonData
(
this
.
$refs
.
seeksRelationGraph
.
appendJsonData
(
{
{
nodes
:
nodearr
,
nodes
:
nodearr
,
...
@@ -1964,17 +1963,17 @@ export default {
...
@@ -1964,17 +1963,17 @@ export default {
});
});
});
});
for
(
let
i
=
0
;
i
<
linkarr
.
length
;
i
++
)
{
for
(
let
i
=
0
;
i
<
linkarr
.
length
;
i
++
)
{
let
j
=
i
++
;
let
j
=
i
++
;
let
a
=
linkarr
[
i
].
form
;
let
a
=
linkarr
[
i
].
from
;
let
b
=
linkarr
[
i
].
to
;
let
b
=
linkarr
[
i
].
to
;
for
(
let
j
=
i
+
1
;
j
<
linkarr
.
length
;
j
++
)
{
for
(
let
j
=
i
+
1
;
j
<
linkarr
.
length
;
j
++
)
{
let
c
=
linkarr
[
j
].
form
;
let
c
=
linkarr
[
j
].
from
;
let
d
=
linkarr
[
j
].
to
;
let
d
=
linkarr
[
j
].
to
;
if
((
a
==
c
&&
b
==
d
)
||
(
a
==
d
&&
b
==
c
))
{
if
((
a
==
c
&&
b
==
d
)
||
(
a
==
d
&&
b
==
c
))
{
linkarr
.
splice
(
j
,
1
);
linkarr
.
splice
(
j
,
1
);
}
}
}
}
}
}
this
.
$refs
.
seeksRelationGraph
.
appendJsonData
(
this
.
$refs
.
seeksRelationGraph
.
appendJsonData
(
{
{
nodes
:
nodearr
,
nodes
:
nodearr
,
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment