用qt写一个DFS路径搜索算法

好的，以下是一个用Qt编写的DFS路径搜索算法的示例代码：

#include <QtWidgets>

class GraphWidget : public QGraphicsView
{
public:
    GraphWidget(QWidget *parent = nullptr)
        : QGraphicsView(parent)
    {
        QGraphicsScene *scene = new QGraphicsScene(this);
        setScene(scene);

        // Add nodes to the scene
        for (int i = 0; i < 5; ++i) {
            QGraphicsEllipseItem *node = new QGraphicsEllipseItem(-25, -25, 50, 50);
            node->setPos(QPointF(qrand() % 400, qrand() % 400));
            scene->addItem(node);
            m_nodes.append(node);
        }

        // Add edges to the scene
        for (int i = 0; i < m_nodes.size(); ++i) {
            for (int j = i + 1; j < m_nodes.size(); ++j) {
                QGraphicsLineItem *edge = new QGraphicsLineItem(m_nodes[i]->pos(), m_nodes[j]->pos());
                scene->addItem(edge);
                m_edges.append(edge);
            }
        }

        // Set up the timer for the DFS algorithm
        m_timer.setInterval(500);
        connect(&m_timer, &QTimer::timeout, this, &GraphWidget::dfs);
        m_timer.start();
    }

private:
    QList<QGraphicsEllipseItem *> m_nodes;
    QList<QGraphicsLineItem *> m_edges;
    QSet<QGraphicsEllipseItem *> m_visited;
    QTimer m_timer;

    void dfs()
    {
        QGraphicsEllipseItem *node = nullptr;

        // Find an unvisited node
        for (QGraphicsEllipseItem *n : m_nodes) {
            if (!m_visited.contains(n)) {
                node = n;
                break;
            }
        }

        if (!node) {
            // All nodes have been visited
            m_timer.stop();
            return;
        }

        // Mark the node as visited
        m_visited.insert(node);
        node->setBrush(Qt::green);

        // Visit the node's neighbors
        for (QGraphicsLineItem *edge : m_edges) {
            if (edge->line().p1() == node->pos()) {
                QGraphicsEllipseItem *neighbor = nullptr;
                for (QGraphicsEllipseItem *n : m_nodes) {
                    if (n->pos() == edge->line().p2()) {
                        neighbor = n;
                        break;
                    }
                }
                if (neighbor && !m_visited.contains(neighbor)) {
                    dfs();
                }
            }
        }
    }
};

int main(int argc, char *argv[])
{
    QApplication app(argc, argv);
    GraphWidget widget;
    widget.show();
    return app.exec();
}

这个示例代码演示了如何使用Qt绘制一个简单的图形，并使用DFS算法搜索图形中的所有节点。在这个示例中，我们使用QGraphicsScene和QGraphicsView来绘制图形，使用QGraphicsEllipseItem和QGraphicsLineItem来表示节点和边，使用QTimer来控制DFS算法的执行。