<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Graph on Kinetica Docs</title><link>/7.2/guide-tags/graph/</link><description>Recent content in Graph on Kinetica Docs</description><generator>Hugo -- gohugo.io</generator><language>en</language><atom:link href="/7.2/guide-tags/graph/index.xml" rel="self" type="application/rss+xml"/><item><title>Querying Social Graphs in SQL</title><link>/7.2/guides/query_graph_cinema/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>/7.2/guides/query_graph_cinema/</guid><description>The following is a complete example, using SQL, of querying a graph of movies &amp;amp; TV shows and the people who star in and direct them. For more information on Graphs &amp;amp; Solvers, see Graphs &amp;amp; Solvers Concepts.
Prerequisites Overview Table Setup Person Table Show Table Production Role Table Graph Construction Creation Alteration Querying Hop-Based Supplemental Functions Supplemental Data Nested Graph Queries Download &amp;amp; Run Prerequisites The prerequisites for running this query graph example are listed below:</description></item><item><title>Backhaul Routing in Python</title><link>/7.2/guides/solve_graph_seattle_backhaul/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>/7.2/guides/solve_graph_seattle_backhaul/</guid><description>The following is a complete example, using the Python API, of solving a graph created with Seattle road network data for a backhaul routing problem via the /solve/graph endpoint. For more information on Graphs &amp;amp; Solvers, see Graphs &amp;amp; Solvers Concepts.
Prerequisites Python API Installation Data File Script Detail Constants Graph Creation Backhaul Routing Download &amp;amp; Run Prerequisites The prerequisites for running the backhaul routing solve graph example are listed below:</description></item><item><title>Fitting Road Network Data to a Graph</title><link>/7.2/guides/fitting_data/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>/7.2/guides/fitting_data/</guid><description>The following guide provides step-by-step instructions to get started with fitting existing road network data to a graph. Since edges in graphs can only be composed of two nodes, the weight (or cost to travel) for complex WKT LINESTRINGs (e.g., more than two points) that typically define road networks must be assigned consistently to the segments composing the LINESTRING, as noted under Weights. There are two methods for calculating and assigning weights to a graph with edges derived from large WKT LINESTRINGs:</description></item><item><title>Generate Isochrones</title><link>/7.2/guides/isochrones/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>/7.2/guides/isochrones/</guid><description>The following is a complete example, using the Python API, of generating images containing isochrones via the /visualize/isochrone and /wms endpoints using an existing graph.
Prerequisites Python API Installation Python Virtual Environment PyPI Git Data File Script Detail Connections Constants Graph Creation Visualizing Isochrones Visualizing Isochrones Using WMS Download &amp;amp; Run Prerequisites The prerequisites for running the isochrones example are listed below:
Graph server enabled Python API Isochrones example script DC Shape data CSV file Python API Installation Depending on the target operating system, a Python virtual environment may need to be installed first:</description></item><item><title>Graph Solvers with REST</title><link>/7.2/guides/graph_rest_guide/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>/7.2/guides/graph_rest_guide/</guid><description>The following guide provides step-by-step instructions to get started with using the Graphs &amp;amp; Solvers in Kinetica. This guide demonstrates some key graph concepts as well as how to create and solve a graph using the Kinetica REST API.
Prerequisites Data File Using the REST API Key Information and Concepts Data Graph Concepts Tutorial via REST Client Create Graph Solve the Graph (Shortest Path) Solve the Graph (Multiple Routing) Download &amp;amp; Run Prerequisites D.</description></item><item><title>Graph Solvers with UI</title><link>/7.2/guides/graph_interface_guide/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>/7.2/guides/graph_interface_guide/</guid><description>The following guide provides step-by-step instructions to get started with using the Graphs &amp;amp; Solvers in Kinetica. This guide demonstrates some key graph concepts as well as how to create and solve a graph using the GAdmin graph GUI.
Prerequisites Data File Key Information and Concepts Data Graph Concepts Tutorial via GUI Create Schema Create Graph Solve the Graph (Shortest Path) Solve the Graph (Multiple Routing) Prerequisites D.C. Shape data file Access to GAdmin Data File The tutorial makes use of the dc_shape dataset, which can be ingested from the {{&amp;lt; download &amp;quot;/examples/data/dc_shape.</description></item><item><title>Introduction to Kinetica Graph</title><link>/7.2/guides/graph_video_guide/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>/7.2/guides/graph_video_guide/</guid><description>In this video series, Hari Subhash walks through graphs in Kinetica, from high-level concepts to practical examples.</description></item><item><title>Map Matching with Python</title><link>/7.2/guides/match_graph_seattle_markov/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>/7.2/guides/match_graph_seattle_markov/</guid><description>The following is a complete example, using the Python API, of matching GPS sample data to road network data via the /match/graph endpoint. For more information on Graphs &amp;amp; Solvers, see Graphs &amp;amp; Solvers Concepts.
Prerequisites Python API Installation Data Files Script Detail Constants Graph Creation Matching the Graph without Fold-over Filtering Matching the Graph with Fold-over Filtering Download &amp;amp; Run Prerequisites The prerequisites for running the match graph example are listed below:</description></item><item><title>Multiple Routing on Seattle Road Network</title><link>/7.2/guides/solve_graph_seattle_multi_route/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>/7.2/guides/solve_graph_seattle_multi_route/</guid><description>The following is a complete example, using the Python API, of solving a graph created with Seattle road network data for a multiple routing problem via the /solve/graph endpoint. For more information on Graphs &amp;amp; Solvers, see Graphs &amp;amp; Solvers Concepts.
Prerequisites Python API Installation Data File Script Detail Constants Graph Creation Multiple Routing Download &amp;amp; Run Prerequisites The prerequisites for running the multiple routing solve graph example are listed below:</description></item><item><title>Multiple Supply Demand in Python</title><link>/7.2/guides/match_graph_dc_multi_supply_demand/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>/7.2/guides/match_graph_dc_multi_supply_demand/</guid><description>The following is a complete example, using the Python API, of matching stores (demands) to depots/trucks (suppliers) via the /match/graph endpoint using an underlying graph created from a modified OpenStreetMap (OSM) dataset. For more information on Graphs &amp;amp; Solvers, see Graphs &amp;amp; Solvers Concepts.
Prerequisites Python API Installation Data File Script Detail Constants Table Setup Graph Creation Multiple Supply Demand with Priority Solution Analysis Multiple Supply Demand with Priority and Max Trip Cost Download &amp;amp; Run Prerequisites The prerequisites for running the match graph example are listed below:</description></item><item><title>Page Rank in Python</title><link>/7.2/guides/solve_graph_nyctaxi_page_rank/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>/7.2/guides/solve_graph_nyctaxi_page_rank/</guid><description>The following is a complete example, using the Python API, of solving a graph created with NYC Taxi data for a page rank problem via the /solve/graph endpoint. For more information on Network Graphs &amp;amp; Solvers, see Graphs &amp;amp; Solvers Concepts.
Prerequisites Python API Installation Data File Script Detail Constants Graph Creation Page Rank Download &amp;amp; Run Prerequisites The prerequisites for running the page rank solve graph example are listed below:</description></item><item><title>Querying Social Graphs in Python</title><link>/7.2/guides/query_graph_social/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>/7.2/guides/query_graph_social/</guid><description>The following is a complete example, using the Python API, of querying social relationship data via the /query/graph endpoint. For more information on Graphs &amp;amp; Solvers, see Graphs &amp;amp; Solvers Concepts.
Prerequisites Python API Installation Script Detail Constants Table Setup Graph Creation Querying the Graph Download &amp;amp; Run Prerequisites The prerequisites for running the query graph example are listed below:
Graph server enabled Python API Query graph script Python API Installation Depending on the target operating system, a Python virtual environment may need to be installed first:</description></item><item><title>Shortest Path with Python</title><link>/7.2/guides/solve_graph_seattle_shortest_path/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>/7.2/guides/solve_graph_seattle_shortest_path/</guid><description>The following is a complete example, using the Python API, of solving a graph created with Seattle road network data for a shortest path problem via the /solve/graph endpoint. For more information on Graphs &amp;amp; Solvers, see Graphs &amp;amp; Solvers Concepts.
Prerequisites Python API Installation Python Virtual Environment PyPI Git Data File Script Detail Constants Graph Creation Shortest Path Single Source to Single Destination Single Source to Many Destinations Many Sources to Many Destinations Download &amp;amp; Run Prerequisites The prerequisites for running the shortest path solve graph example are listed below:</description></item><item><title>Shortest Path with Turn Penalties &amp; Restrictions</title><link>/7.2/guides/solve_graph_dc_shortest_path_turn/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>/7.2/guides/solve_graph_dc_shortest_path_turn/</guid><description>The following is a complete example, using the Python API, of solving a graph created with a Washington, D.C. HERE dataset for a shortest path problem with turn penalties via the /solve/graph endpoint. For more information on Graphs &amp;amp; Solvers, see Graphs &amp;amp; Solvers Concepts. For more information on turn penalties and restrictions, see Using Turn-based Weights &amp;amp; Restrictions.
Prerequisites Python API Installation Data File Script Detail Constants Table Setup Graph Creation Shortest Path Download &amp;amp; Run Prerequisites The prerequisites for running this solve graph example are listed below:</description></item></channel></rss>