graph - Graph and network analysis and representation

• bfs - Compute breadth first search distances, times, and tree of a graph and extracts valid paths.
• dfs - Perform a depth-first search (DFS) of a graph.
• dijk - Implementation of Dijkstra algorithm.
• dijkadvanced_base - Calculate minimum costs and paths using Dijkstra’s algorithm.
• dijkstra - Implementation of Dijkstra algorithm, allowing for single and multiple sources distance calculation.
• dijkstra_base.
• graphmap - Converts binary map to connected graph and reciprocally.
• graphweight - Convert an unweighted spatial graph into a weighted graph.
• graph2map_base - Converts a spatial unweighted graph into a 2D logical map.
• map2graph_base - Converts a 2D logical map into a weighted graph.
• pathfinder - Find paths in a graph.
• graphdisplay - Raster representation (and display) of a weighted graph.
• ixneighbours - Return the indices of neighbour cells in a matrix.
• scomponents - Compute the strongly connected components of a graph and extracts valid paths.
• triadjacency - Construct the adjacency matrix associated to an order-3 graph.