dmlc--dgl
Da Zheng
8651be54c2
* refactor. * accelerate update_all in nodeflow. * fix. * refactor. * fix lint. * fix lint. * reorganize. * reorg. * remove. * add doc. * impl block_incidence_matrix * fix lint. * fix. * simple fix. * fix test. * fix interface. * fix eid. * fix comments.
69 行
2.4 KiB
C++
69 行
2.4 KiB
C++
/*!
|
|
* Copyright (c) 2018 by Contributors
|
|
* \file dgl/sampler.h
|
|
* \brief DGL sampler header.
|
|
*/
|
|
#ifndef DGL_SAMPLER_H_
|
|
#define DGL_SAMPLER_H_
|
|
|
|
#include <vector>
|
|
#include <string>
|
|
#include "graph_interface.h"
|
|
#include "nodeflow.h"
|
|
|
|
namespace dgl {
|
|
|
|
class ImmutableGraph;
|
|
|
|
class SamplerOp {
|
|
public:
|
|
/*!
|
|
* \brief Sample a graph from the seed vertices with neighbor sampling.
|
|
* The neighbors are sampled with a uniform distribution.
|
|
*
|
|
* \param graphs A graph for sampling.
|
|
* \param seeds the nodes where we should start to sample.
|
|
* \param edge_type the type of edges we should sample neighbors.
|
|
* \param num_hops the number of hops to sample neighbors.
|
|
* \param expand_factor the max number of neighbors to sample.
|
|
* \param add_self_loop whether to add self loop to the sampled subgraph
|
|
* \return a NodeFlow graph.
|
|
*/
|
|
static NodeFlow NeighborUniformSample(const ImmutableGraph *graph,
|
|
const std::vector<dgl_id_t>& seeds,
|
|
const std::string &edge_type,
|
|
int num_hops, int expand_factor,
|
|
const bool add_self_loop);
|
|
|
|
/*!
|
|
* \brief Sample a graph from the seed vertices with layer sampling.
|
|
* The layers are sampled with a uniform distribution.
|
|
*
|
|
* \param graphs A graph for sampling.
|
|
* \param seeds the nodes where we should start to sample.
|
|
* \param edge_type the type of edges we should sample neighbors.
|
|
* \param layer_sizes The size of layers.
|
|
* \return a NodeFlow graph.
|
|
*/
|
|
static NodeFlow LayerUniformSample(const ImmutableGraph *graph,
|
|
const std::vector<dgl_id_t>& seeds,
|
|
const std::string &neigh_type,
|
|
IdArray layer_sizes);
|
|
|
|
/*!
|
|
* \brief Batch-generate random walk traces
|
|
* \param seeds The array of starting vertex IDs
|
|
* \param num_traces The number of traces to generate for each seed
|
|
* \param num_hops The number of hops for each trace
|
|
* \return a flat ID array with shape (num_seeds, num_traces, num_hops + 1)
|
|
*/
|
|
static IdArray RandomWalk(const GraphInterface *gptr,
|
|
IdArray seeds,
|
|
int num_traces,
|
|
int num_hops);
|
|
};
|
|
|
|
} // namespace dgl
|
|
|
|
#endif // DGL_SAMPLER_H_
|