Package edu.cmu.graphchi.walks

Examples of edu.cmu.graphchi.walks.IntDrunkardContext.forwardWalkTo()


                    int nextHop  = vertex.getOutEdgeId(randomGenerator.nextInt(numOutEdges));

                    // Optimization to tell the manager that walks that have just been started
                    // need not to be tracked.
                    boolean shouldTrack = !drunkardContext.isWalkStartedFromVertex(walk);
                    drunkardContext.forwardWalkTo(walk, nextHop, shouldTrack);
                }
            }

        } else {
            // Reset all walks -- no where to go from here
View Full Code Here


                    int nextHop  = vertex.getOutEdgeId(randomGenerator.nextInt(numOutEdges));

                    // Optimization to tell the manager that walks that have just been started
                    // need not to be tracked.
                    boolean shouldTrack = !drunkardContext.isWalkStartedFromVertex(walk);
                    drunkardContext.forwardWalkTo(walk, nextHop, shouldTrack);
                }
            }

        } else {
            // Reset all walks -- no where to go from here
View Full Code Here

                }

                for(int w : walks) {
                    if (drunkardContext.isWalkStartedFromVertex(w)) {
                        int randomBadRating = badlyRated.get(randomGenerator.nextInt(badlyRated.size()));
                        drunkardContext.forwardWalkTo(w, randomBadRating, true);

                        if (vertex.getId() == 0) {
                            for(int i=0; i<vertex.numOutEdges(); i++) {
                                if (vertex.getOutEdgeId(i== randomBadRating) {
                                    System.out.println("BAD ====> " + randomBadRating + "; " + vertex.getOutEdgeValue(i));
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.