A planar graph is a graph that can be embedded in the plane without any edges crossing each other. However, not all graphs are planar. There are specific criteria and algorithms to check if a graph is planar and, if so, to find an arrangement (embedding) of the nodes such that no edges cross each other.
is it possible to even do such a thing with this library? i've build a tool that lets me index any codebase using TreeSitter and from that I generate a dependency graph (the graphData). it works great but it's like to make bigger graphs easier to take in by flattening it.
A planar graph is a graph that can be embedded in the plane without any edges crossing each other. However, not all graphs are planar. There are specific criteria and algorithms to check if a graph is planar and, if so, to find an arrangement (embedding) of the nodes such that no edges cross each other.
is it possible to even do such a thing with this library? i've build a tool that lets me index any codebase using TreeSitter and from that I generate a dependency graph (the
graphData). it works great but it's like to make bigger graphs easier to take in by flattening it.