-
Notifications
You must be signed in to change notification settings - Fork 93
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Would graph crossing utilities belong here? #267
Comments
Hi, thanks for offering to contribute! |
Can you reopen your issue there, and maybe a PR if you want? |
I'm not sure, for me it says it is in Graphs.jl here |
Yeah this issue is on Graphs.jl I don't see any indication that it was moved from GraphsBase. Maybe he was looking at several issues in parallel and got confused. |
Indeed, sorry for the mistake. Then your PR is welcome here, although reviewing times may vary 😊 |
Note that for the moment, this library lacks even the most basic functionalities for planarity and embeddings (which is welcome contribution, of course) although something was started here: #208 |
Is there a standard or consistent way of storing information related to a graph, or in relating information in Julia in general? Would this be a struct or something? methods? I only just started using Julia really and there can be a lot of ways to accomplish something sometimes so I'm not sure what I should be doing For example, for myself, so far I've just been doing it such that when I use a function with a pair
etc..
to return the edges that cross with e in that particular configuration, and in general update/store information if I was creating it for the first time or such. What its worth I did try metagraphsnext but I didn't get much use given the regular Graphs.jl functions being faster and having to create the meta graph and such. Wouldn't be surprised if it was just how I was doing it, and not writing the best code(to say the least) but I couldn't get it to run efficiently compared to using just Graphs.jl |
The answer is: "not yet, but soon". We're working on a full rewrite that will allow easy manipulation of metadata associated with vertices or edges (see GraphsBase.jl). In the meantime, shortest path algorithms for example take an edge weight matrix as additional argument. So your approach of giving |
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?The text was updated successfully, but these errors were encountered: