A set of string constants for the parameter MatchGraphRequest.solve_method. More…
Static Public Attributes | |
| const string | MARKOV_CHAIN = “markov_chain” |
| Matches MatchGraphRequest.sample_points to the graph using the Hidden Markov Model (HMM)-based method, which conducts a range-tree closest-edge search to find the best combinations of possible road segments (NUM_SEGMENTS) for each sample point to create the best route. | |
| const string | MATCH_OD_PAIRS = “match_od_pairs” |
| Matches MatchGraphRequest.sample_points to find the most probable path between origin and destination pairs with cost constraints. | |
| const string | MATCH_SUPPLY_DEMAND = “match_supply_demand” |
| Matches MatchGraphRequest.sample_points to optimize scheduling multiple supplies (trucks) with varying sizes to varying demand sites with varying capacities per depot. | |
| const string | MATCH_BATCH_SOLVES = “match_batch_solves” |
| Matches MatchGraphRequest.sample_points source and destination pairs for the shortest path solves in batch mode. | |
| const string | MATCH_LOOPS = “match_loops” |
| Matches closed loops (Eulerian paths) originating and ending at each graph node within min and max hops (levels). | |
| const string | MATCH_CHARGING_STATIONS = “match_charging_stations” |
| Matches an optimal path across a number of ev-charging stations between source and target locations. | |
| const string | MATCH_SIMILARITY = “match_similarity” |
| Matches the intersection set(s) by computing the Jaccard similarity score between node pairs. | |
| const string | MATCH_PICKUP_DROPOFF = “match_pickup_dropoff” |
| Matches the pickups and dropoffs by optimizing the total trip costs. | |
| const string | MATCH_CLUSTERS = “match_clusters” |
| Matches the graph nodes with a cluster index using Louvain clustering algorithm. | |
| const string | MATCH_PATTERN = “match_pattern” |
| Matches a pattern in the graph. | |
| const string | MATCH_EMBEDDING = “match_embedding” |
| Creates vector node embeddings. | |
| const string | MATCH_ISOCHRONE = “match_isochrone” |
| Solves for isochrones for a set of input sources. | |
| const string | MATCH_ROUTE_DETOUR = “match_route_detour” |
| Computes detour costs for nearby stations at a mark point along each source-target route. | |
Detailed Description
A set of string constants for the parameter MatchGraphRequest.solve_method.
The type of solver to use for graph matching.
Definition at line 30 of file MatchGraph.cs.
Member Data Documentation
◆ MARKOV_CHAIN
| static |
Matches MatchGraphRequest.sample_points to the graph using the Hidden Markov Model (HMM)-based method, which conducts a range-tree closest-edge search to find the best combinations of possible road segments (NUM_SEGMENTS) for each sample point to create the best route.
The route is secured one point at a time while looking ahead CHAIN_WIDTH number of points, so the prediction is corrected after each point. This solution type is the most accurate but also the most computationally intensive. Related options: NUM_SEGMENTS and CHAIN_WIDTH.
Definition at line 48 of file MatchGraph.cs.
◆ MATCH_BATCH_SOLVES
| static |
Matches MatchGraphRequest.sample_points source and destination pairs for the shortest path solves in batch mode.
Definition at line 69 of file MatchGraph.cs.
◆ MATCH_CHARGING_STATIONS
| static |
Matches an optimal path across a number of ev-charging stations between source and target locations.
Definition at line 78 of file MatchGraph.cs.
◆ MATCH_CLUSTERS
| static |
Matches the graph nodes with a cluster index using Louvain clustering algorithm.
Definition at line 90 of file MatchGraph.cs.
◆ MATCH_EMBEDDING
| static |
Creates vector node embeddings.
Definition at line 96 of file MatchGraph.cs.
◆ MATCH_ISOCHRONE
| static |
Solves for isochrones for a set of input sources.
Definition at line 100 of file MatchGraph.cs.
◆ MATCH_LOOPS
| static |
Matches closed loops (Eulerian paths) originating and ending at each graph node within min and max hops (levels).
Definition at line 74 of file MatchGraph.cs.
◆ MATCH_OD_PAIRS
| static |
Matches MatchGraphRequest.sample_points to find the most probable path between origin and destination pairs with cost constraints.
Definition at line 53 of file MatchGraph.cs.
◆ MATCH_PATTERN
| static |
Matches a pattern in the graph.
Definition at line 93 of file MatchGraph.cs.
◆ MATCH_PICKUP_DROPOFF
| static |
Matches the pickups and dropoffs by optimizing the total trip costs.
Definition at line 86 of file MatchGraph.cs.
◆ MATCH_ROUTE_DETOUR
| static |
Computes detour costs for nearby stations at a mark point along each source-target route.
Definition at line 104 of file MatchGraph.cs.
◆ MATCH_SIMILARITY
| static |
Matches the intersection set(s) by computing the Jaccard similarity score between node pairs.
Definition at line 82 of file MatchGraph.cs.
◆ MATCH_SUPPLY_DEMAND
| static |
Matches MatchGraphRequest.sample_points to optimize scheduling multiple supplies (trucks) with varying sizes to varying demand sites with varying capacities per depot.
Related options: PARTIAL_LOADING and MAX_COMBINATIONS.
Definition at line 64 of file MatchGraph.cs.
The documentation for this struct was generated from the following files:
- _build/public-os_ubuntu24.04-arch_amd64-cc_gcc_13.3.0/install/Kinetica/Protocol/MatchGraph.cs
- Kinetica/Protocol/MatchGraph.cs