Package org.neo4j.graphalgo.impl.util

Examples of org.neo4j.graphalgo.impl.util.DoubleComparator

53
54
55
56
57
58
59
60
    public void testBox()
    {
        graph.makeEdgeChain( "a,b,c,d,a" );
        NetworkRadius<Double> radius = new NetworkRadius<Double>(
            getSingleSourceShortestPath(), 0.0, graph.getAllNodes(),
            new DoubleComparator() );
        assertTrue( radius.getCentrality( null ) == 2.0 );
    }
View Full Code Here
64
65
66
67
68
69
70
71
    {
        graph.makeEdgeChain( "a,b,c" );
        graph.makeEdgeChain( "d,b,e" );
        NetworkRadius<Double> radius = new NetworkRadius<Double>(
            getSingleSourceShortestPath(), 0.0, graph.getAllNodes(),
            new DoubleComparator() );
        assertTrue( radius.getCentrality( null ) == 1.0 );
    }
View Full Code Here
74
75
76
77
78
79
80
81
    public void testChain()
    {
        graph.makeEdgeChain( "a,b,c,d,e" );
        NetworkRadius<Double> radius = new NetworkRadius<Double>(
            getSingleSourceShortestPath(), 0.0, graph.getAllNodes(),
            new DoubleComparator() );
        assertTrue( radius.getCentrality( null ) == 2.0 );
    }
View Full Code Here
53
54
55
56
57
58
59
60
    public void testBox()
    {
        graph.makeEdgeChain( "a,b,c,d,a" );
        NetworkDiameter<Double> diameter = new NetworkDiameter<Double>(
            getSingleSourceShortestPath(), 0.0, graph.getAllNodes(),
            new DoubleComparator() );
        assertTrue( diameter.getCentrality( null ) == 2.0 );
    }
View Full Code Here
64
65
66
67
68
69
70
71
    {
        graph.makeEdgeChain( "a,b,c" );
        graph.makeEdgeChain( "d,b,e" );
        NetworkDiameter<Double> diameter = new NetworkDiameter<Double>(
            getSingleSourceShortestPath(), 0.0, graph.getAllNodes(),
            new DoubleComparator() );
        assertTrue( diameter.getCentrality( null ) == 2.0 );
    }
View Full Code Here
74
75
76
77
78
79
80
81
    public void testChain()
    {
        graph.makeEdgeChain( "a,b,c,d,e" );
        NetworkDiameter<Double> diameter = new NetworkDiameter<Double>(
            getSingleSourceShortestPath(), 0.0, graph.getAllNodes(),
            new DoubleComparator() );
        assertTrue( diameter.getCentrality( null ) == 4.0 );
    }
View Full Code Here
238
239
240
241
242
243
244
245
246
247
248
                public Double getCost( Relationship relationship,
                    Direction direction )
                {
                    return 1.0;
                }
            }, new DoubleAdder(), new DoubleComparator(), Direction.OUTGOING,
            MyRelTypes.R1 );
        // path discovery flags
        boolean pathBD = false;
        boolean pathB2D = false;
        boolean pathBD2 = false;
View Full Code Here
329
330
331
332
333
334
335
336
337
338
339
                public Double getCost( Relationship relationship,
                    Direction direction )
                {
                    return 1.0;
                }
            }, new DoubleAdder(), new DoubleComparator(), Direction.OUTGOING,
            MyRelTypes.R1 );
        // path discovery flags
        boolean pathBD = false;
        boolean pathB2D = false;
        boolean pathBD2 = false;
View Full Code Here
50
51
52
53
54
55
56
    }

    Eccentricity<Double> getCentralityAlgorithm()
    {
        return new Eccentricity<Double>( getSingleSourceShortestPath(), 0.0,
            graph.getAllNodes(), new DoubleComparator() );
    }
View Full Code Here
43
44
45
46
47
48
49
50
                    public Double getCost( Relationship relationship,
                            Direction direction )
                    {
                        return 1.0;
                    }
                }, new DoubleAdder(), new DoubleComparator(), Direction.BOTH,
                relTypes );
    }
View Full Code Here
TOP

Related Classes of org.neo4j.graphalgo.impl.util.DoubleComparator

  • org.neo4j.graphalgo.centrality.EccentricityTest
  • org.neo4j.graphalgo.centrality.NetworkDiameterTest
  • org.neo4j.graphalgo.centrality.NetworkRadiusTest
  • org.neo4j.graphalgo.shortestpath.DijkstraIteratorTest$TestDijkstra
  • org.neo4j.graphalgo.shortestpath.DijkstraMultiplePathsTest
  • org.neo4j.graphalgo.shortestpath.DijkstraMultipleRelationshipTypesTest
    • Copyright © 2018 www.massapicom. 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.