Hi there,

I've been working with graph crossings and their properties and such. Originally I was using Networkx but I've been using Graphs.jl and Julia now. Some of the things I've been using are mapping from the edge pairs (e,e)->crossing, if they have one that is ofc . The # crossings per edge (so can check for k-planarity of embedding, crossing count etc...), crossing per vertex (the # of crossings of edges on that vertex), sparse matrix of the crossings in the graph embedding, and also graph constructions from the crossings in a graph embedding. Also # faces, and some things. Would that be the kind of thing that would be welcome here?