Iligemate ends
This commit is contained in:
parent
a28c7cdddf
commit
9f1420309b
@ -7,7 +7,7 @@
|
|||||||
</div>
|
</div>
|
||||||
</h1>
|
</h1>
|
||||||
<div id="panel" width="100%">
|
<div id="panel" width="100%">
|
||||||
<el-row v-if="results"><h3>Check not run</h3></el-row>
|
<el-row v-if="!results || results.length === 0 "><h3>Check not run</h3></el-row>
|
||||||
<el-row v-for="(result,idx) in results" :key="idx">
|
<el-row v-for="(result,idx) in results" :key="idx">
|
||||||
<el-col :span="2" v-if="result.id<0"><span class="label"><i class="far fa-check-circle"></i></span></el-col>
|
<el-col :span="2" v-if="result.id<0"><span class="label"><i class="far fa-check-circle"></i></span></el-col>
|
||||||
<el-col :span="2" v-if="result.id>=0"><span class="label"><i class="fas fa-exclamation-triangle"></i></span></el-col>
|
<el-col :span="2" v-if="result.id>=0"><span class="label"><i class="fas fa-exclamation-triangle"></i></span></el-col>
|
||||||
|
@ -122,10 +122,10 @@ async function checkGroundnet(data) {
|
|||||||
node2[Number(element.start)] = 1;
|
node2[Number(element.start)] = 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
node1 = bidirectionalGraph[element.start];
|
var node3 = bidirectionalGraph[element.start];
|
||||||
node2 = bidirectionalGraph[element.end];
|
var node4 = bidirectionalGraph[element.end];
|
||||||
node1[Number(element.end)] = 1;
|
node3[Number(element.end)] = 1;
|
||||||
node2[Number(element.start)] = 1;
|
node4[Number(element.start)] = 1;
|
||||||
});
|
});
|
||||||
var isLegitEnd = function(v) {
|
var isLegitEnd = function(v) {
|
||||||
if( Object.keys(bidirectionalGraph[v]).length <= 1 ) {
|
if( Object.keys(bidirectionalGraph[v]).length <= 1 ) {
|
||||||
@ -252,7 +252,7 @@ async function checkGroundnet(data) {
|
|||||||
if (runwayNodes.length === 0) {
|
if (runwayNodes.length === 0) {
|
||||||
notOkNodes.push({ id: 0, message: 'No Runwaynodes' });
|
notOkNodes.push({ id: 0, message: 'No Runwaynodes' });
|
||||||
}
|
}
|
||||||
var allEnds = Object.entries(directionalGraph).filter(
|
var allEnds = Object.entries(bidirectionalGraph).filter(
|
||||||
(v, i) => Object.keys(v[1]).length <= 1
|
(v, i) => Object.keys(v[1]).length <= 1
|
||||||
);
|
);
|
||||||
// Ends that are not on Runway and not a Parking or Pushback
|
// Ends that are not on Runway and not a Parking or Pushback
|
||||||
|
Loading…
Reference in New Issue
Block a user