Fix GNNGraphs

JuliaGraphs · Dec 7, 2024 · 2e52a2c · 2e52a2c
1 parent 7bd58c6
commit 2e52a2c
Show file tree

Hide file tree

Showing 4 changed files with 6 additions and 4 deletions.
diff --git a/GNNGraphs/docs/make.jl b/GNNGraphs/docs/make.jl
@@ -3,7 +3,7 @@ using DocumenterInterLinks
 using GNNGraphs
 using MLUtils # this is needed by setdocmeta!
 import Graphs
-using Graphs: induced_subgraph
+using Graphs: induced_subgraph, has_edge
 
 
 DocMeta.setdocmeta!(GNNGraphs, :DocTestSetup, :(using GNNGraphs, MLUtils); recursive = true)

diff --git a/GNNGraphs/docs/src/api/heterograph.md b/GNNGraphs/docs/src/api/heterograph.md
@@ -22,7 +22,9 @@ Modules = [GNNGraphs]
 Pages   = ["gnnheterograph/query.jl"]
 Private = false
 ```
-
+```@docs
+Graphs.has_edge(g::GNNHeteroGraph, edge_t::EType, i::Integer, j::Integer)
+```
 ## Transform
 
 ```@autodocs

diff --git a/GNNGraphs/src/gnnheterograph/query.jl b/GNNGraphs/src/gnnheterograph/query.jl
@@ -12,7 +12,7 @@ edge_index(g::GNNHeteroGraph{<:COO_T}) = only(g.graph)[2][1:2]
 get_edge_weight(g::GNNHeteroGraph{<:COO_T}, edge_t::EType) = g.graph[edge_t][3]
 
 """
-    has_edge(g::GNNHeteroGraph, edge_t, i, j)
+    Graphs.has_edge(g::GNNHeteroGraph, edge_t::EType, i::Integer, j::Integer)
 
 Return `true` if there is an edge of type `edge_t` from node `i` to node `j` in `g`.
 

diff --git a/GNNGraphs/src/sampling.jl b/GNNGraphs/src/sampling.jl
@@ -119,7 +119,7 @@ end
 
 
 """
-    induced_subgraph(graph, nodes)
+    Graphs.induced_subgraph(graph::GNNGraph, nodes::Vector{Int})
 
 Generates a subgraph from the original graph using the provided `nodes`. 
 The function includes the nodes' neighbors and creates edges between nodes that are connected in the original graph.