Python-EasyGraph 1.4.6__tar.gz → 1.5.1__tar.gz

{python_easygraph-1.4.6/Python_EasyGraph.egg-info → python_easygraph-1.5.1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: Python-EasyGraph
-Version: 1.4.6
+Version: 1.5.1
 Summary: Easy Graph
 Home-page: https://github.com/easy-graph/Easy-Graph
 Author: Fudan DataNET Group
@@ -11,13 +11,14 @@ Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
+Classifier: Programming Language :: Python :: 3.14
 Classifier: License :: OSI Approved :: BSD License
 Classifier: Operating System :: OS Independent
-Requires-Python: >=3.8, <3.14
+Requires-Python: >=3.8, <3.15
 Description-Content-Type: text/markdown
 License-File: LICENSE
 Requires-Dist: numpy>=1.23.1; python_version >= "3.10"
-Requires-Dist: numpy>=1.19.5; python_version >= "3.7" and python_version <= "3.13"
+Requires-Dist: numpy>=1.19.5; python_version >= "3.7" and python_version <= "3.14"
 Requires-Dist: tqdm>=4.49.0
 Requires-Dist: joblib>=1.2.0
 Requires-Dist: six>=1.16.0
@@ -100,9 +101,10 @@ It bridges the gap between EasyGraph and higher-order relationships. EasyHypergr
 👉 For more details, please refer to its [documentation](https://easy-graph.github.io/docs/eggpu.html) page.
 
 # News
-- [06-29-2025] 🎉 Thanks to our amazing community! EasyGraph has reached 800,000 downloads!
-- [05-30-2025] 🎉 Our paper "EasyHypergraph: an open-source software for fast and memory-saving analysis and learning of higher-order networks" was accepted by Humanities and Social Sciences Communications (Nature Portfolio)!
-- [12-04-2024] 🎉 We received the "Top Open Source Certificate" by International Open Benchmark Council!
+- [09-29-2025] 🎉 Thanks to our amazing community! EasyGraph has reached 900,000 downloads!
+- [07-27-2025] 🎉 We released EasyGraph 1.5! This version integrates the HWNN model and supports 11 representative network datasets.
+- [05-30-2025] 🎉 Our paper "EasyHypergraph: an open-source software for fast and memory-saving analysis and learning of higher-order networks" was accepted by Humanities and Social Sciences Communications (Nature Portfolio)! [[PDF](https://www.nature.com/articles/s41599-025-05180-5)]
+- [12-04-2024] 🎉 We received the "Top Open Source Certificate" by International Open Benchmark Council! [[Certificate](https://chenyang03.wordpress.com/wp-content/uploads/2025/07/image.png?w=1024)]
 - [11-22-2024] We released EasyGraph 1.4.1! This version now fully supports Python 3.13.
 - [09-27-2024] 🎉 EasyGraph has reached 500,000 downloads!
 - [09-20-2024] We released EasyGraph 1.4! This version features GPU-powered functions for efficient large network analysis.
@@ -111,7 +113,7 @@ It bridges the gap between EasyGraph and higher-order relationships. EasyHypergr
 - [03-06-2024] 🎉 We received the Shanghai Open Source Innovation Outstanding Achievement Award (Grand Prize)! [News](https://news.fudan.edu.cn/2024/0401/c2463a139799/page.htm)
 - [02-05-2024] We released EasyGraph 1.1! This version features hypergraph analysis and learning for higher-order network modeling and representation.
 - [08-17-2023] We released EasyGraph 1.0!
-- [08-08-2023] 🎉 Our paper "EasyGraph: A Multifunctional, Cross-Platform, and Effective Library for Interdisciplinary Network Analysis" was accepted by Patterns (Cell Press)!
+- [08-08-2023] 🎉 Our paper "EasyGraph: A Multifunctional, Cross-Platform, and Effective Library for Interdisciplinary Network Analysis" was accepted by Patterns (Cell Press)! [[PDF](https://www.sciencedirect.com/science/article/pii/S2666389923002180)]
 - [07-22-2020] First public release of EasyGraph!
 
 # Stargazers

{python_easygraph-1.4.6 → python_easygraph-1.5.1/Python_EasyGraph.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: Python-EasyGraph
-Version: 1.4.6
+Version: 1.5.1
 Summary: Easy Graph
 Home-page: https://github.com/easy-graph/Easy-Graph
 Author: Fudan DataNET Group
@@ -11,13 +11,14 @@ Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
+Classifier: Programming Language :: Python :: 3.14
 Classifier: License :: OSI Approved :: BSD License
 Classifier: Operating System :: OS Independent
-Requires-Python: >=3.8, <3.14
+Requires-Python: >=3.8, <3.15
 Description-Content-Type: text/markdown
 License-File: LICENSE
 Requires-Dist: numpy>=1.23.1; python_version >= "3.10"
-Requires-Dist: numpy>=1.19.5; python_version >= "3.7" and python_version <= "3.13"
+Requires-Dist: numpy>=1.19.5; python_version >= "3.7" and python_version <= "3.14"
 Requires-Dist: tqdm>=4.49.0
 Requires-Dist: joblib>=1.2.0
 Requires-Dist: six>=1.16.0
@@ -100,9 +101,10 @@ It bridges the gap between EasyGraph and higher-order relationships. EasyHypergr
 👉 For more details, please refer to its [documentation](https://easy-graph.github.io/docs/eggpu.html) page.
 
 # News
-- [06-29-2025] 🎉 Thanks to our amazing community! EasyGraph has reached 800,000 downloads!
-- [05-30-2025] 🎉 Our paper "EasyHypergraph: an open-source software for fast and memory-saving analysis and learning of higher-order networks" was accepted by Humanities and Social Sciences Communications (Nature Portfolio)!
-- [12-04-2024] 🎉 We received the "Top Open Source Certificate" by International Open Benchmark Council!
+- [09-29-2025] 🎉 Thanks to our amazing community! EasyGraph has reached 900,000 downloads!
+- [07-27-2025] 🎉 We released EasyGraph 1.5! This version integrates the HWNN model and supports 11 representative network datasets.
+- [05-30-2025] 🎉 Our paper "EasyHypergraph: an open-source software for fast and memory-saving analysis and learning of higher-order networks" was accepted by Humanities and Social Sciences Communications (Nature Portfolio)! [[PDF](https://www.nature.com/articles/s41599-025-05180-5)]
+- [12-04-2024] 🎉 We received the "Top Open Source Certificate" by International Open Benchmark Council! [[Certificate](https://chenyang03.wordpress.com/wp-content/uploads/2025/07/image.png?w=1024)]
 - [11-22-2024] We released EasyGraph 1.4.1! This version now fully supports Python 3.13.
 - [09-27-2024] 🎉 EasyGraph has reached 500,000 downloads!
 - [09-20-2024] We released EasyGraph 1.4! This version features GPU-powered functions for efficient large network analysis.
@@ -111,7 +113,7 @@ It bridges the gap between EasyGraph and higher-order relationships. EasyHypergr
 - [03-06-2024] 🎉 We received the Shanghai Open Source Innovation Outstanding Achievement Award (Grand Prize)! [News](https://news.fudan.edu.cn/2024/0401/c2463a139799/page.htm)
 - [02-05-2024] We released EasyGraph 1.1! This version features hypergraph analysis and learning for higher-order network modeling and representation.
 - [08-17-2023] We released EasyGraph 1.0!
-- [08-08-2023] 🎉 Our paper "EasyGraph: A Multifunctional, Cross-Platform, and Effective Library for Interdisciplinary Network Analysis" was accepted by Patterns (Cell Press)!
+- [08-08-2023] 🎉 Our paper "EasyGraph: A Multifunctional, Cross-Platform, and Effective Library for Interdisciplinary Network Analysis" was accepted by Patterns (Cell Press)! [[PDF](https://www.sciencedirect.com/science/article/pii/S2666389923002180)]
 - [07-22-2020] First public release of EasyGraph!
 
 # Stargazers

{python_easygraph-1.4.6 → python_easygraph-1.5.1}/Python_EasyGraph.egg-info/SOURCES.txt

@@ -37,6 +37,7 @@ cpp_easygraph/functions/centrality/__init__.h
 cpp_easygraph/functions/centrality/betweenness.cpp
 cpp_easygraph/functions/centrality/centrality.h
 cpp_easygraph/functions/centrality/closeness.cpp
+cpp_easygraph/functions/centrality/katz_centrality.cpp
 cpp_easygraph/functions/components/__init__.h
 cpp_easygraph/functions/components/biconnected.cpp
 cpp_easygraph/functions/components/biconnected.h
@@ -86,13 +87,24 @@ easygraph/datapipe/common.py
 easygraph/datapipe/loader.py
 easygraph/datapipe/normalize.py
 easygraph/datasets/__init__.py
+easygraph/datasets/amazon_photo.py
+easygraph/datasets/arxiv.py
 easygraph/datasets/citation_graph.py
+easygraph/datasets/coauthor.py
+easygraph/datasets/facebook_ego.py
+easygraph/datasets/flickr.py
 easygraph/datasets/get_sample_graph.py
+easygraph/datasets/github.py
 easygraph/datasets/gnn_benchmark.py
 easygraph/datasets/graph_dataset_base.py
 easygraph/datasets/karate.py
 easygraph/datasets/ppi.py
+easygraph/datasets/reddit.py
+easygraph/datasets/roadnet.py
+easygraph/datasets/twitter_ego.py
 easygraph/datasets/utils.py
+easygraph/datasets/web_google.py
+easygraph/datasets/wiki_topcats.py
 easygraph/datasets/dynamic/__init__.py
 easygraph/datasets/dynamic/email_enron.py
 easygraph/datasets/dynamic/email_eu.py
@@ -136,6 +148,7 @@ easygraph/functions/centrality/closeness.py
 easygraph/functions/centrality/degree.py
 easygraph/functions/centrality/ego_betweenness.py
 easygraph/functions/centrality/flowbetweenness.py
+easygraph/functions/centrality/katz_centrality.py
 easygraph/functions/centrality/laplacian.py
 easygraph/functions/centrality/pagerank.py
 easygraph/functions/centrality/tests/__init__.py

{python_easygraph-1.4.6 → python_easygraph-1.5.1}/Python_EasyGraph.egg-info/requires.txt

@@ -22,7 +22,7 @@ numpy>=1.23.1
 [:python_version >= "3.7"]
 statsmodels>=0.12.0
 
-[:python_version >= "3.7" and python_version <= "3.13"]
+[:python_version >= "3.7" and python_version <= "3.14"]
 numpy>=1.19.5
 
 [:python_version >= "3.8"]

{python_easygraph-1.4.6 → python_easygraph-1.5.1}/README.md

@@ -52,9 +52,10 @@ It bridges the gap between EasyGraph and higher-order relationships. EasyHypergr
 👉 For more details, please refer to its [documentation](https://easy-graph.github.io/docs/eggpu.html) page.
 
 # News
-- [06-29-2025] 🎉 Thanks to our amazing community! EasyGraph has reached 800,000 downloads!
-- [05-30-2025] 🎉 Our paper "EasyHypergraph: an open-source software for fast and memory-saving analysis and learning of higher-order networks" was accepted by Humanities and Social Sciences Communications (Nature Portfolio)!
-- [12-04-2024] 🎉 We received the "Top Open Source Certificate" by International Open Benchmark Council!
+- [09-29-2025] 🎉 Thanks to our amazing community! EasyGraph has reached 900,000 downloads!
+- [07-27-2025] 🎉 We released EasyGraph 1.5! This version integrates the HWNN model and supports 11 representative network datasets.
+- [05-30-2025] 🎉 Our paper "EasyHypergraph: an open-source software for fast and memory-saving analysis and learning of higher-order networks" was accepted by Humanities and Social Sciences Communications (Nature Portfolio)! [[PDF](https://www.nature.com/articles/s41599-025-05180-5)]
+- [12-04-2024] 🎉 We received the "Top Open Source Certificate" by International Open Benchmark Council! [[Certificate](https://chenyang03.wordpress.com/wp-content/uploads/2025/07/image.png?w=1024)]
 - [11-22-2024] We released EasyGraph 1.4.1! This version now fully supports Python 3.13.
 - [09-27-2024] 🎉 EasyGraph has reached 500,000 downloads!
 - [09-20-2024] We released EasyGraph 1.4! This version features GPU-powered functions for efficient large network analysis.
@@ -63,7 +64,7 @@ It bridges the gap between EasyGraph and higher-order relationships. EasyHypergr
 - [03-06-2024] 🎉 We received the Shanghai Open Source Innovation Outstanding Achievement Award (Grand Prize)! [News](https://news.fudan.edu.cn/2024/0401/c2463a139799/page.htm)
 - [02-05-2024] We released EasyGraph 1.1! This version features hypergraph analysis and learning for higher-order network modeling and representation.
 - [08-17-2023] We released EasyGraph 1.0!
-- [08-08-2023] 🎉 Our paper "EasyGraph: A Multifunctional, Cross-Platform, and Effective Library for Interdisciplinary Network Analysis" was accepted by Patterns (Cell Press)!
+- [08-08-2023] 🎉 Our paper "EasyGraph: A Multifunctional, Cross-Platform, and Effective Library for Interdisciplinary Network Analysis" was accepted by Patterns (Cell Press)! [[PDF](https://www.sciencedirect.com/science/article/pii/S2666389923002180)]
 - [07-22-2020] First public release of EasyGraph!
 
 # Stargazers

{python_easygraph-1.4.6 → python_easygraph-1.5.1}/cpp_easygraph/cpp_easygraph.cpp

@@ -77,6 +77,7 @@ PYBIND11_MODULE(cpp_easygraph, m) {
 
     m.def("cpp_closeness_centrality", &closeness_centrality, py::arg("G"), py::arg("weight") = "weight", py::arg("cutoff") = py::none(), py::arg("sources") = py::none());
     m.def("cpp_betweenness_centrality", &betweenness_centrality, py::arg("G"), py::arg("weight") = "weight", py::arg("cutoff") = py::none(),py::arg("sources") = py::none(), py::arg("normalized") = py::bool_(true), py::arg("endpoints") = py::bool_(false));
+    m.def("cpp_katz_centrality", &cpp_katz_centrality, py::arg("G"), py::arg("alpha") = 0.1, py::arg("beta") = 1.0, py::arg("max_iter") = 1000, py::arg("tol") = 1e-6, py::arg("normalized") = true);
     m.def("cpp_k_core", &core_decomposition, py::arg("G"));
     m.def("cpp_density", &density, py::arg("G"));
     m.def("cpp_constraint", &constraint, py::arg("G"), py::arg("nodes") = py::none(), py::arg("weight") = py::none(), py::arg("n_workers") = py::none());

{python_easygraph-1.4.6 → python_easygraph-1.5.1}/cpp_easygraph/functions/centrality/centrality.h

@@ -4,4 +4,12 @@
 
 py::object closeness_centrality(py::object G, py::object weight, py::object cutoff, py::object sources);
 py::object betweenness_centrality(py::object G, py::object weight, py::object cutoff, py::object sources, 
-                                    py::object normalized, py::object endpoints);
+                                    py::object normalized, py::object endpoints);
+py::object cpp_katz_centrality(
+    py::object G,
+    py::object py_alpha,
+    py::object py_beta,
+    py::object py_max_iter,
+    py::object py_tol,
+    py::object py_normalized
+);

python_easygraph-1.5.1/cpp_easygraph/functions/centrality/katz_centrality.cpp

@@ -0,0 +1,120 @@
+#include <cmath>
+#include <vector>
+#include <pybind11/pybind11.h>
+#include <pybind11/stl.h>
+#include "centrality.h"
+#include "../../classes/graph.h"
+
+namespace py = pybind11;
+
+py::object cpp_katz_centrality(
+    py::object G,
+    py::object py_alpha,
+    py::object py_beta,
+    py::object py_max_iter,
+    py::object py_tol,
+    py::object py_normalized
+) {
+    try {
+        Graph& graph = G.cast<Graph&>();
+        auto csr = graph.gen_CSR();
+        int n = csr->nodes.size();
+
+        if (n == 0) {
+            return py::dict();
+        }
+
+        // Initialize vectors
+        std::vector<double> x0(n, 1.0);
+        std::vector<double> x1(n);
+        std::vector<double>* x_prev = &x0;
+        std::vector<double>* x_next = &x1;
+
+        // Process beta parameter
+        std::vector<double> b(n);
+        if (py::isinstance<py::float_>(py_beta) || py::isinstance<py::int_>(py_beta)) {
+            double beta_val = py_beta.cast<double>();
+            for (int i = 0; i < n; i++) {
+                b[i] = beta_val;
+            }
+        } else if (py::isinstance<py::dict>(py_beta)) {
+            py::dict beta_dict = py_beta.cast<py::dict>();
+            for (int i = 0; i < n; i++) {
+                node_t internal_id = csr->nodes[i];
+                py::object node_obj = graph.id_to_node[py::cast(internal_id)];
+                if (beta_dict.contains(node_obj)) {
+                    b[i] = beta_dict[node_obj].cast<double>();
+                } else {
+                    b[i] = 1.0;
+                }
+            }
+        } else {
+            throw py::type_error("beta must be a float or a dict");
+        }
+
+        // Extract parameters
+        double alpha = py_alpha.cast<double>();
+        int max_iter = py_max_iter.cast<int>();
+        double tol = py_tol.cast<double>();
+        bool normalized = py_normalized.cast<bool>();
+
+        // Iterative updates
+        int iter = 0;
+        for (; iter < max_iter; iter++) {
+            for (int i = 0; i < n; i++) {
+                double sum = 0.0;
+                int start = csr->V[i];
+                int end = csr->V[i + 1];
+                for (int jj = start; jj < end; jj++) {
+                    int j = csr->E[jj];
+                    sum += (*x_prev)[j];
+                }
+                (*x_next)[i] = alpha * sum + b[i];
+            }
+
+            // Check convergence
+            double change = 0.0;
+            for (int i = 0; i < n; i++) {
+                change += std::abs((*x_next)[i] - (*x_prev)[i]);
+            }
+
+            if (change < tol) {
+                break;
+            }
+
+            std::swap(x_prev, x_next);
+        }
+
+        // Handle convergence failure
+        if (iter == max_iter) {
+            throw std::runtime_error("Katz centrality failed to converge in " + std::to_string(max_iter) + " iterations");
+        }
+
+        // Normalization
+        std::vector<double>& x_final = *x_next;
+        if (normalized) {
+            double norm = 0.0;
+            for (double val : x_final) {
+                norm += val * val;
+            }
+            norm = std::sqrt(norm);
+            if (norm > 0) {
+                for (int i = 0; i < n; i++) {
+                    x_final[i] /= norm;
+                }
+            }
+        }
+
+        // Prepare results
+        py::dict result;
+        for (int i = 0; i < n; i++) {
+            node_t internal_id = csr->nodes[i];
+            py::object node_obj = graph.id_to_node[py::cast(internal_id)];
+            result[node_obj] = x_final[i];
+        }
+
+        return result;
+    } catch (const std::exception& e) {
+        throw std::runtime_error(e.what());
+    }
+}

{python_easygraph-1.4.6 → python_easygraph-1.5.1}/easygraph/datasets/__init__.py

@@ -1,3 +1,4 @@
+# risky imports
 try:
     from easygraph.datasets.get_sample_graph import *
     from easygraph.datasets.gnn_benchmark import *
@@ -8,16 +9,27 @@ try:
     from easygraph.datasets.karate import KarateClubDataset
     from easygraph.datasets.mathoverflow_answers import mathoverflow_answers
 
-    from .citation_graph import CitationGraphDataset
-    from .citation_graph import CiteseerGraphDataset
-    from .citation_graph import CoraBinary
-    from .citation_graph import CoraGraphDataset
-    from .citation_graph import PubmedGraphDataset
     from .ppi import LegacyPPIDataset
     from .ppi import PPIDataset
-
-except:
+except Exception as e:
     print(
         " Please install Pytorch before use graph-related datasets and"
         " hypergraph-related datasets."
     )
+
+from .amazon_photo import AmazonPhotoDataset
+from .arxiv import ArxivHEPTHDataset
+from .citation_graph import CitationGraphDataset
+from .citation_graph import CiteseerGraphDataset
+from .citation_graph import CoraBinary
+from .citation_graph import CoraGraphDataset
+from .citation_graph import PubmedGraphDataset
+from .coauthor import CoauthorCSDataset
+from .facebook_ego import FacebookEgoNetDataset
+from .flickr import FlickrDataset
+from .github import GitHubUsersDataset
+from .reddit import RedditDataset
+from .roadnet import RoadNetCADataset
+from .twitter_ego import TwitterEgoDataset
+from .web_google import WebGoogleDataset
+from .wiki_topcats import WikiTopCatsDataset

python_easygraph-1.5.1/easygraph/datasets/amazon_photo.py

@@ -0,0 +1,110 @@
+import os
+
+import easygraph as eg
+import numpy as np
+import scipy.sparse as sp
+
+from easygraph.classes.graph import Graph
+
+from .graph_dataset_base import EasyGraphBuiltinDataset
+from .utils import data_type_dict
+from .utils import download
+from .utils import extract_archive
+from .utils import tensor
+
+
+class AmazonPhotoDataset(EasyGraphBuiltinDataset):
+    r"""Amazon Electronics Photo co-purchase graph dataset.
+
+    Nodes represent products, and edges link products frequently co-purchased.
+    Node features are bag-of-words of product reviews. The task is to classify
+    the product category.
+
+    Statistics:
+
+    - Nodes: 7,650
+    - Edges: 119,081
+    - Number of Classes: 8
+    - Features: 745
+
+    Parameters
+    ----------
+    raw_dir : str, optional
+        Raw file directory to download/contains the input data directory. Default: None
+    force_reload : bool, optional
+        Whether to reload the dataset. Default: False
+    verbose : bool, optional
+        Whether to print out progress information. Default: True
+    transform : callable, optional
+        A transform that takes in a :class:`~easygraph.Graph` object and returns
+        a transformed version. The :class:`~easygraph.Graph` object will be
+        transformed before every access.
+
+    Examples
+    --------
+    >>> from easygraph.datasets import AmazonPhotoDataset
+    >>> dataset = AmazonPhotoDataset()
+    >>> g = dataset[0]
+    >>> print(g.number_of_nodes())
+    >>> print(g.number_of_edges())
+    >>> print(g.nodes[0]['feat'].shape)
+    >>> print(g.nodes[0]['label'])
+    >>> print(dataset.num_classes)
+    """
+
+    def __init__(self, raw_dir=None, force_reload=False, verbose=True, transform=None):
+        name = "amazon_photo"
+        url = "https://data.dgl.ai/dataset/amazon_co_buy_photo.zip"
+        super(AmazonPhotoDataset, self).__init__(
+            name=name,
+            url=url,
+            raw_dir=raw_dir,
+            force_reload=force_reload,
+            verbose=verbose,
+            transform=transform,
+        )
+
+    def process(self):
+        path = os.path.join(self.raw_path, "amazon_co_buy_photo.npz")
+        data = np.load(path)
+
+        adj = sp.csr_matrix(
+            (data["adj_data"], data["adj_indices"], data["adj_indptr"]),
+            shape=data["adj_shape"],
+        )
+
+        features = sp.csr_matrix(
+            (data["attr_data"], data["attr_indices"], data["attr_indptr"]),
+            shape=data["attr_shape"],
+        ).todense()
+
+        labels = data["labels"]
+
+        g = eg.Graph()
+        g.add_edges_from(list(zip(*adj.nonzero())))
+
+        for i in range(features.shape[0]):
+            g.add_node(i, feat=np.array(features[i]).squeeze(), label=int(labels[i]))
+
+        self._g = g
+        self._num_classes = len(np.unique(labels))
+
+        if self.verbose:
+            print("Finished loading AmazonPhoto dataset.")
+            print(f"  NumNodes: {g.number_of_nodes()}")
+            print(f"  NumEdges: {g.number_of_edges()}")
+            print(f"  NumFeats: {features.shape[1]}")
+            print(f"  NumClasses: {self._num_classes}")
+
+    def __getitem__(self, idx):
+        assert idx == 0, "AmazonPhotoDataset only contains one graph"
+        if self._g is None:
+            raise ValueError("Graph has not been loaded or processed correctly.")
+        return self._g if self._transform is None else self._transform(self._g)
+
+    def __len__(self):
+        return 1
+
+    @property
+    def num_classes(self):
+        return self._num_classes

python_easygraph-1.5.1/easygraph/datasets/arxiv.py

@@ -0,0 +1,106 @@
+"""Arxiv HEP-TH Citation Network
+
+This dataset represents the citation network of preprints from the High Energy Physics - Theory (HEP-TH) category on arXiv, covering the period from January 1993 to April 2003.
+
+Each node corresponds to a paper, and a directed edge from paper A to paper B indicates that A cites B.
+
+No features or labels are included in this dataset.
+
+Statistics:
+- Nodes: 27,770
+- Edges: 352,807
+- Features: None
+- Labels: None
+
+Reference:
+J. Leskovec, J. Kleinberg and C. Faloutsos, "Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations,"
+in KDD 2005. Dataset: https://snap.stanford.edu/data/cit-HepTh.html
+"""
+
+import gzip
+import os
+import shutil
+
+import easygraph as eg
+
+from easygraph.classes.graph import Graph
+
+from .graph_dataset_base import EasyGraphBuiltinDataset
+from .utils import download
+
+
+class ArxivHEPTHDataset(EasyGraphBuiltinDataset):
+    r"""Arxiv HEP-TH citation network dataset.
+
+    Parameters
+    ----------
+    raw_dir : str, optional
+        Directory to store the raw downloaded files. Default: None
+    force_reload : bool, optional
+        Whether to re-download and process the dataset. Default: False
+    verbose : bool, optional
+        Whether to print detailed processing logs. Default: True
+    transform : callable, optional
+        Optional transform to apply on the graph.
+
+    Examples
+    --------
+    >>> from easygraph.datasets import ArxivHEPTHDataset
+    >>> dataset = ArxivHEPTHDataset()
+    >>> g = dataset[0]
+    >>> print("Nodes:", g.number_of_nodes())
+    >>> print("Edges:", g.number_of_edges())
+    """
+
+    def __init__(self, raw_dir=None, force_reload=False, verbose=True, transform=None):
+        name = "cit-HepTh"
+        url = "https://snap.stanford.edu/data/cit-HepTh.txt.gz"
+        super(ArxivHEPTHDataset, self).__init__(
+            name=name,
+            url=url,
+            raw_dir=raw_dir,
+            force_reload=force_reload,
+            verbose=verbose,
+            transform=transform,
+        )
+
+    def download(self):
+        r"""Download and decompress the .txt.gz file."""
+        compressed_path = os.path.join(self.raw_dir, self.name + ".txt.gz")
+        extracted_path = os.path.join(self.raw_path, self.name + ".txt")
+
+        download(self.url, path=compressed_path)
+
+        if not os.path.exists(self.raw_path):
+            os.makedirs(self.raw_path)
+
+        with gzip.open(compressed_path, "rb") as f_in:
+            with open(extracted_path, "wb") as f_out:
+                shutil.copyfileobj(f_in, f_out)
+
+    def process(self):
+        graph = eg.DiGraph()  # Citation network is directed
+        edge_list_path = os.path.join(self.raw_path, self.name + ".txt")
+
+        with open(edge_list_path, "r") as f:
+            for line in f:
+                if line.startswith("#") or line.strip() == "":
+                    continue
+                u, v = map(int, line.strip().split())
+                graph.add_edge(u, v)
+
+        self._g = graph
+        self._num_nodes = graph.number_of_nodes()
+        self._num_edges = graph.number_of_edges()
+
+        if self.verbose:
+            print("Finished loading Arxiv HEP-TH dataset.")
+            print(f"  NumNodes: {self._num_nodes}")
+            print(f"  NumEdges: {self._num_edges}")
+
+    def __getitem__(self, idx):
+        assert idx == 0, "ArxivHEPTHDataset only contains one graph"
+        return self._g if self._transform is None else self._transform(self._g)
+
+    def __len__(self):
+        return 1

{python_easygraph-1.4.6 → python_easygraph-1.5.1}/easygraph/datasets/citation_graph.py

@@ -1,6 +1,5 @@
-"""Cora, citeseer, pubmed dataset.
+"""Cora, citeseer, pubmed dataset."""
 
-"""
 from __future__ import absolute_import
 
 import os
@@ -53,9 +52,10 @@ class CitationGraphDataset(EasyGraphBuiltinDataset):
     reorder : bool
         Whether to reorder the graph using :func:`~eg.reorder_graph`. Default: False.
     """
+
     _urls = {
         "cora_v2": "dataset/cora_v2.zip",
-        "citeseer": "dataset/citeSeer.zip",
+        "citeseer": "dataset/citeseer.zip",
         "pubmed": "dataset/pubmed.zip",
     }