This is much more focused version of this question:Are there good implementations for easy subclasses of NP-hard graph problems Computing the graph-crossing number $cr(G)$ for a simple graph is known to be NP-complete. A quick literature review shows some suggested algorithms for computing if $cr(G)<k$. Are they any active implementations available?Already checked: SAGE, CGAL_Boost, networkx, graph_tool
Are there any implementations of a graph crossing algorithm?
graph theory;graph algorithms;software;implementation