Examples with KneighborRecords com.baidu.hugegraph.traversal.algorithm.records.KneighborRecords used on opensource projects

Example 1 with KneighborRecords

use of com.baidu.hugegraph.traversal.algorithm.records.KneighborRecords in project incubator-hugegraph by apache.

the class KneighborAPI method post.

@POST
@Timed
@Consumes(APPLICATION_JSON)
@Produces(APPLICATION_JSON_WITH_CHARSET)
public String post(@Context GraphManager manager, @PathParam("graph") String graph, Request request) {
    E.checkArgumentNotNull(request, "The request body can't be null");
    E.checkArgumentNotNull(request.source, "The source of request can't be null");
    E.checkArgument(request.step != null, "The steps of request can't be null");
    if (request.countOnly) {
        E.checkArgument(!request.withVertex && !request.withPath, "Can't return vertex or path when count only");
    }
    LOG.debug("Graph [{}] get customized kneighbor from source vertex " + "'{}', with step '{}', limit '{}', count_only '{}', " + "with_vertex '{}' and with_path '{}'", graph, request.source, request.step, request.limit, request.countOnly, request.withVertex, request.withPath);
    HugeGraph g = graph(manager, graph);
    Id sourceId = HugeVertex.getIdValue(request.source);
    EdgeStep step = step(g, request.step);
    KneighborRecords results;
    try (KneighborTraverser traverser = new KneighborTraverser(g)) {
        results = traverser.customizedKneighbor(sourceId, step, request.maxDepth, request.limit);
    }
    long size = results.size();
    if (request.limit != Query.NO_LIMIT && size > request.limit) {
        size = request.limit;
    }
    List<Id> neighbors = request.countOnly ? ImmutableList.of() : results.ids(request.limit);
    HugeTraverser.PathSet paths = new HugeTraverser.PathSet();
    if (request.withPath) {
        paths.addAll(results.paths(request.limit));
    }
    Iterator<Vertex> iter = QueryResults.emptyIterator();
    if (request.withVertex && !request.countOnly) {
        Set<Id> ids = new HashSet<>(neighbors);
        if (request.withPath) {
            for (HugeTraverser.Path p : paths) {
                ids.addAll(p.vertices());
            }
        }
        if (!ids.isEmpty()) {
            iter = g.vertices(ids.toArray());
        }
    }
    return manager.serializer(g).writeNodesWithPath("kneighbor", neighbors, size, paths, iter);
}

Example 2 with KneighborRecords

use of com.baidu.hugegraph.traversal.algorithm.records.KneighborRecords in project incubator-hugegraph by apache.

the class KneighborTraverser method customizedKneighbor.

public KneighborRecords customizedKneighbor(Id source, EdgeStep step, int maxDepth, long limit) {
    E.checkNotNull(source, "source vertex id");
    this.checkVertexExist(source, "source vertex");
    checkPositive(maxDepth, "k-neighbor max_depth");
    checkLimit(limit);
    boolean concurrent = maxDepth >= this.concurrentDepth();
    KneighborRecords records = new KneighborRecords(concurrent, source, true);
    Consumer<Id> consumer = v -> {
        if (this.reachLimit(limit, records.size())) {
            return;
        }
        Iterator<Edge> edges = edgesOfVertex(v, step);
        while (!this.reachLimit(limit, records.size()) && edges.hasNext()) {
            Id target = ((HugeEdge) edges.next()).id().otherVertexId();
            records.addPath(v, target);
        }
    };
    while (maxDepth-- > 0) {
        records.startOneLayer(true);
        traverseIds(records.keys(), consumer, concurrent);
        records.finishOneLayer();
    }
    return records;
}