Create app.py

app.py

@@ -0,0 +1,109 @@
+import streamlit as st
+import json
+
+st.set_page_config(page_title="家族亲戚关系网查询系统", layout="wide")
+st.title("🌳 家族亲戚关系网查询系统")
+
+@st.cache_data
+def load_data(file_path):
+    data = []
+    try:
+        with open(file_path, 'r', encoding='utf-8') as f:
+            for line in f:
+                line = line.strip()
+                if not line: continue
+                try:
+                    item = json.loads(line)
+                    # 严格统一字段：n, s, f, m, sp, info
+                    clean_item = {
+                        "n": str(item.get("n", "未知")),
+                        "s": str(item.get("s", "未知")),
+                        "f": str(item.get("f", "")),
+                        "m": str(item.get("m", "")),
+                        "sp": item.get("sp", []) if isinstance(item.get("sp"), list) else [item.get("sp")] if item.get("sp") else [],
+                        "info": str(item.get("info", ""))
+                    }
+                    data.append(clean_item)
+                except: continue
+    except Exception as e:
+        st.error(f"加载失败: {e}")
+    return data
+
+class FamilySystem:
+    def __init__(self, data):
+        self.data = data
+        self.nodes = {n['n']: n for n in data}
+
+    def get_siblings(self, name):
+        node = self.nodes.get(name)
+        if not node or not node['f']: return []
+        # 同父即是亲兄妹
+        return [n for n in self.data if n['f'] == node['f'] and n['n'] != name]
+
+    def get_children(self, name):
+        return [n for n in self.data if n['f'] == name or n['m'] == name]
+
+    def build_chain(self, ancestor, target):
+        """生成路径：A(父亲)→B(父亲)→C"""
+        if ancestor == target: return ancestor
+        curr = self.nodes.get(target)
+        if not curr: return target
+        
+        parent = curr['f'] if curr['f'] in self.nodes else curr['m'] if curr['m'] in self.nodes else None
+        if not parent: return target
+        
+        rel = "父亲" if curr['f'] == parent else "母亲"
+        if parent == ancestor:
+            return f"{ancestor}({rel})→{target}"
+        
+        return f"{self.build_chain(ancestor, parent)}({rel})→{target}"
+
+# 加载数据
+family_data = load_data("family_data.jsonl")
+
+if family_data:
+    tree = FamilySystem(family_data)
+    name_list = [n['n'] for n in family_data]
+    
+    query_name = st.sidebar.selectbox("🔎 输入姓名开始查询", name_list)
+    
+    if query_name:
+        node = tree.nodes[query_name]
+        st.header(f"人物核心档案：{query_name}")
+        
+        t1, t2, t3 = st.tabs(["🏛️ 家族溯源 (长辈)", "👫 同辈关系", "👶 后代脉络 (下三代)"])
+        
+        with t1:
+            st.subheader("上一辈及溯源")
+            f, m = node['f'], node['m']
+            if f or m:
+                st.write(f"直接长辈：父【{f or '无'}】 母【{m or '无'}】")
+                # 递归显示上三辈逻辑可在此扩展
+            else:
+                st.info("已达到该支脉已知最高辈分")
+
+        with t2:
+            st.subheader("同辈亲属 (亲/堂/表/姻)")
+            sibs = tree.get_siblings(query_name)
+            if sibs:
+                st.write("**亲兄妹：**")
+                for s in sibs: st.write(f"• {s['n']} ({'男' if s['s']=='男' else '女'})")
+            else:
+                st.write("无亲兄妹记录")
+
+        with t3:
+            st.subheader("后代按家庭组织显示")
+            children = tree.get_children(query_name)
+            for c in children:
+                with st.expander(f"子/女：{c['n']}", expanded=True):
+                    st.write(f"配偶：{', '.join(c['sp']) if c['sp'] else '无'}")
+                    # 下二代
+                    grandchildren = tree.get_children(c['n'])
+                    for gc in grandchildren:
+                        st.success(f"孙辈：{gc['n']}")
+                        st.code(f"路径：{tree.build_chain(query_name, gc['n'])}")
+                        # 下三代（曾孙）
+                        great_gc = tree.get_children(gc['n'])
+                        for ggc in great_gc:
+                            st.warning(f"曾孙辈：{ggc['n']}")
+                            st.code(f"路径：{tree.build_chain(query_name, ggc['n'])}")