Package com.gpudb.protocol

Class SolveGraphRequest.SolverType

    • Field Summary

      Fields 
      Modifier and Type Field Description
      static String ALLPATHS
      Solves for paths that would give costs between max and min solution radia - Make sure to limit by the 'max_solution_targets' option.
      static String BACKHAUL_ROUTING
      Solves for optimal routes that connect remote asset nodes to the fixed (backbone) asset nodes.
      static String CENTRALITY
      Solves for the degree of a node to depict how many pairs of individuals that would have to go through the node to reach one another in the minimum number of hops.
      static String CLOSENESS
      Solves for the centrality closeness score per node as the sum of the inverse shortest path costs to all nodes in the graph.
      static String INVERSE_SHORTEST_PATH
      Solves for finding the optimal path cost for each destination node to route to the source node.
      static String MULTIPLE_ROUTING
      Solves for finding the minimum cost cumulative path for a round-trip starting from the given source and visiting each given destination node once then returning to the source.
      static String PAGE_RANK
      Solves for the probability of each destination node being visited based on the links of the graph topology.
      static String PROBABILITY_RANK
      Solves for the transitional probability (Hidden Markov) for each node based on the weights (probability assigned over given edges).
      static String SHORTEST_PATH
      Solves for the optimal (shortest) path based on weights and restrictions from one source to destinations nodes.
      static String STATS_ALL
      Solves for graph statistics such as graph diameter, longest pairs, vertex valences, topology numbers, average and max cluster sizes, etc.

    • Field Detail

      • SHORTEST_PATH

        public static final String SHORTEST_PATH
        Solves for the optimal (shortest) path based on weights and restrictions from one source to destinations nodes. Also known as the Dijkstra solver.
        See Also:
        Constant Field Values

      • PAGE_RANK

        public static final String PAGE_RANK
        Solves for the probability of each destination node being visited based on the links of the graph topology. Weights are not required to use this solver.
        See Also:
        Constant Field Values

      • PROBABILITY_RANK

        public static final String PROBABILITY_RANK
        Solves for the transitional probability (Hidden Markov) for each node based on the weights (probability assigned over given edges).
        See Also:
        Constant Field Values

      • CENTRALITY

        public static final String CENTRALITY
        Solves for the degree of a node to depict how many pairs of individuals that would have to go through the node to reach one another in the minimum number of hops. Also known as betweenness.
        See Also:
        Constant Field Values

      • MULTIPLE_ROUTING

        public static final String MULTIPLE_ROUTING
        Solves for finding the minimum cost cumulative path for a round-trip starting from the given source and visiting each given destination node once then returning to the source. Also known as the traveling salesman problem.
        See Also:
        Constant Field Values

      • INVERSE_SHORTEST_PATH

        public static final String INVERSE_SHORTEST_PATH
        Solves for finding the optimal path cost for each destination node to route to the source node. Also known as inverse Dijkstra or the service man routing problem.
        See Also:
        Constant Field Values

      • BACKHAUL_ROUTING

        public static final String BACKHAUL_ROUTING
        Solves for optimal routes that connect remote asset nodes to the fixed (backbone) asset nodes.
        See Also:
        Constant Field Values

      • ALLPATHS

        public static final String ALLPATHS
        Solves for paths that would give costs between max and min solution radia - Make sure to limit by the 'max_solution_targets' option. Min cost should be >= shortest_path cost.
        See Also:
        Constant Field Values

      • STATS_ALL

        public static final String STATS_ALL
        Solves for graph statistics such as graph diameter, longest pairs, vertex valences, topology numbers, average and max cluster sizes, etc.
        See Also:
        Constant Field Values

      • CLOSENESS

        public static final String CLOSENESS
        Solves for the centrality closeness score per node as the sum of the inverse shortest path costs to all nodes in the graph.
        See Also:
        Constant Field Values