PartitionsGraphView

Project.toml

@@ -1,14 +1,17 @@
 name = "NamedGraphs"
 uuid = "678767b0-92e7-4007-89e4-4527a8725b19"
 authors = ["Matthew Fishman <mfishman@flatironinstitute.org>, Joseph Tindall <jtindall@flatironinstitute.org> and contributors"]
-version = "0.6.9"
+version = "0.6.10"
 
 [deps]
 AbstractTrees = "1520ce14-60c1-5f80-bbc7-55ef81b5835c"
 Combinatorics = "861a8166-3701-5b0c-9a16-15d98fcdc6aa"
 Dictionaries = "85a47980-9c8c-11e8-2b9f-f7ca1fa99fb4"
 Graphs = "86223c79-3864-5bf0-83f7-82e725a168b6"
+JuliaFormatter = "98e50ef6-434e-11e9-1051-2b60c6c9e899"
+KaHyPar = "2a6221f6-aa48-11e9-3542-2d9e0ef01880"
 LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
+Metis = "2679e427-3c69-5b7f-982b-ece356f1e94b"
 PackageExtensionCompat = "65ce6f38-6b18-4e1d-a461-8949797d7930"
 Random = "9a3f8284-a2c9-5f02-9a11-845980a1fd5c"
 SimpleGraphAlgorithms = "41400c72-0c58-5c16-8579-4ecbce768449"
@@ -20,8 +23,6 @@ Suppressor = "fd094767-a336-5f1f-9728-57cf17d0bbfb"
 
 [weakdeps]
 GraphsFlows = "06909019-6f44-4949-96fc-b9d9aaa02889"
-KaHyPar = "2a6221f6-aa48-11e9-3542-2d9e0ef01880"
-Metis = "2679e427-3c69-5b7f-982b-ece356f1e94b"
 SymRCM = "286e6d88-80af-4590-acc9-0001b223b9bd"
 
 [extensions]
@@ -37,6 +38,7 @@ Combinatorics = "1.0.2"
 Dictionaries = "0.4"
 Graphs = "1.8"
 GraphsFlows = "0.1.1"
+JuliaFormatter = "2.1.6"
 KaHyPar = "0.3.1"
 LinearAlgebra = "1.7"
 Metis = "1.4"

src/lib/PartitionedGraphs/src/PartitionedGraphs.jl

@@ -5,4 +5,5 @@ include("abstractpartitionedgraph.jl")
 include("partitionvertex.jl")
 include("partitionedge.jl")
 include("partitionedgraph.jl")
+include("partitionedgraphview.jl")
 end

src/lib/PartitionedGraphs/src/partitionedgraphview.jl

@@ -0,0 +1,36 @@
+struct PartitionedGraphView{PG}
+  value::PG
+end
+
+value(pgv::PartitionedGraphView) = pgv.value
+Base.copy(pgv::PartitionedGraphView) = PartitionedGraphView(copy(value(pgv)))
+PartitionedGraph(pgv::PartitionedGraphView) = value(pgv)
+
+#Functionality that behaves differently
+for f in [
+  :(Graphs.vertices),
+  :(Graphs.edges),
+  :(Graphs.induced_subgraph),
+  :(Graphs.neighbors),
+  :(Graphs.degree),
+  :(Graphs.is_tree),
+  :(Graphs.is_connected),
+  :(Graphs.connected_components),
+  :(Graphs.is_cyclic),
+  :(NamedGraphs.GraphsExtensions.boundary_edges),
+]
+  @eval begin
+    function $f(pgv::PartitionedGraphView, args...; kwargs...)
+      return $f(partitioned_graph(PartitionedGraph(pgv)), args...; kwargs...)
+    end
+  end
+end
+
+#Functionality that behaves the same
+for f in [:unpartitioned_graph]
+  @eval begin
+    function $f(pgv::PartitionedGraphView, args...; kwargs...)
+      return $f(PartitionedGraph(pgv), args...; kwargs...)
+    end
+  end
+end

test/test_partitionedgraph.jl

@@ -32,6 +32,7 @@ using NamedGraphs.OrderedDictionaries: OrderedDictionary
 using NamedGraphs.PartitionedGraphs:
   PartitionEdge,
   PartitionedGraph,
+  PartitionedGraphView,
   PartitionVertex,
   boundary_partitionedges,
   partitioned_graph,
@@ -61,6 +62,11 @@ using Test: @test, @testset
   pg_c = copy(pg)
   @test pg_c == pg
 
+  #PartionedGraphView test
+  pgv = PartitionedGraphView(pg)
+  @test vertices(pgv) == parent.(partitionvertices(pg))
+  @test edges(pgv) == parent.(partitionedges(pg))
+
   #Same partitioning but with a dictionary constructor
   partition_dict = Dictionary([first(partition) for partition in partitions], partitions)
   pg = PartitionedGraph(g, partition_dict)