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

Community call - 2023.10.26 #11

Open
gdalle opened this issue Oct 26, 2023 · 2 comments
Open

Community call - 2023.10.26 #11

gdalle opened this issue Oct 26, 2023 · 2 comments

Comments

@gdalle
Copy link
Member

gdalle commented Oct 26, 2023

Agenda

  • ColPrac adopted
  • Recap of recent events
  • Graph interface design
@gdalle
Copy link
Member Author

gdalle commented Oct 26, 2023

Since last time

@gdalle
Copy link
Member Author

gdalle commented Oct 26, 2023

Graph interface design

  • Translation between arbitrary vertex labels and integer range
  • Deletion changes the indices of other vertices and that should be understood / made safer by the interface
  • Adding a vertex should be closer to a dictionary operation
  • add_vertex!(g) can become add_vertex!(g, v)
  • Label can be fused with the integer codes
  • Abstract away from the data structure for the interface
  • Is the graph efficiently indexable by integers? Maybe graphs are indexable by integers?
  • User can provide the mapping label -> index as a function, not necessarily a dictionary
  • Do we require has_edge(g, u::Int, v::Int)? The conversion doesn't just affect vertices
  • IntegerIndexed(g)?
  • Special vertex type wrapping an integer or named vertex? Similar to linear vs cartesian indexing?
  • Does every algorithm need to convert every graph to a simple graph? It depends

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

1 participant