|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
| org.h2gis.* |
|---|
| org.h2gis.network.graph_creator.GraphCreator<V extends org.javanetworkanalyzer.data.VId,E extends org.javanetworkanalyzer.model.Edge> | ||
|---|---|---|
public static final int |
DIRECTED_EDGE |
1 |
public static final int |
REVERSED_EDGE |
-1 |
public static final int |
UNDIRECTED_EDGE |
0 |
| org.h2gis.network.graph_creator.GraphFunction | ||
|---|---|---|
public static final String |
ARG_ERROR |
"Unrecognized argument: " |
| org.h2gis.network.graph_creator.GraphFunctionParser | ||
|---|---|---|
public static final String |
DIRECTED |
"directed" |
public static final String |
EDGE_ORIENTATION_COLUMN |
"edge_orientation_column" |
public static final String |
ORIENTATION_ERROR |
"Bad orientation format. Enter \'directed - edge_orientation_column\' | \'reversed - edge_orientation_column\' | \'undirected\'." |
public static final String |
POSSIBLE_ORIENTATIONS |
"\'directed - edge_orientation_column\' | \'reversed - edge_orientation_column\' | \'undirected\'" |
public static final String |
REVERSED |
"reversed" |
public static final String |
SEPARATOR |
"-" |
public static final String |
UNDIRECTED |
"undirected" |
| org.h2gis.network.graph_creator.ST_Accessibility | ||
|---|---|---|
public static final String |
REMARKS |
"`ST_Accessibility` calculates, for each vertex in a graph, the closest\ndestination among several possible destinations as well as the distance to this\ndestination. Possible signatures: \n* `ST_Accessibility(\'input_edges\', \'o[ - eo]\', \'ds\')`\n* `ST_Accessibility(\'input_edges\', \'o[ - eo]\', \'dt\')`\n* `ST_Accessibility(\'input_edges\', \'o[ - eo]\', \'w\', \'ds\')`\n* `ST_Accessibility(\'input_edges\', \'o[ - eo]\', \'w\', \'dt\')` \n\nwhere \n* `input_edges` = Edges table produced by `ST_Graph` from table `input`\n* `o` = Global orientation (directed, reversed or undirected)\n* `eo` = Edge orientation (1 = directed, -1 = reversed, 0 = undirected).\n Required if global orientation is directed or reversed.\n* `w` = Name of column containing edge weights as doubles\n* `ds` = Comma-separated Destination string (\'dest1, dest2, ...\')\n* `dt` = Destination table name (must contain column containing integer vertex\n ids)\n" |
| org.h2gis.network.graph_creator.ST_ConnectedComponents | ||
|---|---|---|
protected static final int |
BATCH_SIZE |
100 |
public static final int |
NULL_CONNECTED_COMPONENT_NUMBER |
-1 |
public static final String |
REMARKS |
"`ST_ConnectedComponents` calculates the connected components (for undirected\ngraphs) or strongly connected components (for directed graphs) of a graph. It\nproduces two tables (nodes and edges) containing a node or edge id and a\nconnected component id. Signature: \n* `ST_ConnectedComponents(\'input_edges\', \'o[ - eo]\')`\n\nwhere \n* `input_edges` = Edges table produced by `ST_Graph` from table `input`\n* `o` = Global orientation (directed, reversed or undirected)\n* `eo` = Edge orientation (1 = directed, -1 = reversed, 0 = undirected).\n" |
| org.h2gis.network.graph_creator.ST_GraphAnalysis | ||
|---|---|---|
protected static final int |
BATCH_SIZE |
100 |
public static final String |
REMARKS |
"`ST_GraphAnalysis` calculates closeness and betweenness centrality for nodes,\nas well as betweenness centrality for edges. Possible signatures:\n* `ST_GraphAnalysis(\'input_edges\', \'o[ - eo]\')`\n* `ST_GraphAnalysis(\'input_edges\', \'o[ - eo]\', \'w\')`\n\nwhere\n* `input_edges` = Edges table produced by `ST_Graph` from table `input`\n* `o` = Global orientation (directed, reversed or undirected)\n* `eo` = Edge orientation (1 = directed, -1 = reversed, 0 = undirected).\n Required if global orientation is directed or reversed.\n* `w` = Name of column containing edge weights as doubles\n\n**WARNING**: If ST_GraphAnalysis is called on a graph with more than one\n(strongly) connected component, all closeness centrality scores will be zero.\nSee ST_ConnectedComponents.\n" |
| org.h2gis.network.graph_creator.ST_ShortestPath | ||
|---|---|---|
public static final String |
NO_GEOM_FIELD_ERROR |
"The input table must contain a geometry field." |
public static final String |
REMARKS |
"`ST_ShortestPath` calculates the shortest path(s) between vertices in a graph.\nPossible signatures:\n* `ST_ShortestPath(\'input_edges\', \'o[ - eo]\', s, d)` - One-to-One\n* `ST_ShortestPath(\'input_edges\', \'o[ - eo]\', \'w\', s, d)` - One-to-One weighted\n\nwhere\n* `input_edges` = Edges table produced by `ST_Graph` from table `input`\n* `o` = Global orientation (directed, reversed or undirected)\n* `eo` = Edge orientation (1 = directed, -1 = reversed, 0 = undirected). Required\n if global orientation is directed or reversed.\n* `w` = Name of column containing edge weights as doubles\n* `s` = Source vertex id\n* `d` = Destination vertex id\n" |
| org.h2gis.network.graph_creator.ST_ShortestPathLength | ||
|---|---|---|
public static final int |
DESTINATION_INDEX |
2 |
public static final int |
DISTANCE_INDEX |
3 |
public static final String |
REMARKS |
"`ST_ShortestPathLength` calculates the length(s) of shortest path(s) among\nvertices in a graph. Possible signatures:\n* `ST_ShortestPathLength(\'input_edges\', \'o[ - eo]\', s)` - One-to-All\n* `ST_ShortestPathLength(\'input_edges\', \'o[ - eo]\', \'sdt\')` - Many-to-Many\n* `ST_ShortestPathLength(\'input_edges\', \'o[ - eo]\', s, d)` - One-to-One\n* `ST_ShortestPathLength(\'input_edges\', \'o[ - eo]\', s, \'ds\')` - One-to-Several\n* `ST_ShortestPathLength(\'input_edges\', \'o[ - eo]\', \'w\', s)` - One-to-All weighted\n* `ST_ShortestPathLength(\'input_edges\', \'o[ - eo]\', \'w\', \'sdt\')` - Many-to-Many weighted\n* `ST_ShortestPathLength(\'input_edges\', \'o[ - eo]\', \'w\', s, d)` - One-to-One weighted\n* `ST_ShortestPathLength(\'input_edges\', \'o[ - eo]\', \'w\', s, \'ds\')` - One-to-Several weighted\n\nwhere\n* `input_edges` = Edges table produced by `ST_Graph` from table `input`\n* `o` = Global orientation (directed, reversed or undirected)\n* `eo` = Edge orientation (1 = directed, -1 = reversed, 0 = undirected).\n Required if global orientation is directed or reversed.\n* `w` = Name of column containing edge weights as doubles\n* `s` = Source vertex id\n* `d` = Destination vertex id\n* `sdt` = Source-Destination table name (must contain columns\n SOURCE and DESTINATION containing integer vertex ids)\n* `ds` = Comma-separated Destination string (\'dest1, dest2, ...\')\n" |
public static final int |
SOURCE_INDEX |
1 |
| org.h2gis.network.graph_creator.ST_ShortestPathTree | ||
|---|---|---|
public static final String |
REMARKS |
"Calculates the shortest path tree from a given vertex of a\ngraph using Dijkstra\'s algorithm.\nPossible signatures:\n* `ST_ShortestPathTree(\'INPUT_EDGES\', \'o[ - eo]\', s)`\n* `ST_ShortestPathTree(\'INPUT_EDGES\', \'o[ - eo]\', s, r)`\n* `ST_ShortestPathTree(\'INPUT_EDGES\', \'o[ - eo]\', \'w\', s)`\n* `ST_ShortestPathTree(\'INPUT_EDGES\', \'o[ - eo]\', \'w\', s, r)`\n\nwhere\n* `INPUT_EDGES` = Edges table produced by `ST_Graph` from table `INPUT`\n* `o` = Global orientation (directed, reversed or undirected)\n* `eo` = Edge orientation (1 = directed, -1 = reversed, 0 = undirected).\n Required if global orientation is directed or reversed.\n* `s` = Source vertex id\n* `r` = Radius by which to limit the search (a `DOUBLE`)\n* `w` = Name of column containing edge weights as `DOUBLES`\n" |
|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||