用javafx实现最短路径可视化程序，要求可自定义节点数、路径长度、起止节点

以下是一个简单的JavaFX最短路径可视化程序的示例代码：

import javafx.application.Application;
import javafx.geometry.Insets;
import javafx.scene.Scene;
import javafx.scene.control.Button;
import javafx.scene.control.Label;
import javafx.scene.control.TextField;
import javafx.scene.layout.BorderPane;
import javafx.scene.layout.HBox;
import javafx.scene.layout.Pane;
import javafx.scene.paint.Color;
import javafx.scene.shape.Circle;
import javafx.scene.shape.Line;
import javafx.stage.Stage;

import java.util.ArrayList;
import java.util.List;

public class ShortestPathVisualization extends Application {
    private int numNodes;
    private int pathLength;
    private int startNode;
    private int endNode;

    private List<Circle> nodes;
    private List<Line> edges;

    public static void main(String[] args) {
        launch(args);
    }

    @Override
    public void start(Stage primaryStage) {
        primaryStage.setTitle("Shortest Path Visualization");

        // 创建布局
        BorderPane root = new BorderPane();
        Pane canvas = new Pane();
        HBox controlBox = new HBox();
        controlBox.setPadding(new Insets(10));
        controlBox.setSpacing(10);

        // 创建输入框和按钮
        TextField nodeField = new TextField();
        nodeField.setPromptText("节点数");
        TextField lengthField = new TextField();
        lengthField.setPromptText("路径长度");
        TextField startField = new TextField();
        startField.setPromptText("起始节点");
        TextField endField = new TextField();
        endField.setPromptText("目标节点");
        Button generateButton = new Button("生成图");
        Button visualizeButton = new Button("可视化");

        // 设置按钮点击事件
        generateButton.setOnAction(event -> {
            numNodes = Integer.parseInt(nodeField.getText());
            pathLength = Integer.parseInt(lengthField.getText());
            startNode = Integer.parseInt(startField.getText());
            endNode = Integer.parseInt(endField.getText());

            generateGraph();
        });

        visualizeButton.setOnAction(event -> {
            calculateShortestPath();
            visualizeShortestPath();
        });

        // 将输入框和按钮添加到控制面板
        controlBox.getChildren().addAll(
                new Label("节点数:"), nodeField,
                new Label("路径长度:"), lengthField,
                new Label("起始节点:"), startField,
                new Label("目标节点:"), endField,
                generateButton, visualizeButton
        );

        // 将画布和控制面板添加到布局
        root.setCenter(canvas);
        root.setBottom(controlBox);

        // 创建场景并显示舞台
        Scene scene = new Scene(root, 800, 600);
        primaryStage.setScene(scene);
        primaryStage.show();
    }

    private void generateGraph() {
        // 生成节点
        nodes = new ArrayList<>();
        for (int i = 0; i < numNodes; i++) {
            Circle node = new Circle(20);
            node.setFill(Color.BLUE);
            node.setTranslateX(Math.random() * 600 + 100);
            node.setTranslateY(Math.random() * 400 + 100);
            nodes.add(node);
        }

        // 生成边
        edges = new ArrayList<>();
        for (int i = 0; i < numNodes; i++) {
            for (int j = i + 1; j < numNodes; j++) {
                Line edge = new Line();
                edge.setStartX(nodes.get(i).getTranslateX());
                edge.setStartY(nodes.get(i).getTranslateY());
                edge.setEndX(nodes.get(j).getTranslateX());
                edge.setEndY(nodes.get(j).getTranslateY());
                edges.add(edge);
            }
        }
    }

    private void calculateShortestPath() {
        // TODO: 使用最短路径算法计算起始节点到目标节点的最短路径
    }

    private void visualizeShortestPath() {
        // 绘制节点和边
        Pane canvas = (Pane) nodes.get(0).getParent();
        canvas.getChildren().clear();
        canvas.getChildren().addAll(edges);
        canvas.getChildren().addAll(nodes);

        // 绘制最短路径
        // TODO: 根据最短路径结果，将路径上的边标记为红色或加粗等
    }
}

请注意，这只是一个简单的示例代码，其中的最短路径计算部分还没有实现。你需要根据自己选择的最短路径算法来完成calculateShortestPath()方法，并在visualizeShortestPath()方法中根据计算结果绘制最短路径。

此外，你还可以根据自己的需求对界面进行进一步的美化和交互功能的添加。希望对你有所帮助！

在上面提供的示例代码中，calculateShortestPath()方法和visualizeShortestPath()方法需要根据具体的最短路径算法进行实现。下面是一个使用Dijkstra算法实现最短路径计算和可视化的示例：

