Skip to content
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

Near term usage? Registering the package? #20

Open
Krastanov opened this issue Mar 21, 2024 · 4 comments
Open

Near term usage? Registering the package? #20

Krastanov opened this issue Mar 21, 2024 · 4 comments

Comments

@Krastanov
Copy link

What is the advice for near term users of this and the flows and matching packages?

Especially in the context of developers. I am comfortable with dealing with deprecations and compatbot PRs for my package. My package will not expose the functionality of these graph packages, only use it internally. Should I depend on the currently available packages or should I politely ask you to register a 0.1.0 version of this package?

@Krastanov Krastanov changed the title Near term ussage? Registering the package? Near term usage? Registering the package? Mar 21, 2024
@gdalle
Copy link
Member

gdalle commented Mar 21, 2024

I think registration of GraphsOptim.jl would be reasonable, I just wanted to clean up a bit and add more tests but never got around to it

@gdalle
Copy link
Member

gdalle commented Mar 21, 2024

On the other hand, GraphsFlows and GraphsMatching are bound to be archived because their functionality will land either here or in Graphs.jl

@gdalle
Copy link
Member

gdalle commented Mar 21, 2024

I'll try to redo the PR merging GraphsFlows into Graphs in the coming days (there was already one but it was unreadable so I'm gonna redo it properly JuliaGraphs/Graphs.jl#329). May I ask you to review it once it's there?

@Krastanov
Copy link
Author

Happy to help with review

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants