JS代码怎么在易语言里运行,用精易的运行JS代码执行起来 - 精易论坛

const townRelations = `洛阳-敦煌,28,129|嵩山,159,287|雁南,287,127<br />
苏州-镜湖,32,162|西湖,182,287|太湖,182,32<br />
楼兰-大苑,20,143|塔里木,161,307<br />
大理-剑阁,27,151|洱海,159,287|无量山,291,151<br />
南诏-苗疆,107,286|石林,281,45<br />
南海-琼州,287,175|武夷,32,36<br />
长白山-黄龙府,287,72|草原,32,269<br />
束河古镇-苍山,26,286<br />
琼州-南海,280,287<br />
大苑-楼兰,194,233<br />
嵩山-洛阳,33,55|太湖,287,247<br />
太湖-嵩山,91,23|苏州,216,281<br />
敦煌-洛阳,286,144|剑阁,231,286<br />
剑阁-敦煌,105,38|大理,35,287<br />
镜湖-苏州,286,43|武当山,28,234|无量山,36,286<br />
无量山-镜湖,283,77|大理,32,175 <br />
草原-长白山,271,32|雁南,287,257|水晶洞,64,194|辽西,119,32<br />
辽西-草原,61,297<br />
水晶洞-草原,231,236<br />
雁南-草原,32,57|摩崖洞,34,39|雁北,247,32|洛阳,265,287<br />
雁北-雁南,229,280<br />
摩崖洞-雁南,22,235<br />
黄龙府-长白山,48,288<br />
苍山-束河古镇,164,55|洱海,287,57<br />
洱海-苍山,32,155|石林,32,281<br />
武夷-南海,248,287|梅岭,284,181|黄龙府,96,44|西湖,36,32<br />
西湖-武夷,265,286|苏州,33,51|夜西湖,92,43|山洞船坞,42,227<br />
黄龙府-武夷,110,229<br />
梅岭-武夷,32,274        <br />
琼州-南海,280,287<br />
石林-南诏,33,250|洱海,269,128|玉溪,113,34|盐湖,39,274<br />
苗疆-南诏,69,32<br />
玉溪-石林,35,46`;<br />
<br />
function parseTownRelations(townRelations) {<br />
    const relations = {};<br />
    const lines = townRelations.trim().split('\n');<br />
    lines.forEach(line => {<br />
        const [source, targets] = line.split('-');<br />
        if (targets) {<br />
            const branches = targets.split('|');<br />
            relations[source] = branches.map(branch => {<br />
                const [target, , ] = branch.split(',');<br />
                return target;<br />
            });<br />
        } else {<br />
            relations[source] = [];<br />
        }<br />
    });<br />
    return relations;<br />
}<br />
<br />
function findPath(graph, start, end, path = [], visited = new Set()) {<br />
    path.push(start);<br />
    visited.add(start);<br />
    if (start === end) {<br />
        return Array.from(path.join(' -> '));<br />
    }<br />
    const neighbors = graph[start];<br />
        console.log('A3--:', neighbors); <br />
    if (neighbors) {<br />
        for (const neighbor of neighbors) {<br />
            if (!visited.has(neighbor)) {<br />
                findPath(graph, neighbor, end, path.slice(), visited);<br />
            }<br />
        }<br />
    }<br />
}<br />
const townGraph = parseTownRelations(townRelations);<br />
findPath(townGraph, '洛阳', '辽西');