# H2Network

The following H2Network functions are available:

Function | Description |
---|---|

`ST_Accessibility` |
Calculate, from each vertex, the (distance to the) closest destination |

`ST_ConnectedComponents` |
Calculate the (strongly) connected components of a graph |

`ST_Graph` |
Produce nodes and edges tables from an input table containing `(MULTI)LINESTRINGS` |

`ST_GraphAnalysis` |
Calculate closeness/betweenness centrality of vertices and edges |

`ST_ShortestPath` |
Calculate shortest path(s) between vertices in a graph |

`ST_ShortestPathLength` |
Calculate length(s) of shortest path(s) and distance matrices |

`ST_ShortestPathTree` |
Calculate shortest path tree from a vertex |

Next