Table des matières¶
pgRouting est une extension de la base de données géospatiale PostGIS/PostgreSQL afin de proposer des fonctionnalités de routage géospatial et d’autres analyses de réseaux.
Ceci est le manuel de pgRouting 2.0.0 (0a53b89 master).
![Creative Commons Attribution-Share Alike 3.0 License](../_images/ccbysa.png)
Le Manuel pgRouting est distribué sous Creative Commons Attribution-Share Alike 3.0 License. N’hésitez pas à utiliser ce manuel comme vous le souhaitez, mais nous demandons que vous mentionnez le crédit au Projet pgRouting et à chaque fois que cela est possible un lien vers http://pgrouting.org. Pour les autres licences utilisées dans pgRouting, voir la page Licence.
Tutoriel¶
- Getting started
- Topologie de routage for an overview of a topology for routing algorithms.
- Analytiques de graphe for an overview of the analysis of a graph.
- Requête personnalisée that is used in the routing algorithms.
- Conseils pour la performance to improve your performance.
- User’s wrapper contributions to colaborate with a wrapper.
- Use’s Recipes contributions to colaborate with a recipe.
- Données d’échantillon that is used in the examples of this manual.
Pour une introduction plus complète sur comment construire une application de routage, lire l’Atelier pgRouting.
Data Types¶
- pgr_costResult[] - A set of records to describe a path result with cost attribute.
- pgr_costResult3[] - A set of records to describe a path result with cost attribute.
- pgr_geomResult - A set of records to describe a path result with geometry attribute.
Functions reference¶
- pgr_createTopology - to create a topology based on the geometry.
- pgr_createVerticesTable - to reconstruct the vertices table based on the source and target information.
- pgr_analyzeGraph - to analyze the edges and vertices of the edge table.
- pgr_analyzeOneway - to analyze directionality of the edges.
- pgr_nodeNetwork -to create nodes to a not noded edge table.
- pgr_apspJohnson- All Pairs Shortest Path, Johnson’s Algorithm
- pgr_apspWarshall - All Pairs Shortest Path, Floyd-Warshall Algorithm
- pgr_astar - Shortest Path A*
- pgr_bdAstar - Bi-directional A* Shortest Path
- pgr_bdDijkstra - Bi-directional Dijkstra Shortest Path
- pgr_dijkstra - Shortest Path Dijkstra
- pgr_kDijkstra - Mutliple destination Shortest Path Dijkstra
- pgr_ksp - K-Shortest Path
- pgr_tsp - Traveling Sales Person
- pgr_trsp - Turn Restriction Shortest Path (TRSP)
- pgr_drivingDistance - Driving Distance
- pgr_alphaShape - Alpha shape computation
- pgr_pointsAsPolygon - Polygon around set of points
- Developers’s Functions
- pgr_getColumnName - to get the name of the column as is stored in the postgres administration tables.
- pgr_getTableName - to retrieve the name of the table as is stored in the postgres administration tables.
- pgr_isColumnIndexed - to check if the column is indexed.
- pgr_isColumnInTable - to check only for the existance of the column.
- pgr_pointToId -to insert/get the id of the inserted point in a vertices table.
- pgr_quote_ident - to quotes the input text to be used as an identifier in an SQL statement string.
- pgr_version - to get pgRouting’s version information.
- pgr_versionless - to compare two version numbers.
- pgr_startPoint - to get the start point of a (multi)linestring.
- pgr_endPoint - to get the end point of a (multi)linestring.