refactor

README.md

@@ -1,25 +1,39 @@
-# math_roots
+---
+library_name: streamlit
+tags:
+  - streamlit
+  - math-genealogy
+  - webapp
+app_file: app.py
+---
 
-A Python project to visualize mathematician ancestor trees from the Math Genealogy Project using [Geneagrapher](https://github.com/davidalber/geneagrapher) and Streamlit.
+# 📚 Math Roots: Math Genealogy Tree Explorer
 
-## Features
+A simple Streamlit app to explore your mathematical genealogy tree using your Math Genealogy Project ID.
 
-- Look up a mathematician by Math Genealogy Project user ID
-- Fetch and display their academic ancestor tree as a directed graph
+## 🌟 Features
 
-## Setup
+- 🧑‍🎓 Enter your Math Genealogy Project ID to trace your academic "ancestors"
+- 🌳 Interactive, web-based interface powered by [Streamlit](https://streamlit.io/)
 
-```sh
-poetry install
-```
+## 🚀 Usage
 
-## Running Tests
+1. Install dependencies:
+   ```bash
+   pip install streamlit
+   ```
+2. Run the app:
+   ```bash
+   streamlit run app.py
+   ```
+3. Open the provided local URL in your browser.
 
-```sh
-poetry run pytest
-```
+## 📝 Model Card
 
-## Running the App
+**Library:** Streamlit  
+**App Entry Point:** `app.py`  
+**Tags:** math-genealogy, streamlit, webapp
 
-```sh
-poetry run streamlit run src/app.py
+## 📄 License
+
+MIT

app.py

@@ -1,20 +1,119 @@
 import streamlit as st
+import asyncio
+import websockets
+import json
+import platform
+from typing import Dict, Any, Optional, List, Literal, TypedDict, cast
 
-st.title("Math Genealogy Ancestor Tree")
+GGRAPHER_URI = "wss://ggrphr.davidalber.net"
 
-user_id = st.text_input("Enter Math Genealogy Project user ID:")
+class StartNodeRequest(TypedDict):
+    recordId: int
+    getAdvisors: bool
+    getDescendants: bool
 
-if user_id:
-    # placeholder DOT graph, replace with real output later
-    dot = '''
-    digraph G {
-        A [label="User "]
-        B [label="Advisor 1"]
-        C [label="Advisor 2"]
-        A -> B
-        B -> C
+class RequestPayload(TypedDict):
+    kind: Literal["build-graph"]
+    options: Dict[Literal["reportingCallback"], bool]
+    startNodes: List[StartNodeRequest]
+
+class ProgressCallback(TypedDict):
+    queued: int
+    fetching: int
+    done: int
+
+def get_id_from_input(val: str) -> Optional[int]:
+    try:
+        return int(val)
+    except Exception:
+        return None
+
+def make_payload(record_id: int) -> RequestPayload:
+    return {
+        "kind": "build-graph",
+        "options": {"reportingCallback": True},
+        "startNodes": [{
+            "recordId": record_id,
+            "getAdvisors": True,
+            "getDescendants": False,
+        }],
     }
-    '''
-    st.graphviz_chart(dot)
-else:
-    st.info("Enter a user ID to view the ancestor tree.")
+
+async def get_graph(payload: RequestPayload, progress_cb=None) -> Dict[str, Any]:
+    def intify_record_keys(d: Dict[Any, Any]) -> Dict[Any, Any]:
+        if "nodes" in d:
+            ret = {k: v for k, v in d.items() if k != "nodes"}
+            ret["nodes"] = {int(k): v for k, v in d["nodes"].items()}
+            return ret
+        return d
+
+    async with websockets.connect(  # type: ignore[attr-defined]
+        GGRAPHER_URI,
+    ) as ws:
+        await ws.send(json.dumps(payload))
+        while True:
+            response_json = await ws.recv()
+            response = json.loads(response_json, object_hook=intify_record_keys)
+            response_payload = response.get("payload")
+            if response["kind"] == "graph":
+                return cast(Dict[str, Any], response_payload)
+            elif response["kind"] == "progress" and progress_cb:
+                progress = cast(ProgressCallback, response_payload)
+                progress_cb(progress)
+            else:
+                continue
+
+def tree_to_dot(graph: Dict[str, Any]) -> str:
+    nodes = graph.get("nodes", {})
+    lines = [
+        "digraph G {",
+        "  rankdir=TB;",
+        '  node [shape=box, style="rounded,filled", fillcolor=lightyellow];',
+        '  edge [arrowhead=vee];'
+    ]
+    # Define nodes and their labels
+    for node_id, node in nodes.items():
+        name = node.get("name", str(node_id))
+        year_str = f" ({node.get('year')})" if node.get('year') is not None else " (Year Unknown)"
+        label = f"{name}{year_str}"
+        tooltip = f"ID: {node_id}\\nName: {name}\\nYear: {node.get('year', 'N/A')}\\nInstitution: {node.get('institution', 'N/A')}"
+        lines.append(f'  "{node_id}" [label="{label}", tooltip="{tooltip}"];')
+    # Define edges
+    for node_id, node in nodes.items():
+        for adv_id in node.get("advisors", []):
+            if adv_id in nodes:
+                lines.append(f'  "{adv_id}" -> "{node_id}";')
+    lines.append("}")
+    return "\n".join(lines)
+
+def main():
+    st.title("Math Genealogy Ancestor Tree (WebSocket API)")
+    mgp_id_str = st.text_input("Enter MGP ID (integer):")
+    progress_placeholder = st.empty()
+    graph_placeholder = st.empty()
+    run_btn = st.button("Show Ancestor Tree")
+    if run_btn:
+        mgp_id = get_id_from_input(mgp_id_str)
+        if mgp_id is None:
+            st.error("Please enter a valid integer MGP ID.")
+            return
+        payload = make_payload(mgp_id)
+        loop = asyncio.new_event_loop()
+        asyncio.set_event_loop(loop)
+        def progress_cb(progress):
+            progress_placeholder.info(
+                f"Queued: {progress['queued']} | Fetching: {progress['fetching']} | Done: {progress['done']}"
+            )
+        async def runner():
+            graph = await get_graph(payload, progress_cb)
+            dot = tree_to_dot(graph)
+            graph_placeholder.graphviz_chart(dot)
+        try:
+            loop.run_until_complete(runner())
+            progress_placeholder.success("Done!")
+        except Exception as e:
+            print(f"Error: {e}")
+            progress_placeholder.error(f"Error: {e}")
+
+if __name__ == "__main__":
+    main()

src/app.py

@@ -1,119 +0,0 @@
-import streamlit as st
-import asyncio
-import websockets
-import json
-import platform
-from typing import Dict, Any, Optional, List, Literal, TypedDict, cast
-
-GGRAPHER_URI = "wss://ggrphr.davidalber.net"
-
-class StartNodeRequest(TypedDict):
-    recordId: int
-    getAdvisors: bool
-    getDescendants: bool
-
-class RequestPayload(TypedDict):
-    kind: Literal["build-graph"]
-    options: Dict[Literal["reportingCallback"], bool]
-    startNodes: List[StartNodeRequest]
-
-class ProgressCallback(TypedDict):
-    queued: int
-    fetching: int
-    done: int
-
-def get_id_from_input(val: str) -> Optional[int]:
-    try:
-        return int(val)
-    except Exception:
-        return None
-
-def make_payload(record_id: int) -> RequestPayload:
-    return {
-        "kind": "build-graph",
-        "options": {"reportingCallback": True},
-        "startNodes": [{
-            "recordId": record_id,
-            "getAdvisors": True,
-            "getDescendants": False,
-        }],
-    }
-
-async def get_graph(payload: RequestPayload, progress_cb=None) -> Dict[str, Any]:
-    def intify_record_keys(d: Dict[Any, Any]) -> Dict[Any, Any]:
-        if "nodes" in d:
-            ret = {k: v for k, v in d.items() if k != "nodes"}
-            ret["nodes"] = {int(k): v for k, v in d["nodes"].items()}
-            return ret
-        return d
-
-    async with websockets.connect(  # type: ignore[attr-defined]
-        GGRAPHER_URI,
-    ) as ws:
-        await ws.send(json.dumps(payload))
-        while True:
-            response_json = await ws.recv()
-            response = json.loads(response_json, object_hook=intify_record_keys)
-            response_payload = response.get("payload")
-            if response["kind"] == "graph":
-                return cast(Dict[str, Any], response_payload)
-            elif response["kind"] == "progress" and progress_cb:
-                progress = cast(ProgressCallback, response_payload)
-                progress_cb(progress)
-            else:
-                continue
-
-def tree_to_dot(graph: Dict[str, Any]) -> str:
-    nodes = graph.get("nodes", {})
-    lines = [
-        "digraph G {",
-        "  rankdir=TB;",
-        '  node [shape=box, style="rounded,filled", fillcolor=lightyellow];',
-        '  edge [arrowhead=vee];'
-    ]
-    # Define nodes and their labels
-    for node_id, node in nodes.items():
-        name = node.get("name", str(node_id))
-        year_str = f" ({node.get('year')})" if node.get('year') is not None else " (Year Unknown)"
-        label = f"{name}{year_str}"
-        tooltip = f"ID: {node_id}\\nName: {name}\\nYear: {node.get('year', 'N/A')}\\nInstitution: {node.get('institution', 'N/A')}"
-        lines.append(f'  "{node_id}" [label="{label}", tooltip="{tooltip}"];')
-    # Define edges
-    for node_id, node in nodes.items():
-        for adv_id in node.get("advisors", []):
-            if adv_id in nodes:
-                lines.append(f'  "{adv_id}" -> "{node_id}";')
-    lines.append("}")
-    return "\n".join(lines)
-
-def main():
-    st.title("Math Genealogy Ancestor Tree (WebSocket API)")
-    mgp_id_str = st.text_input("Enter MGP ID (integer):")
-    progress_placeholder = st.empty()
-    graph_placeholder = st.empty()
-    run_btn = st.button("Show Ancestor Tree")
-    if run_btn:
-        mgp_id = get_id_from_input(mgp_id_str)
-        if mgp_id is None:
-            st.error("Please enter a valid integer MGP ID.")
-            return
-        payload = make_payload(mgp_id)
-        loop = asyncio.new_event_loop()
-        asyncio.set_event_loop(loop)
-        def progress_cb(progress):
-            progress_placeholder.info(
-                f"Queued: {progress['queued']} | Fetching: {progress['fetching']} | Done: {progress['done']}"
-            )
-        async def runner():
-            graph = await get_graph(payload, progress_cb)
-            dot = tree_to_dot(graph)
-            graph_placeholder.graphviz_chart(dot)
-        try:
-            loop.run_until_complete(runner())
-            progress_placeholder.success("Done!")
-        except Exception as e:
-            print(f"Error: {e}")
-            progress_placeholder.error(f"Error: {e}")
-
-if __name__ == "__main__":
-    main()