Skip to content

Implement efficient adjacency graph from bipartite#145

Merged
gdalle merged 3 commits intobicoloringfrom
gd/bicoloring_graph
Oct 6, 2024
Merged

Implement efficient adjacency graph from bipartite#145
gdalle merged 3 commits intobicoloringfrom
gd/bicoloring_graph

Conversation

@gdalle
Copy link
Copy Markdown
Member

@gdalle gdalle commented Oct 6, 2024

Revamp adjacency graphs so that we have two implementations:

AdjacencyGraph <: AbstractAdjacencyGraph
AdjacencyFromBipartiteGraph <: AbstractAdjacencyGraph

The second one efficiently represents the symmetric matrix [0 A'; A 0]

@gdalle gdalle linked an issue Oct 6, 2024 that may be closed by this pull request
@gdalle gdalle changed the title Custom adjacency graph from bipartite Implement efficient adjacency graph from bipartite Oct 6, 2024
@codecov
Copy link
Copy Markdown

codecov Bot commented Oct 6, 2024

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 100.00%. Comparing base (c28490d) to head (37e24e7).
Report is 1 commits behind head on bicoloring.

Additional details and impacted files
@@             Coverage Diff              @@
##           bicoloring      #145   +/-   ##
============================================
  Coverage      100.00%   100.00%           
============================================
  Files              12        12           
  Lines             878       889   +11     
============================================
+ Hits              878       889   +11     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

@gdalle gdalle marked this pull request as ready for review October 6, 2024 17:25
@gdalle gdalle requested a review from amontoison October 6, 2024 17:25
@gdalle gdalle merged commit 2648657 into bicoloring Oct 6, 2024
@gdalle gdalle deleted the gd/bicoloring_graph branch October 6, 2024 17:49
gdalle added a commit that referenced this pull request Nov 8, 2024
* Implement efficient adjacency graph from bipartite (#145)

* Custom adjacency graph from bipartite

* Fix nb edges

* More typing

* Working prototype for bicoloring (coloring + decompression) (#146)

* Start bicoloring result

* Working bidirectional decompression

* Min diff

* Slight perf optim

* Perf

* Gettin bi

* Less code

* Fix tests

* Remove remaining compat

* Fix group typing

* Avoid accessing ag.S

* Add bidirectional coloring visualization (#153)

* Allocation-free bidirectional decompression (#154)

* Minimize diff

* Bump version to 0.4.9

* Check scale for bicoloring visualization

* Fix visualization tests

* Improve docs

* Undo view change

* Typo

* Add views
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

Successfully merging this pull request may close these issues.

Custom adjacency graph from bipartite graph

2 participants