> ## 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#afe886e92a11134747a2cc2e3d563cf1f" 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">
            <div id="pub-static-attribs" />

            Static Public Attributes
          </h2>
        </td>
      </tr>

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

      <tr className="memdesc:a02e1b5a131ed24debe9f6e61a61099f4">
        <td className="mdescLeft"> </td>
        <td className="mdescRight">Matches <a className="el" href="/content/api/cs/classkinetica_1_1MatchGraphRequest#a1e1346b2ad1acb151816700717133e6e" 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#a2730dbffabb74bf02cf046f6b0be240b">NUM\_SEGMENTS</a>) for each sample point to create the best route. <br /></td>
      </tr>

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

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

      <tr className="memdesc:a66289fcde8feb964691040137f89baf7">
        <td className="mdescLeft"> </td>
        <td className="mdescRight">Matches <a className="el" href="/content/api/cs/classkinetica_1_1MatchGraphRequest#a1e1346b2ad1acb151816700717133e6e" 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:a66289fcde8feb964691040137f89baf7">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

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

      <tr className="memdesc:a06221287551ce2aea81e17e2e854e039">
        <td className="mdescLeft"> </td>
        <td className="mdescRight">Matches <a className="el" href="/content/api/cs/classkinetica_1_1MatchGraphRequest#a1e1346b2ad1acb151816700717133e6e" 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:a06221287551ce2aea81e17e2e854e039">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

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

      <tr className="memdesc:a39ca762fca46aace19440ffde0f69187">
        <td className="mdescLeft"> </td>
        <td className="mdescRight">Matches <a className="el" href="/content/api/cs/classkinetica_1_1MatchGraphRequest#a1e1346b2ad1acb151816700717133e6e" 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:a39ca762fca46aace19440ffde0f69187">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

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

      <tr className="memdesc:ac3ba8547105b414f055d9f6927d5ebdd">
        <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:ac3ba8547105b414f055d9f6927d5ebdd">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

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

      <tr className="memdesc:aca52038e08c3c0bd3ab5360a989ac1f4">
        <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:aca52038e08c3c0bd3ab5360a989ac1f4">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

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

      <tr className="memdesc:aa5f00bc0c77b928db22df1e5ea467d72">
        <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:aa5f00bc0c77b928db22df1e5ea467d72">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

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

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

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

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

      <tr className="memdesc:a5ccdb638cbab8ceed12f2b8aba2142e0">
        <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:a5ccdb638cbab8ceed12f2b8aba2142e0">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>

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

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

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

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

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

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

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

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

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

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

      <tr className="memdesc:af89ec375fc82a6b7c56f3b661e8b0cd2">
        <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:af89ec375fc82a6b7c56f3b661e8b0cd2">
        <td className="memSeparator" colSpan="2"> </td>
      </tr>
    </table>

    <div id="details" />

    <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#afe886e92a11134747a2cc2e3d563cf1f" 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="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs#L30">30</a> of file <a className="el" href="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs">MatchGraph.cs</a>.</p>
    </div>

    <h2 className="groupheader">Member Data Documentation</h2>

    <div id="a02e1b5a131ed24debe9f6e61a61099f4" />

    <h2 className="memtitle"><span className="permalink"><a href="#a02e1b5a131ed24debe9f6e61a61099f4">◆ </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#a1e1346b2ad1acb151816700717133e6e" 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#a2730dbffabb74bf02cf046f6b0be240b">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#a96add3c83fc5dfff511bfd8413898bb1">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#a2730dbffabb74bf02cf046f6b0be240b">NUM\_SEGMENTS</a> and <a className="el" href="/content/api/cs/structkinetica_1_1MatchGraphRequest_1_1Options#a96add3c83fc5dfff511bfd8413898bb1">CHAIN\_WIDTH</a>. </p>
        <p className="definition">Definition at line <a className="el" href="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs#L48">48</a> of file <a className="el" href="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <div id="a39ca762fca46aace19440ffde0f69187" />

    <h2 className="memtitle"><span className="permalink"><a href="#a39ca762fca46aace19440ffde0f69187">◆ </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#a1e1346b2ad1acb151816700717133e6e" 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="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs#L69">69</a> of file <a className="el" href="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <div id="aca52038e08c3c0bd3ab5360a989ac1f4" />

    <h2 className="memtitle"><span className="permalink"><a href="#aca52038e08c3c0bd3ab5360a989ac1f4">◆ </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="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs#L78">78</a> of file <a className="el" href="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <div id="a5ccdb638cbab8ceed12f2b8aba2142e0" />

    <h2 className="memtitle"><span className="permalink"><a href="#a5ccdb638cbab8ceed12f2b8aba2142e0">◆ </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="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs#L90">90</a> of file <a className="el" href="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <div id="addd035946292779554f2765ac4fe877f" />

    <h2 className="memtitle"><span className="permalink"><a href="#addd035946292779554f2765ac4fe877f">◆ </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="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs#L96">96</a> of file <a className="el" href="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <div id="a9b5959d73c5131c3678036f649954648" />

    <h2 className="memtitle"><span className="permalink"><a href="#a9b5959d73c5131c3678036f649954648">◆ </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="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs#L100">100</a> of file <a className="el" href="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <div id="ac3ba8547105b414f055d9f6927d5ebdd" />

    <h2 className="memtitle"><span className="permalink"><a href="#ac3ba8547105b414f055d9f6927d5ebdd">◆ </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="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs#L74">74</a> of file <a className="el" href="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <div id="a66289fcde8feb964691040137f89baf7" />

    <h2 className="memtitle"><span className="permalink"><a href="#a66289fcde8feb964691040137f89baf7">◆ </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#a1e1346b2ad1acb151816700717133e6e" 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="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs#L53">53</a> of file <a className="el" href="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <div id="a4053f3069ad62a39d6c412cba300e1aa" />

    <h2 className="memtitle"><span className="permalink"><a href="#a4053f3069ad62a39d6c412cba300e1aa">◆ </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="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs#L93">93</a> of file <a className="el" href="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <div id="a8020906de79a524d4bb66f2b3599c615" />

    <h2 className="memtitle"><span className="permalink"><a href="#a8020906de79a524d4bb66f2b3599c615">◆ </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="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs#L86">86</a> of file <a className="el" href="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <div id="af89ec375fc82a6b7c56f3b661e8b0cd2" />

    <h2 className="memtitle"><span className="permalink"><a href="#af89ec375fc82a6b7c56f3b661e8b0cd2">◆ </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="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs#L104">104</a> of file <a className="el" href="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <div id="aa5f00bc0c77b928db22df1e5ea467d72" />

    <h2 className="memtitle"><span className="permalink"><a href="#aa5f00bc0c77b928db22df1e5ea467d72">◆ </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="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs#L82">82</a> of file <a className="el" href="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <div id="a06221287551ce2aea81e17e2e854e039" />

    <h2 className="memtitle"><span className="permalink"><a href="#a06221287551ce2aea81e17e2e854e039">◆ </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#a1e1346b2ad1acb151816700717133e6e" 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#aae728aada19591c9abdfa45a811d91ae">PARTIAL\_LOADING</a> and <a className="el" href="/content/api/cs/structkinetica_1_1MatchGraphRequest_1_1Options#aca16dcc376d7c04ef167d018f629f1de">MAX\_COMBINATIONS</a>. </p>
        <p className="definition">Definition at line <a className="el" href="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs#L64">64</a> of file <a className="el" href="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs">MatchGraph.cs</a>.</p>
      </div>
    </div>

    <hr />

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

    <ul>
      <li>Kinetica/Protocol/<a className="el" href="https://github.com/kineticadb/kinetica-api-cs/blob/master/Kinetica/Protocol/MatchGraph.cs">MatchGraph.cs</a></li>
    </ul>
  </div>
</div>


This documentation is built and hosted on [Mintlify](https://mintlify.com), a developer documentation platform.