Add is_bipartite(::Graph)
#4499
Draft
+29
−0
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
lgoettgens
reviewed
Jan 24, 2025
lgoettgens
added
topic: combinatorics
release notes: use title
Codecov ReportAll modified and coverable lines are covered by tests ✅
Additional details and impacted files@@ Coverage Diff @@
## master #4499 +/- ##
=======================================
Coverage 84.55% 84.55%
=======================================
Files 672 672
Lines 88888 88890 +2
=======================================
+ Hits 75157 75160 +3
+ Misses 13731 13730 -1
|
benlorenz
reviewed
Jan 24, 2025
Comment on lines
+1356
to
+1357
| function is_bipartite(g::Graph{T}) where T | ||
| return Polymake.graph.Graph{T}(ADJACENCY=g.pm_graph).BIPARTITE::Bool |
There was a problem hiding this comment.
Suggested change
| function is_bipartite(g::Graph{T}) where T | |
| return Polymake.graph.Graph{T}(ADJACENCY=g.pm_graph).BIPARTITE::Bool | |
| function is_bipartite(g::Graph{Undirected}) | |
| return Polymake.graph.Graph{Undirected}(ADJACENCY=pm_object(g)).BIPARTITE::Bool |
This is only defined for undirected graphs.
graph/objects/Combinatorics/Graph/properties/BIPARTITE:
property BIPARTITE : Bool
Only defined for Graph<Undirected>.
True if the graph is a bipartite.
| # Examples | ||
| ``` | ||
| julia> g = graph_from_edges([1,2],[2,3],[3,4]]); |
There was a problem hiding this comment.
Suggested change
| julia> g = graph_from_edges([1,2],[2,3],[3,4]]); | |
| julia> g = graph_from_edges([[1,2],[2,3],[3,4]]); |
| ``` | ||
| julia> g = graph_from_edges([1,2],[2,3],[3,4]]); | ||
| julia> is_bipartite(G) |
There was a problem hiding this comment.
Suggested change
| julia> is_bipartite(G) | |
| julia> is_bipartite(g) |
| @@ -1339,3 +1339,20 @@ function laplacian_matrix(g::Graph) | |||
| A = matrix(ZZ, adjacency_matrix(g)) | |||
| return D-A | |||
| end | |||
|
|
|||
| @doc raw""" | |||
| is_bipartite(g::Graph) | |||
There was a problem hiding this comment.
Suggested change
| is_bipartite(g::Graph) | |
| is_bipartite(g::Graph{Undirected}) |
| @doc raw""" | ||
| is_bipartite(g::Graph) | ||
| Returns true if the graph `g` is bipartite. |
There was a problem hiding this comment.
Suggested change
| Returns true if the graph `g` is bipartite. | |
| Returns true if the undirected graph `g` is bipartite. |
| Returns true if the graph `g` is bipartite. | ||
| # Examples | ||
| ``` |
There was a problem hiding this comment.
Suggested change
| ``` | |
| ```jldoctest |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The title says it all.