> ## Documentation Index
> Fetch the complete documentation index at: https://docs.kinetica.com/llms.txt
> Use this file to discover all available pages before exploring further.

# kinetica.MatchGraphRequest.SolveMethod

> kinetica.MatchGraphRequest.SolveMethod — Kinetica C# API

<div className="kinetica-doxygen">
  <div className="contents">
    <p>A set of string constants for the parameter <a className="el" href="/content/api/cs/classkinetica_1_1MatchGraphRequest#a07e7af7a97566ef67b252c427cafac58" title="The type of solver to use for graph matching.">MatchGraphRequest.solve\_method</a>. <a href="#details">More...</a></p>

    <table className="memberdecls">
      <tr className="heading">
        <td colSpan="2">
          <h2 className="groupheader"> Static Public Attributes</h2>
        </td>
      </tr>

      <tr className="memitem:aeb6bf16320ac0eb35f50a1bac86fb801" id="r_aeb6bf16320ac0eb35f50a1bac86fb801">
        <td className="memItemLeft" align="right" valign="top">const string </td>
        <td className="memItemRight" valign="bottom"><a className="el" href="#aeb6bf16320ac0eb35f50a1bac86fb801">MARKOV\_CHAIN</a> = "markov\_chain"</td>
      </tr>

      <tr className="memdesc:aeb6bf16320ac0eb35f50a1bac86fb801">
        <td className="mdescLeft"> </td>
        <td className="mdescRight">Matches <a className="el" href="/content/api/cs/classkinetica_1_1MatchGraphRequest#ab90d2148c53bd38d8a6bdcbc5af37b0d" title="Sample points used to match to an underlying geospatial graph.">MatchGraphRequest.sample\_points</a> 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 (<a className="el" href="/content/api/cs/structkinetica_1_1MatchGraphRequest_1_1Options#a23a25a91e2773243c4da6d840137c0ad">NUM\_SEGMENTS</a>) for each sample point to create the best route. <br /></td>
      </tr>

      <tr className="separator:aeb6bf16320ac0eb35f50a1bac86fb801">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

      <tr className="memitem:ae9d61eec1268e0842c371fe9ca2a800b" id="r_ae9d61eec1268e0842c371fe9ca2a800b">
        <td className="memItemLeft" align="right" valign="top">const string </td>
        <td className="memItemRight" valign="bottom"><a className="el" href="#ae9d61eec1268e0842c371fe9ca2a800b">MATCH\_OD\_PAIRS</a> = "match\_od\_pairs"</td>
      </tr>

      <tr className="memdesc:ae9d61eec1268e0842c371fe9ca2a800b">
        <td className="mdescLeft"> </td>
        <td className="mdescRight">Matches <a className="el" href="/content/api/cs/classkinetica_1_1MatchGraphRequest#ab90d2148c53bd38d8a6bdcbc5af37b0d" title="Sample points used to match to an underlying geospatial graph.">MatchGraphRequest.sample\_points</a> to find the most probable path between origin and destination pairs with cost constraints. <br /></td>
      </tr>

      <tr className="separator:ae9d61eec1268e0842c371fe9ca2a800b">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

      <tr className="memitem:a0e5edc3f07a556d6c33ad24c18e53047" id="r_a0e5edc3f07a556d6c33ad24c18e53047">
        <td className="memItemLeft" align="right" valign="top">const string </td>
        <td className="memItemRight" valign="bottom"><a className="el" href="#a0e5edc3f07a556d6c33ad24c18e53047">MATCH\_SUPPLY\_DEMAND</a> = "match\_supply\_demand"</td>
      </tr>

      <tr className="memdesc:a0e5edc3f07a556d6c33ad24c18e53047">
        <td className="mdescLeft"> </td>
        <td className="mdescRight">Matches <a className="el" href="/content/api/cs/classkinetica_1_1MatchGraphRequest#ab90d2148c53bd38d8a6bdcbc5af37b0d" title="Sample points used to match to an underlying geospatial graph.">MatchGraphRequest.sample\_points</a> to optimize scheduling multiple supplies (trucks) with varying sizes to varying demand sites with varying capacities per depot. <br /></td>
      </tr>

      <tr className="separator:a0e5edc3f07a556d6c33ad24c18e53047">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

      <tr className="memitem:ae2c82e5637a2138b54d9e73b4c4da292" id="r_ae2c82e5637a2138b54d9e73b4c4da292">
        <td className="memItemLeft" align="right" valign="top">const string </td>
        <td className="memItemRight" valign="bottom"><a className="el" href="#ae2c82e5637a2138b54d9e73b4c4da292">MATCH\_BATCH\_SOLVES</a> = "match\_batch\_solves"</td>
      </tr>

      <tr className="memdesc:ae2c82e5637a2138b54d9e73b4c4da292">
        <td className="mdescLeft"> </td>
        <td className="mdescRight">Matches <a className="el" href="/content/api/cs/classkinetica_1_1MatchGraphRequest#ab90d2148c53bd38d8a6bdcbc5af37b0d" title="Sample points used to match to an underlying geospatial graph.">MatchGraphRequest.sample\_points</a> source and destination pairs for the shortest path solves in batch mode. <br /></td>
      </tr>

      <tr className="separator:ae2c82e5637a2138b54d9e73b4c4da292">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

      <tr className="memitem:a99bebdcf5f8b8e5dbb37bf1fb3f2d057" id="r_a99bebdcf5f8b8e5dbb37bf1fb3f2d057">
        <td className="memItemLeft" align="right" valign="top">const string </td>
        <td className="memItemRight" valign="bottom"><a className="el" href="#a99bebdcf5f8b8e5dbb37bf1fb3f2d057">MATCH\_LOOPS</a> = "match\_loops"</td>
      </tr>

      <tr className="memdesc:a99bebdcf5f8b8e5dbb37bf1fb3f2d057">
        <td className="mdescLeft"> </td>
        <td className="mdescRight">Matches closed loops (Eulerian paths) originating and ending at each graph node within min and max hops (levels). <br /></td>
      </tr>

      <tr className="separator:a99bebdcf5f8b8e5dbb37bf1fb3f2d057">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

      <tr className="memitem:a6996acc9db58aa857d65042c7fe38f31" id="r_a6996acc9db58aa857d65042c7fe38f31">
        <td className="memItemLeft" align="right" valign="top">const string </td>
        <td className="memItemRight" valign="bottom"><a className="el" href="#a6996acc9db58aa857d65042c7fe38f31">MATCH\_CHARGING\_STATIONS</a> = "match\_charging\_stations"</td>
      </tr>

      <tr className="memdesc:a6996acc9db58aa857d65042c7fe38f31">
        <td className="mdescLeft"> </td>
        <td className="mdescRight">Matches an optimal path across a number of ev-charging stations between source and target locations. <br /></td>
      </tr>

      <tr className="separator:a6996acc9db58aa857d65042c7fe38f31">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

      <tr className="memitem:a46fd57147d30081e919eb26eb1b1e8e7" id="r_a46fd57147d30081e919eb26eb1b1e8e7">
        <td className="memItemLeft" align="right" valign="top">const string </td>
        <td className="memItemRight" valign="bottom"><a className="el" href="#a46fd57147d30081e919eb26eb1b1e8e7">MATCH\_SIMILARITY</a> = "match\_similarity"</td>
      </tr>

      <tr className="memdesc:a46fd57147d30081e919eb26eb1b1e8e7">
        <td className="mdescLeft"> </td>
        <td className="mdescRight">Matches the intersection set(s) by computing the Jaccard similarity score between node pairs. <br /></td>
      </tr>

      <tr className="separator:a46fd57147d30081e919eb26eb1b1e8e7">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

      <tr className="memitem:a4d48a167f6e1806fb5f5c597733cfe74" id="r_a4d48a167f6e1806fb5f5c597733cfe74">
        <td className="memItemLeft" align="right" valign="top">const string </td>
        <td className="memItemRight" valign="bottom"><a className="el" href="#a4d48a167f6e1806fb5f5c597733cfe74">MATCH\_PICKUP\_DROPOFF</a> = "match\_pickup\_dropoff"</td>
      </tr>

      <tr className="memdesc:a4d48a167f6e1806fb5f5c597733cfe74">
        <td className="mdescLeft"> </td>
        <td className="mdescRight">Matches the pickups and dropoffs by optimizing the total trip costs. <br /></td>
      </tr>

      <tr className="separator:a4d48a167f6e1806fb5f5c597733cfe74">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

      <tr className="memitem:a2db05687afa6301dd46cde7b69046e20" id="r_a2db05687afa6301dd46cde7b69046e20">
        <td className="memItemLeft" align="right" valign="top">const string </td>
        <td className="memItemRight" valign="bottom"><a className="el" href="#a2db05687afa6301dd46cde7b69046e20">MATCH\_CLUSTERS</a> = "match\_clusters"</td>
      </tr>

      <tr className="memdesc:a2db05687afa6301dd46cde7b69046e20">
        <td className="mdescLeft"> </td>
        <td className="mdescRight">Matches the graph nodes with a cluster index using Louvain clustering algorithm. <br /></td>
      </tr>

      <tr className="separator:a2db05687afa6301dd46cde7b69046e20">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

      <tr className="memitem:a9a48e3522b24832ec1294629fbd4fbbc" id="r_a9a48e3522b24832ec1294629fbd4fbbc">
        <td className="memItemLeft" align="right" valign="top">const string </td>
        <td className="memItemRight" valign="bottom"><a className="el" href="#a9a48e3522b24832ec1294629fbd4fbbc">MATCH\_PATTERN</a> = "match\_pattern"</td>
      </tr>

      <tr className="memdesc:a9a48e3522b24832ec1294629fbd4fbbc">
        <td className="mdescLeft"> </td>
        <td className="mdescRight">Matches a pattern in the graph. <br /></td>
      </tr>

      <tr className="separator:a9a48e3522b24832ec1294629fbd4fbbc">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

      <tr className="memitem:af2b0ffa9a44dc23c3aae091f4c721855" id="r_af2b0ffa9a44dc23c3aae091f4c721855">
        <td className="memItemLeft" align="right" valign="top">const string </td>
        <td className="memItemRight" valign="bottom"><a className="el" href="#af2b0ffa9a44dc23c3aae091f4c721855">MATCH\_EMBEDDING</a> = "match\_embedding"</td>
      </tr>

      <tr className="memdesc:af2b0ffa9a44dc23c3aae091f4c721855">
        <td className="mdescLeft"> </td>
        <td className="mdescRight">Creates vector node embeddings. <br /></td>
      </tr>

      <tr className="separator:af2b0ffa9a44dc23c3aae091f4c721855">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

      <tr className="memitem:a66ee7f9d67b1d5962db97837dd23b4b4" id="r_a66ee7f9d67b1d5962db97837dd23b4b4">
        <td className="memItemLeft" align="right" valign="top">const string </td>
        <td className="memItemRight" valign="bottom"><a className="el" href="#a66ee7f9d67b1d5962db97837dd23b4b4">MATCH\_ISOCHRONE</a> = "match\_isochrone"</td>
      </tr>

      <tr className="memdesc:a66ee7f9d67b1d5962db97837dd23b4b4">
        <td className="mdescLeft"> </td>
        <td className="mdescRight">Solves for isochrones for a set of input sources. <br /></td>
      </tr>

      <tr className="separator:a66ee7f9d67b1d5962db97837dd23b4b4">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

      <tr className="memitem:a350c4e994638b1d536dc42d8f4f8b1b3" id="r_a350c4e994638b1d536dc42d8f4f8b1b3">
        <td className="memItemLeft" align="right" valign="top">const string </td>
        <td className="memItemRight" valign="bottom"><a className="el" href="#a350c4e994638b1d536dc42d8f4f8b1b3">MATCH\_ROUTE\_DETOUR</a> = "match\_route\_detour"</td>
      </tr>

      <tr className="memdesc:a350c4e994638b1d536dc42d8f4f8b1b3">
        <td className="mdescLeft"> </td>
        <td className="mdescRight">Computes detour costs for nearby stations at a mark point along each source-target route. <br /></td>
      </tr>

      <tr className="separator:a350c4e994638b1d536dc42d8f4f8b1b3">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>
    </table>

    <h2 className="groupheader">Detailed Description</h2>

    <div className="textblock">
      <p>A set of string constants for the parameter <a className="el" href="/content/api/cs/classkinetica_1_1MatchGraphRequest#a07e7af7a97566ef67b252c427cafac58" title="The type of solver to use for graph matching.">MatchGraphRequest.solve\_method</a>. </p>
      <p>The type of solver to use for graph matching.</p>
      <p className="definition">Definition at line <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source#l00030">30</a> of file <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source">MatchGraph.cs</a>.</p>
    </div>

    <h2 className="groupheader">Member Data Documentation</h2>
    <h2 className="memtitle"><span className="permalink"><a href="#aeb6bf16320ac0eb35f50a1bac86fb801">◆ </a></span>MARKOV\_CHAIN</h2>

    <div className="memitem">
      <div className="memproto">
        <table className="mlabels">
          <tr>
            <td className="mlabels-left">
              <table className="memname">
                <tr>
                  <td className="memname">const string kinetica.MatchGraphRequest.SolveMethod.MARKOV\_CHAIN = "markov\_chain"</td>
                </tr>
              </table>
            </td>

            <td className="mlabels-right"> <span className="mlabels"><span className="mlabel static">static</span></span> </td>
          </tr>
        </table>
      </div>

      <div className="memdoc">
        <p>Matches <a className="el" href="/content/api/cs/classkinetica_1_1MatchGraphRequest#ab90d2148c53bd38d8a6bdcbc5af37b0d" title="Sample points used to match to an underlying geospatial graph.">MatchGraphRequest.sample\_points</a> 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 (<a className="el" href="/content/api/cs/structkinetica_1_1MatchGraphRequest_1_1Options#a23a25a91e2773243c4da6d840137c0ad">NUM\_SEGMENTS</a>) for each sample point to create the best route. </p>
        <p>The route is secured one point at a time while looking ahead <a className="el" href="/content/api/cs/structkinetica_1_1MatchGraphRequest_1_1Options#ab9ea5b5eecc60fd9ea133c5cbddd4f9f">CHAIN\_WIDTH</a> 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: <a className="el" href="/content/api/cs/structkinetica_1_1MatchGraphRequest_1_1Options#a23a25a91e2773243c4da6d840137c0ad">NUM\_SEGMENTS</a> and <a className="el" href="/content/api/cs/structkinetica_1_1MatchGraphRequest_1_1Options#ab9ea5b5eecc60fd9ea133c5cbddd4f9f">CHAIN\_WIDTH</a>. </p>
        <p className="definition">Definition at line <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source#l00048">48</a> of file <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <h2 className="memtitle"><span className="permalink"><a href="#ae2c82e5637a2138b54d9e73b4c4da292">◆ </a></span>MATCH\_BATCH\_SOLVES</h2>

    <div className="memitem">
      <div className="memproto">
        <table className="mlabels">
          <tr>
            <td className="mlabels-left">
              <table className="memname">
                <tr>
                  <td className="memname">const string kinetica.MatchGraphRequest.SolveMethod.MATCH\_BATCH\_SOLVES = "match\_batch\_solves"</td>
                </tr>
              </table>
            </td>

            <td className="mlabels-right"> <span className="mlabels"><span className="mlabel static">static</span></span> </td>
          </tr>
        </table>
      </div>

      <div className="memdoc">
        <p>Matches <a className="el" href="/content/api/cs/classkinetica_1_1MatchGraphRequest#ab90d2148c53bd38d8a6bdcbc5af37b0d" title="Sample points used to match to an underlying geospatial graph.">MatchGraphRequest.sample\_points</a> source and destination pairs for the shortest path solves in batch mode. </p>
        <p className="definition">Definition at line <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source#l00069">69</a> of file <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <h2 className="memtitle"><span className="permalink"><a href="#a6996acc9db58aa857d65042c7fe38f31">◆ </a></span>MATCH\_CHARGING\_STATIONS</h2>

    <div className="memitem">
      <div className="memproto">
        <table className="mlabels">
          <tr>
            <td className="mlabels-left">
              <table className="memname">
                <tr>
                  <td className="memname">const string kinetica.MatchGraphRequest.SolveMethod.MATCH\_CHARGING\_STATIONS = "match\_charging\_stations"</td>
                </tr>
              </table>
            </td>

            <td className="mlabels-right"> <span className="mlabels"><span className="mlabel static">static</span></span> </td>
          </tr>
        </table>
      </div>

      <div className="memdoc">
        <p>Matches an optimal path across a number of ev-charging stations between source and target locations. </p>
        <p className="definition">Definition at line <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source#l00078">78</a> of file <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <h2 className="memtitle"><span className="permalink"><a href="#a2db05687afa6301dd46cde7b69046e20">◆ </a></span>MATCH\_CLUSTERS</h2>

    <div className="memitem">
      <div className="memproto">
        <table className="mlabels">
          <tr>
            <td className="mlabels-left">
              <table className="memname">
                <tr>
                  <td className="memname">const string kinetica.MatchGraphRequest.SolveMethod.MATCH\_CLUSTERS = "match\_clusters"</td>
                </tr>
              </table>
            </td>

            <td className="mlabels-right"> <span className="mlabels"><span className="mlabel static">static</span></span> </td>
          </tr>
        </table>
      </div>

      <div className="memdoc">
        <p>Matches the graph nodes with a cluster index using Louvain clustering algorithm. </p>
        <p className="definition">Definition at line <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source#l00090">90</a> of file <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <h2 className="memtitle"><span className="permalink"><a href="#af2b0ffa9a44dc23c3aae091f4c721855">◆ </a></span>MATCH\_EMBEDDING</h2>

    <div className="memitem">
      <div className="memproto">
        <table className="mlabels">
          <tr>
            <td className="mlabels-left">
              <table className="memname">
                <tr>
                  <td className="memname">const string kinetica.MatchGraphRequest.SolveMethod.MATCH\_EMBEDDING = "match\_embedding"</td>
                </tr>
              </table>
            </td>

            <td className="mlabels-right"> <span className="mlabels"><span className="mlabel static">static</span></span> </td>
          </tr>
        </table>
      </div>

      <div className="memdoc">
        <p>Creates vector node embeddings. </p>
        <p className="definition">Definition at line <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source#l00096">96</a> of file <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <h2 className="memtitle"><span className="permalink"><a href="#a66ee7f9d67b1d5962db97837dd23b4b4">◆ </a></span>MATCH\_ISOCHRONE</h2>

    <div className="memitem">
      <div className="memproto">
        <table className="mlabels">
          <tr>
            <td className="mlabels-left">
              <table className="memname">
                <tr>
                  <td className="memname">const string kinetica.MatchGraphRequest.SolveMethod.MATCH\_ISOCHRONE = "match\_isochrone"</td>
                </tr>
              </table>
            </td>

            <td className="mlabels-right"> <span className="mlabels"><span className="mlabel static">static</span></span> </td>
          </tr>
        </table>
      </div>

      <div className="memdoc">
        <p>Solves for isochrones for a set of input sources. </p>
        <p className="definition">Definition at line <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source#l00100">100</a> of file <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <h2 className="memtitle"><span className="permalink"><a href="#a99bebdcf5f8b8e5dbb37bf1fb3f2d057">◆ </a></span>MATCH\_LOOPS</h2>

    <div className="memitem">
      <div className="memproto">
        <table className="mlabels">
          <tr>
            <td className="mlabels-left">
              <table className="memname">
                <tr>
                  <td className="memname">const string kinetica.MatchGraphRequest.SolveMethod.MATCH\_LOOPS = "match\_loops"</td>
                </tr>
              </table>
            </td>

            <td className="mlabels-right"> <span className="mlabels"><span className="mlabel static">static</span></span> </td>
          </tr>
        </table>
      </div>

      <div className="memdoc">
        <p>Matches closed loops (Eulerian paths) originating and ending at each graph node within min and max hops (levels). </p>
        <p className="definition">Definition at line <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source#l00074">74</a> of file <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <h2 className="memtitle"><span className="permalink"><a href="#ae9d61eec1268e0842c371fe9ca2a800b">◆ </a></span>MATCH\_OD\_PAIRS</h2>

    <div className="memitem">
      <div className="memproto">
        <table className="mlabels">
          <tr>
            <td className="mlabels-left">
              <table className="memname">
                <tr>
                  <td className="memname">const string kinetica.MatchGraphRequest.SolveMethod.MATCH\_OD\_PAIRS = "match\_od\_pairs"</td>
                </tr>
              </table>
            </td>

            <td className="mlabels-right"> <span className="mlabels"><span className="mlabel static">static</span></span> </td>
          </tr>
        </table>
      </div>

      <div className="memdoc">
        <p>Matches <a className="el" href="/content/api/cs/classkinetica_1_1MatchGraphRequest#ab90d2148c53bd38d8a6bdcbc5af37b0d" title="Sample points used to match to an underlying geospatial graph.">MatchGraphRequest.sample\_points</a> to find the most probable path between origin and destination pairs with cost constraints. </p>
        <p className="definition">Definition at line <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source#l00053">53</a> of file <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <h2 className="memtitle"><span className="permalink"><a href="#a9a48e3522b24832ec1294629fbd4fbbc">◆ </a></span>MATCH\_PATTERN</h2>

    <div className="memitem">
      <div className="memproto">
        <table className="mlabels">
          <tr>
            <td className="mlabels-left">
              <table className="memname">
                <tr>
                  <td className="memname">const string kinetica.MatchGraphRequest.SolveMethod.MATCH\_PATTERN = "match\_pattern"</td>
                </tr>
              </table>
            </td>

            <td className="mlabels-right"> <span className="mlabels"><span className="mlabel static">static</span></span> </td>
          </tr>
        </table>
      </div>

      <div className="memdoc">
        <p>Matches a pattern in the graph. </p>
        <p className="definition">Definition at line <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source#l00093">93</a> of file <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <h2 className="memtitle"><span className="permalink"><a href="#a4d48a167f6e1806fb5f5c597733cfe74">◆ </a></span>MATCH\_PICKUP\_DROPOFF</h2>

    <div className="memitem">
      <div className="memproto">
        <table className="mlabels">
          <tr>
            <td className="mlabels-left">
              <table className="memname">
                <tr>
                  <td className="memname">const string kinetica.MatchGraphRequest.SolveMethod.MATCH\_PICKUP\_DROPOFF = "match\_pickup\_dropoff"</td>
                </tr>
              </table>
            </td>

            <td className="mlabels-right"> <span className="mlabels"><span className="mlabel static">static</span></span> </td>
          </tr>
        </table>
      </div>

      <div className="memdoc">
        <p>Matches the pickups and dropoffs by optimizing the total trip costs. </p>
        <p className="definition">Definition at line <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source#l00086">86</a> of file <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <h2 className="memtitle"><span className="permalink"><a href="#a350c4e994638b1d536dc42d8f4f8b1b3">◆ </a></span>MATCH\_ROUTE\_DETOUR</h2>

    <div className="memitem">
      <div className="memproto">
        <table className="mlabels">
          <tr>
            <td className="mlabels-left">
              <table className="memname">
                <tr>
                  <td className="memname">const string kinetica.MatchGraphRequest.SolveMethod.MATCH\_ROUTE\_DETOUR = "match\_route\_detour"</td>
                </tr>
              </table>
            </td>

            <td className="mlabels-right"> <span className="mlabels"><span className="mlabel static">static</span></span> </td>
          </tr>
        </table>
      </div>

      <div className="memdoc">
        <p>Computes detour costs for nearby stations at a mark point along each source-target route. </p>
        <p className="definition">Definition at line <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source#l00104">104</a> of file <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <h2 className="memtitle"><span className="permalink"><a href="#a46fd57147d30081e919eb26eb1b1e8e7">◆ </a></span>MATCH\_SIMILARITY</h2>

    <div className="memitem">
      <div className="memproto">
        <table className="mlabels">
          <tr>
            <td className="mlabels-left">
              <table className="memname">
                <tr>
                  <td className="memname">const string kinetica.MatchGraphRequest.SolveMethod.MATCH\_SIMILARITY = "match\_similarity"</td>
                </tr>
              </table>
            </td>

            <td className="mlabels-right"> <span className="mlabels"><span className="mlabel static">static</span></span> </td>
          </tr>
        </table>
      </div>

      <div className="memdoc">
        <p>Matches the intersection set(s) by computing the Jaccard similarity score between node pairs. </p>
        <p className="definition">Definition at line <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source#l00082">82</a> of file <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <h2 className="memtitle"><span className="permalink"><a href="#a0e5edc3f07a556d6c33ad24c18e53047">◆ </a></span>MATCH\_SUPPLY\_DEMAND</h2>

    <div className="memitem">
      <div className="memproto">
        <table className="mlabels">
          <tr>
            <td className="mlabels-left">
              <table className="memname">
                <tr>
                  <td className="memname">const string kinetica.MatchGraphRequest.SolveMethod.MATCH\_SUPPLY\_DEMAND = "match\_supply\_demand"</td>
                </tr>
              </table>
            </td>

            <td className="mlabels-right"> <span className="mlabels"><span className="mlabel static">static</span></span> </td>
          </tr>
        </table>
      </div>

      <div className="memdoc">
        <p>Matches <a className="el" href="/content/api/cs/classkinetica_1_1MatchGraphRequest#ab90d2148c53bd38d8a6bdcbc5af37b0d" title="Sample points used to match to an underlying geospatial graph.">MatchGraphRequest.sample\_points</a> to optimize scheduling multiple supplies (trucks) with varying sizes to varying demand sites with varying capacities per depot. </p>
        <p>Related options: <a className="el" href="/content/api/cs/structkinetica_1_1MatchGraphRequest_1_1Options#abc314760037ba047cd373a8ef3e80bf7">PARTIAL\_LOADING</a> and <a className="el" href="/content/api/cs/structkinetica_1_1MatchGraphRequest_1_1Options#a1ba09399b82e76d42b198916cda8b012">MAX\_COMBINATIONS</a>. </p>
        <p className="definition">Definition at line <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source#l00064">64</a> of file <a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <hr />

    The documentation for this struct was generated from the following files:

    <ul>
      <li>\_build/public-os\_ubuntu24.04-arch\_amd64-cc\_gcc\_13.3.0/install/Kinetica/Protocol/<a className="el" href="/content/api/cs/__build_2public-os__ubuntu24_804-arch__amd64-cc__gcc__13_83_80_2install_2Kinetica_2Protocol_2MatchGraph_8cs_source">MatchGraph.cs</a></li>
      <li>Kinetica/Protocol/<a className="el" href="/content/api/cs/Kinetica_2Protocol_2MatchGraph_8cs_source">MatchGraph.cs</a></li>
    </ul>
  </div>
</div>