从流程图到测试路径：基于图论的自动化分支拆解与用例生成

{
  "nodes": [{"id": "n1", "label": "输入手机号"}, ...],
  "edges": [
    {"from": "n1", "to": "n2", "condition": "手机号有效?"},
    {"from": "n1", "to": "n1", "condition": "手机号无效?"} // ← 这是一个循环！
  ]
}

import networkx as nx

def build_graph_from_json(data):
    G = nx.DiGraph()  # 创建有向图

    # 添加节点
    for node in data["nodes"]:
        G.add_node(node["id"], label=node["label"])

    # 添加带条件的边
    for edge in data["edges"]:
        G.add_edge(
            edge["from"], 
            edge["to"], 
            condition=edge["condition"]
        )

    return G

def find_entry_exit_nodes(G):
    entry_nodes = [n for n, d in G.in_degree() if d == 0]
    exit_nodes = [n for n, d in G.out_degree() if d == 0]

    # 补充：显式标记的出口（如标签含"成功"）
    for node, attr in G.nodes(data=True):
        if "成功" in attr["label"] or "失败" in attr["label"]:
            if node not in exit_nodes:
                exit_nodes.append(node)

    return entry_nodes, exit_nodes

def find_all_paths_with_loop(G, entry, exits, max_loops=3):
    all_paths = []

    def dfs(current, path, visited_count):
        # 终止条件1: 到达出口
        if current in exits:
            all_paths.append(path.copy())
            return

        # 终止条件2: 循环超限
        if visited_count.get(current, 0) > max_loops:
            return

        # 更新访问计数
        visited_count[current] = visited_count.get(current, 0) + 1

        # 递归探索邻居
        for neighbor in G.successors(current):
            path.append(neighbor)
            dfs(neighbor, path, visited_count.copy())  # 传递副本避免污染
            path.pop()  # 回溯

    dfs(entry, [entry], {})
    return all_paths

# 按路径长度排序，取前 N 条
all_paths.sort(key=len)
selected_paths = all_paths[:10]  # 根据实际需求调整

NODE_ACTIONS = {
    "输入手机号": lambda page: page.input_phone("13800138000"),
    "发送验证码": lambda page: page.click_send_code(),
    "验证成功": lambda page: assert page.is_on_success_page()
}

def generate_test_case(path_id, path, G):
    code_lines = [f"def test_path_{path_id}():", '    """']

    # 生成路径描述
    labels = [G.nodes[n]["label"] for n in path]
    code_lines.append(f"    自动路径: {' -> '.join(labels)}")
    code_lines.append('    """')

    # 生成操作与断言
    for node_id in path:
        label = G.nodes[node_id]["label"]
        if label in NODE_ACTIONS:
            action = NODE_ACTIONS[label].__code__.co_consts[0]  # 简化示例
            code_lines.append(f"    {action}")
        else:
            # 默认操作：记录日志
            code_lines.append(f"    # 执行: {label}")

    return "\n".join(code_lines)

# 在路径遍历时，检查边的 condition
for i in range(len(path)-1):
    edge_data = G[path[i]][path[i+1]]
    condition = edge_data["condition"]

    if "正确" in condition:
        code_lines.append("    assert page.get_code_status() == 'valid'")
    elif "无效" in condition:
        code_lines.append("    assert page.has_error('验证码错误')")

{
  "nodes": [
    {"id": "s1", "label": "ACC OFF"},
    {"id": "s2", "label": "ACC STANDBY"},
    {"id": "s3", "label": "ACC ACTIVE"}
  ],
  "edges": [
    {"from": "s1", "to": "s2", "condition": "按下 ACC 按钮"},
    {"from": "s2", "to": "s3", "condition": "车速 > 30km/h"},
    {"from": "s3", "to": "s2", "condition": "车速 < 30km/h"} // ← 循环
  ]
}

# 自动生成
import pytest
from pages.acc_page import ACCPage

@pytest.fixture
def acc_page():
    return ACCPage()