Skip to content

Shortest path implemented in TP3, but really slow #18

@amcp

Description

@amcp

Original shortest path traversal:

Original list of randomly chosen target nodes (range 2-1000, choose 100):

TP3 shortest path traversal:
https://github.com/amcp/graphdb-benchmarks/blob/tp3/src/main/java/eu/socialsensor/graphdatabases/TitanGraphDatabase.java#L281

New method to choose source node:
https://github.com/amcp/graphdb-benchmarks/blob/tp3/src/main/java/eu/socialsensor/graphdatabases/GraphDatabaseBase.java#L128

New method to choose target nodes (choose from entire range of vertices in dataset):
https://github.com/amcp/graphdb-benchmarks/blob/tp3/src/main/java/eu/socialsensor/dataset/Dataset.java#L28

New method to choose number of random target nodes (set the number in configuration file):
https://github.com/amcp/graphdb-benchmarks/blob/tp3/src/test/resources/META-INF/input.properties#L86

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type
    No fields configured for issues without a type.

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions