101 lines
7.7 KiB
HTML
101 lines
7.7 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<title>OR-Tools</title>
|
|
<meta http-equiv="Content-Type" content="text/html;"/>
|
|
<meta charset="utf-8"/>
|
|
<!--<link rel='stylesheet' type='text/css' href="https://fonts.googleapis.com/css?family=Ubuntu:400,700,400italic"/>-->
|
|
<link rel="stylesheet" type="text/css" href="ortools.css" title="default" media="screen,print" />
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
</head>
|
|
<body>
|
|
<div id="banner-container">
|
|
<div id="banner">
|
|
<span id="sfml">OR-Tools 7.2</span>
|
|
</div>
|
|
</div>
|
|
<link rel="icon" href="https://developers.google.com/optimization/images/orLogo.png">
|
|
<div id="content">
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<li><a href="index.html"><span>Main Page</span></a></li>
|
|
<li><a href="pages.html"><span>Related Pages</span></a></li>
|
|
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
|
|
<li><a href="annotated.html"><span>Classes</span></a></li>
|
|
<li class="current"><a href="files.html"><span>Files</span></a></li>
|
|
</ul>
|
|
</div>
|
|
<div id="navrow2" class="tabs2">
|
|
<ul class="tablist">
|
|
<li><a href="files.html"><span>File List</span></a></li>
|
|
<li><a href="globals.html"><span>File Members</span></a></li>
|
|
</ul>
|
|
</div>
|
|
<div id="nav-path" class="navpath">
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_725f3a5915051842f84e3ea508be2a62.html">graph</a></li> </ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="summary">
|
|
<a href="#namespaces">Namespaces</a> |
|
|
<a href="#func-members">Functions</a> </div>
|
|
<div class="headertitle">
|
|
<div class="title">shortestpaths.h File Reference</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<div class="textblock"><code>#include <functional></code><br />
|
|
<code>#include <memory></code><br />
|
|
<code>#include <string></code><br />
|
|
<code>#include <vector></code><br />
|
|
<code>#include "ortools/base/integral_types.h"</code><br />
|
|
<code>#include "ortools/base/macros.h"</code><br />
|
|
</div><div class="textblock"><div class="dynheader">
|
|
Include dependency graph for shortestpaths.h:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><img src="shortestpaths_8h__incl.png" border="0" usemap="#shortestpaths_8h" alt=""/></div>
|
|
<map name="shortestpaths_8h" id="shortestpaths_8h">
|
|
<area shape="rect" title=" " alt="" coords="211,5,323,31"/>
|
|
<area shape="rect" title=" " alt="" coords="5,85,84,111"/>
|
|
<area shape="rect" title=" " alt="" coords="107,85,177,111"/>
|
|
<area shape="rect" title=" " alt="" coords="200,85,254,111"/>
|
|
<area shape="rect" title=" " alt="" coords="278,85,336,111"/>
|
|
<area shape="rect" title=" " alt="" coords="361,79,502,117"/>
|
|
<area shape="rect" title=" " alt="" coords="526,85,678,111"/>
|
|
</map>
|
|
</div>
|
|
</div>
|
|
<p><a href="shortestpaths_8h_source.html">Go to the source code of this file.</a></p>
|
|
<table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
|
|
Namespaces</h2></td></tr>
|
|
<tr class="memitem:namespaceoperations__research"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research.html">operations_research</a></td></tr>
|
|
<tr class="memdesc:namespaceoperations__research"><td class="mdescLeft"> </td><td class="mdescRight">Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem:a53e6a83fcbd689abf5b3078b0236f9f1"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research.html#a53e6a83fcbd689abf5b3078b0236f9f1">operations_research::DijkstraShortestPath</a> (int node_count, int start_node, int end_node, std::function< int64(int, int)> graph, int64 disconnected_distance, std::vector< int > *nodes)</td></tr>
|
|
<tr class="memdesc:a53e6a83fcbd689abf5b3078b0236f9f1"><td class="mdescLeft"> </td><td class="mdescRight">Dijsktra Shortest path with callback based description of the graph. <a href="namespaceoperations__research.html#a53e6a83fcbd689abf5b3078b0236f9f1">More...</a><br /></td></tr>
|
|
<tr class="separator:a53e6a83fcbd689abf5b3078b0236f9f1"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ad56bae19a2298c3163af96ca7f8b89b1"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research.html#ad56bae19a2298c3163af96ca7f8b89b1">operations_research::StableDijkstraShortestPath</a> (int node_count, int start_node, int end_node, std::function< int64(int, int)> graph, int64 disconnected_distance, std::vector< int > *nodes)</td></tr>
|
|
<tr class="memdesc:ad56bae19a2298c3163af96ca7f8b89b1"><td class="mdescLeft"> </td><td class="mdescRight">Stable version of the Dijsktra Shortest path with callback based description of the graph. <a href="namespaceoperations__research.html#ad56bae19a2298c3163af96ca7f8b89b1">More...</a><br /></td></tr>
|
|
<tr class="separator:ad56bae19a2298c3163af96ca7f8b89b1"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ad5bfec6ea714171fbff2d8b791d0d286"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research.html#ad5bfec6ea714171fbff2d8b791d0d286">operations_research::BellmanFordShortestPath</a> (int node_count, int start_node, int end_node, std::function< int64(int, int)> graph, int64 disconnected_distance, std::vector< int > *nodes)</td></tr>
|
|
<tr class="memdesc:ad5bfec6ea714171fbff2d8b791d0d286"><td class="mdescLeft"> </td><td class="mdescRight">Bellman-Ford Shortest path with callback-based description of the graph. <a href="namespaceoperations__research.html#ad5bfec6ea714171fbff2d8b791d0d286">More...</a><br /></td></tr>
|
|
<tr class="separator:ad5bfec6ea714171fbff2d8b791d0d286"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:acff272be25bcf9641218c05c59ec1a4e"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research.html#acff272be25bcf9641218c05c59ec1a4e">operations_research::AStarShortestPath</a> (int node_count, int start_node, int end_node, std::function< int64(int, int)> graph, std::function< int64(int)> heuristic, int64 disconnected_distance, std::vector< int > *nodes)</td></tr>
|
|
<tr class="memdesc:acff272be25bcf9641218c05c59ec1a4e"><td class="mdescLeft"> </td><td class="mdescRight">A* Shortest path with function based description of the graph. <a href="namespaceoperations__research.html#acff272be25bcf9641218c05c59ec1a4e">More...</a><br /></td></tr>
|
|
<tr class="separator:acff272be25bcf9641218c05c59ec1a4e"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table>
|
|
</div><!-- contents -->
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|