import javafx.scene.paint.Color;

import java.util.*;

// ...

private List<List<Integer>> adjacencyList;
private double[] distance;
private int[] previous;

private void calculateShortestPath() {
    // 初始化邻接表和距离数组
    adjacencyList = new ArrayList<>();
    for (int i = 0; i < numNodes; i++) {
        adjacencyList.add(new ArrayList<>());
    }
    distance = new double[numNodes];
    previous = new int[numNodes];

    // 构建邻接表
    for (int i = 0; i < edges.size(); i++) {
        Line edge = edges.get(i);
        int startNode = nodes.indexOf(edge.getStartNode());
        int endNode = nodes.indexOf(edge.getEndNode());
        adjacencyList.get(startNode).add(endNode);
        adjacencyList.get(endNode).add(startNode);
    }

    // 初始化距离数组和前驱数组
    Arrays.fill(distance, Double.POSITIVE_INFINITY);
    Arrays.fill(previous, -1);
    distance[startNode] = 0;

    // 使用Dijkstra算法计算最短路径
    PriorityQueue<Integer> queue = new PriorityQueue<>(Comparator.comparingDouble(node -> distance[node]));
    queue.offer(startNode);

    while (!queue.isEmpty()) {
        int currentNode = queue.poll();

        for (int neighbor : adjacencyList.get(currentNode)) {
            double newDistance = distance[currentNode] + calculateDistance(nodes.get(currentNode), nodes.get(neighbor));
            if (newDistance < distance[neighbor]) {
                distance[neighbor] = newDistance;
                previous[neighbor] = currentNode;
                queue.offer(neighbor);
            }
        }
    }
}

private void visualizeShortestPath() {
    // 绘制节点和边
    Pane canvas = (Pane) nodes.get(0).getParent();
    canvas.getChildren().clear();
    canvas.getChildren().addAll(edges);
    canvas.getChildren().addAll(nodes);

    // 绘制最短路径
    int currentNode = endNode;
    while (currentNode != -1) {
        int previousNode = previous[currentNode];
        if (previousNode != -1) {
            Line edge = findEdge(nodes.get(previousNode), nodes.get(currentNode));
            if (edge != null) {
                edge.setStroke(Color.RED);
                edge.setStrokeWidth(3);
            }
        }
        currentNode = previousNode;
    }
}

private double calculateDistance(Circle node1, Circle node2) {
    double x1 = node1.getTranslateX();
    double y1 = node1.getTranslateY();
    double x2 = node2.getTranslateX();
    double y2 = node2.getTranslateY();
    return Math.sqrt(Math.pow(x2 - x1, 2) + Math.pow(y2 - y1, 2));
}

private Line findEdge(Circle startNode, Circle endNode) {
    for (Line edge : edges) {
        if (edge.getStartNode().equals(startNode) && edge.getEndNode().equals(endNode)) {
            return edge;
        }
    }
    return null;
}

在上述代码中，calculateShortestPath()方法使用Dijkstra算法计算起始节点到目标节点的最短路径。它首先构建了一个邻接表来表示图的连接关系，然后使用优先队列来选择下一个要处理的节点，并更新距离数组和前驱数组。最后，visualizeShortestPath()方法根据最短路径结果，将路径上的边标记为红色并加粗。

请注意，calculateDistance()方法用于计算两个节点之间的距离，findEdge()方法用于查找连接两个节点的边。你可以根据自己的需求进行调整和扩展。

希望这个示例能帮助你实现最短路径计算和可视化功能！

非常抱歉，AI回答失败（可能您刷新了当前页面导致会话终止，无法生成完整的内容，结果导致失败）。

注意：内容生成过程中，请勿离开或刷新页面；如遇其他原因可联系管理员。

非常抱歉，AI回答失败（可能您刷新了当前页面导致会话终止，无法生成完整的内容，结果导致失败）。

注意：内容生成过程中，请勿离开或刷新页面；如遇其他原因可联系管理员。

It seems that you are trying to call the getStartNode() method on an object of type Line. However, the Line class in JavaFX does not have a getStartNode() method.

If you are working with a custom Line class that has a getStartNode() method, make sure that you have properly defined and implemented this method in your class.

If you are trying to access the starting point of a Line in JavaFX, you can use the getStartX() and getStartY() methods to get the coordinates of the starting point.

Here's an example of how you can retrieve the starting coordinates of a Line in JavaFX:

Line line = new Line(0, 0, 100, 100); // Example Line object

double startX = line.getStartX();
double startY = line.getStartY();

System.out.println("Start coordinates: (" + startX + ", " + startY + ")");

Please make sure to adjust the code according to your specific requirements and the structure of your program.