In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with arbitrary precision, by its computable subgraph with computable endpoints.

@article{paperbot4009,
  title = {Computable Approximations of Semicomputable Graphs},
  author = {Vedran Čačić and Matea Čelar and Marko Horvat and Zvonko Iljazović},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 22, Issue 1},
  year = {2026},
  doi = {10.46298/lmcs-22(1:28)2026}
}