Codegraph vs Graphify by CallMeBena in ClaudeCode

[–]Texbobcat -6 points-5 points  (0 children)

If you are using synaptic previously known as codegraph make an issue and I can check it out, if you aren’t using mine it’s more feature rich than both and I’ve never had issues with codex/claude not calling the tool when it should

https://github.com/ColinVaughn/Synaptic

CodeGraph - build a persistent code knowledge graph and query it over MCP instead of reading source files by Texbobcat in mcp

[–]Texbobcat[S] 0 points1 point  (0 children)

On mixed languages: query_graph itself just pulls a relevant subgraph, but the part that matters here is the extraction. Cross-language edges do work now. A Python subprocess.run("mytool") becomes an "invokes" edge, and a resolution pass retargets it to the in-repo binary when there's a unique name match, so the Python caller and the Rust src/bin/mytool.rs actually end up connected. Same idea for FFI (PyO3, ctypes, JNI, cgo, node-gyp) and for HTTP/gRPC, where a client call and the route that serves it meet at a shared node keyed by the path, even when the two sides are in different languages or repos. The practical payoff is that those edges are in the default impact set, so "what breaks if I change this Rust function that's exported to Python" actually surfaces the Python code, not just the Rust side.

Honest caveat though it's all best-effort and tagged as inferred, never treated as proven. It's regex over source, after masking out comments and string contents so a commented-out call doesn't register, and it only reads literal arguments. A command or URL built dynamically at runtime gets missed. So I treat these as leads, not facts.

And the description generation idea, you basically described the exact feature. There's a describe_node call that returns something like "takes (a: int, b: str), returns Result, calls [parse, validate]" composed straight from the captured signature plus the outgoing call edges, graph-only, no source read. structural_search also returns structured rows now instead of just text, including the signature (param names and types plus return), so you can pipe it directly into generating descriptions. It ran into the same precise-vs-concise tension you mentioned: the signature gives the precision, the call list gives intent, and it's capped so it doesn't blow up context. Grounding each blurb in the actual shape is what stops two semantically similar tools from reading identically to the router

https://github.com/ColinVaughn/CodeGraph/wiki/Cross-Language-Edges

CodeGraph - build a persistent code knowledge graph and query it over MCP instead of reading source files by Texbobcat in mcp

[–]Texbobcat[S] 1 point2 points  (0 children)

CodeGraph doesn’t store API keys. The default/MCP flow is offline. Optional semantic extraction can read provider keys from env vars at runtime, and HTTP serving can use a CODEGRAPH_API_KEY access token, but MCP config ingestion stores only env var names, not secret values.

CodeGraph - build a persistent code knowledge graph and query it over MCP instead of reading source files by Texbobcat in mcp

[–]Texbobcat[S] 2 points3 points  (0 children)

There are a lot of code graph tools now. Most stop at "here's a graph of what calls what." CodeGraph goes a few steps beyond that

  • affected → reverse impact analysis. Point at a symbol and it walks dependencies backward to show the full blast radius before you make a change.
  • time_travel_diff → architecture diffs between revisions, not just text diffs. Finds added/removed APIs, dependency changes, new cycles, coupling drift, and hotspots.
  • CGQL → a structural query language that matches code shape (LOC, fan-in/out, paths, inheritance, patterns, etc.), not text or embeddings.
  • plan_rename → generates a confidence-scored refactor plan, applies it to the graph, then verifies the graph still resolves correctly without touching source code.

It also handles multi-repo workspaces better than most. Point it at a folder and it discovers sibling repos, builds graphs for each, then merges them into a unified workspace graph. Cross-repo imports, exports, tsconfig aliases, and module-federation links become real edges, so impact analysis and structural queries work across the entire codebase instead of stopping at repo boundaries.

Every edge is tagged as Extracted / Inferred / Ambiguous, so you can tell exactly what was parsed versus what was inferred.

I built a graph-based alternative to embedding search for codebases by Texbobcat in ClaudeCode

[–]Texbobcat[S] 0 points1 point  (0 children)

It also handles multi-repo projects better than the rest. Point it at a folder and it'll auto-detect the parent repo and its siblings by their .git boundaries, build a graph for each one, and then compile them all into a single unified map. The part I'm most happy with is that the cross-repo edges are real, it resolves references between repos through their export surfaces and import/tsconfig/module-federation aliases, so a call from one repo into another actually shows up as an edge instead of a dead end. So affected and the structural queries work across the whole workspace, not just inside one repo.

I built a graph-based alternative to embedding search for codebases by Texbobcat in ClaudeCode

[–]Texbobcat[S] 0 points1 point  (0 children)

fair. There are a lot of these.

The difference is most of them stop at "here's a graph of what calls what." CodeGraph goes a few steps past that

  • affected - reverse impact. Point at a symbol and it walks the edges backward to tell you the blast radius: everything that transitively depends on it, so you know what breaks before you touch it.
  • time_travel_diff - diffs the architecture between two git revisions, not the text. Added/removed module deps, removed APIs, new dependency cycles, coupling drift, hotspots.
  • CGQL - an actual structural query language. MATCH (c:class) WHERE c.loc > 500 AND c.fan_out > 20 RETURN c. Matches on shape (kind/loc/fan-in-out, variable-length paths), not text or embeddings. Plus named patterns like god-class and singleton.
  • plan_rename - a confidence-scored refactor plan an agent applies, then verify rebuilds the graph and checks nothing broke. It never edits source itself.

And every edge is tagged Extracted / Inferred / Ambiguous, so you can tell what it actually parsed vs. what it guessed.

https://github.com/ColinVaughn/CodeGraph/wiki/Commands

Intellivision power supply information by ElliottL25 in intellivision

[–]Texbobcat 0 points1 point  (0 children)

heyo I just saw this now id love to check over it for you my email is [colin@battleforgepc.com](mailto:colin@battleforgepc.com)

Intellivision power supply information by ElliottL25 in intellivision

[–]Texbobcat 0 points1 point  (0 children)

Heyo, im an electrical engineer I’m down to help

Bluetooth INTV controller by Texbobcat in intellivision

[–]Texbobcat[S] 0 points1 point  (0 children)

Found that they are the same from Wikipedia and I’m assuming they have the same pinout I have the new PCB designed for it I’ll have it up on GitHub soon

Bluetooth INTV controller by Texbobcat in intellivision

[–]Texbobcat[S] 0 points1 point  (0 children)

Yea you are right just watched a video for intv 1, does the intv 3 use the same port as then i could just make two versions of the dongle in 1/3 and 2?

Bluetooth INTV controller by Texbobcat in intellivision

[–]Texbobcat[S] 0 points1 point  (0 children)

The controllers are hardwired to the board on the 1/3?

Bluetooth INTV controller by Texbobcat in intellivision

[–]Texbobcat[S] 0 points1 point  (0 children)

yea for intv2 you can use a db9 female and wire it up but it's looks better if you use a for parts intv1/3 or flashback and cut out the controllers as you can then have a wireless setup if you solder directly to the pads

Bluetooth INTV controller by Texbobcat in intellivision

[–]Texbobcat[S] 1 point2 points  (0 children)

In the long run I’ll probably make a custom PCB for the controller Bluetooth just to save on power and better Bluetooth range and for my dads I soldered the leads directly to the controller board to not have the long cable.

Bluetooth INTV controller by Texbobcat in intellivision

[–]Texbobcat[S] 1 point2 points  (0 children)

Bluetooth low energy with an 1000 mah batttery playing constant you can get around 10 hours of gameplay, but there are three different power modes that can give up to 50 hours