Implement InducedSubgraphView

include/networkit/graph/EdgeIterators.hpp

@@ -151,7 +151,7 @@ class EdgeTypeRange {
 public:
     EdgeTypeRange(const GraphType &G) : G(&G) {}
 
-    EdgeTypeRange() : G(nullptr){};
+    EdgeTypeRange() : G(nullptr) {};
 
     ~EdgeTypeRange() = default;
 

include/networkit/graph/Graph.hpp

@@ -470,8 +470,8 @@ class Graph {
      * @brief Virtual method for forInEdgesOf - overridden by GraphW for vector-based iteration
      */
     virtual void
-    forInEdgesVirtualImpl(node u, bool directed, bool weighted, bool hasEdgeIds,
-                          std::function<void(node, node, edgeweight, edgeid)> handle) const;
+    forInEdgesOfVirtualImpl(node u, bool directed, bool weighted, bool hasEdgeIds,
+                            std::function<void(node, node, edgeweight, edgeid)> handle) const;
 
     /**
      * @brief Virtual method for parallelSumForEdges - overridden by GraphW for vector-based
@@ -1198,7 +1198,7 @@ class Graph {
      * @return Iterator range over the neighbors of @a u.
      */
     NeighborRange<false> neighborRange(node u) const {
-        assert(exists[u]);
+        assert(hasNode(u));
         return NeighborRange<false>(*this, u);
     }
 
@@ -1212,7 +1212,7 @@ class Graph {
      */
     NeighborWeightRange<false> weightNeighborRange(node u) const {
         assert(isWeighted());
-        assert(exists[u]);
+        assert(hasNode(u));
         return NeighborWeightRange<false>(*this, u);
     }
 
@@ -1224,7 +1224,7 @@ class Graph {
      */
     NeighborRange<true> inNeighborRange(node u) const {
         assert(isDirected());
-        assert(exists[u]);
+        assert(hasNode(u));
         return NeighborRange<true>(*this, u);
     }
 
@@ -1238,7 +1238,7 @@ class Graph {
      */
     NeighborWeightRange<true> weightInNeighborRange(node u) const {
         assert(isDirected() && isWeighted());
-        assert(exists[u]);
+        assert(hasNode(u));
         return NeighborWeightRange<true>(*this, u);
     }
 
@@ -1737,7 +1737,7 @@ inline void Graph::forInEdgesOfImpl(node u, L handle) const {
         // GraphW's forInEdgesVirtualImpl calls handle(v, u, ...) where v is neighbor and u is
         // current node We need to swap so that edgeLambda receives (current, neighbor, ...) and
         // passes neighbor to f
-        forInEdgesVirtualImpl(
+        forInEdgesOfVirtualImpl(
             u, graphIsDirected, hasWeights, graphHasEdgeIds,
             [&](node v, node u, edgeweight w, edgeid e) { edgeLambda(handle, u, v, w, e); });
     }
@@ -1936,6 +1936,10 @@ void Graph::forEdgesOf(node u, L handle) const {
             }
         }
     } else {
+        // For vector-based graphs (GraphW), use the virtual dispatch
+        // Check exists for mutable graphs
+        if (!exists[u])
+            return;
         // For vector-based graphs, use virtual dispatch
         forEdgesOfVirtualImpl(u, directed, weighted, edgesIndexed,
                               [&](node uu, node vv, edgeweight ww, edgeid ee) {

include/networkit/graph/GraphW.hpp

@@ -958,7 +958,7 @@ class GraphW final : public Graph {
     /**
      * @brief Override for vector-based forInEdgesOf
      */
-    void forInEdgesVirtualImpl(
+    void forInEdgesOfVirtualImpl(
         node u, bool directed, bool weighted, bool hasEdgeIds,
         std::function<void(node, node, edgeweight, edgeid)> handle) const override;
 
@@ -999,7 +999,7 @@ class GraphW final : public Graph {
     public:
         NeighborRange(const GraphW &G, node u) : G(&G), u(u) { assert(G.hasNode(u)); };
 
-        NeighborRange() : G(nullptr){};
+        NeighborRange() : G(nullptr) {};
 
         NeighborIterator begin() const {
             assert(G);
@@ -1037,7 +1037,7 @@ class GraphW final : public Graph {
     public:
         NeighborWeightRange(const GraphW &G, node u) : G(&G), u(u) { assert(G.hasNode(u)); };
 
-        NeighborWeightRange() : G(nullptr){};
+        NeighborWeightRange() : G(nullptr) {};
 
         NeighborWeightIterator begin() const {
             assert(G);