fix(shards): extend mergeGraph UUID remap to cover Type and Class nodes

Type/Class nodes from changed files were not remapped in the oldToNew table,
leaving relationships from unchanged files pointing at stale UUIDs (dangling
edges). Added incTypeByKey map built from the incremental response and wired
it into the remap loop alongside File and Function nodes.

Fixes #107

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>

Author: greynewell

internal/shards/daemon.go

@@ -451,6 +451,7 @@ func (d *Daemon) mergeGraph(incremental *api.ShardIR, changedFiles []string) { /
 
 	incFileByPath := make(map[string]string)
 	incFnByKey := make(map[string]string)
+	incTypeByKey := make(map[string]string) // Type and Class nodes keyed by filePath:name
 	for _, n := range incremental.Graph.Nodes {
 		fp := n.Prop("filePath")
 		if n.HasLabel("File") && fp != "" {
@@ -460,6 +461,11 @@ func (d *Daemon) mergeGraph(incremental *api.ShardIR, changedFiles []string) { /
 			if name != "" {
 				incFnByKey[fp+":"+name] = n.ID
 			}
+		} else if (n.HasLabel("Type") || n.HasLabel("Class")) && fp != "" {
+			name := n.Prop("name")
+			if name != "" {
+				incTypeByKey[fp+":"+name] = n.ID
+			}
 		}
 	}
 
@@ -479,6 +485,12 @@ func (d *Daemon) mergeGraph(incremental *api.ShardIR, changedFiles []string) { /
 			if newID, ok := incFnByKey[key]; ok && newID != n.ID {
 				oldToNew[n.ID] = newID
 			}
+		} else if n.HasLabel("Type") || n.HasLabel("Class") {
+			name := n.Prop("name")
+			key := fp + ":" + name
+			if newID, ok := incTypeByKey[key]; ok && newID != n.ID {
+				oldToNew[n.ID] = newID
+			}
 		}
 	}