James Gaboardi

[ENH] multi-source dijkstra

1

Implement a multi-source dijkstra algorithm. Following this enhancement, the generation of network voronoi diagrams will be possible. #### pre-reqs: * new functionality for creating nodes along network arcs (something like...

Currently, the degree of vertices/nodes is not explicitly recorded. Explicitly recorded this would assist later when calculating connectivity statistics (see #126). * rings/loops are degree+2 by default. * **Higgins, P....

- [ ] `NetworkLocalAutoNND` * point type A to nearest point type A - [ ] `NetworkGlobalAutoNND` * point type A to all type A points - [ ] `NetworkLocalCrossNND`...

option to snap to nearest *n* locations

2

Currently, `network.snapobservations()` finds one single nearest location along the network to snap a point. As an option / improvement: 1. locate the *n* nearest locations along the network 2. add...

(from pysal/network) add option for approximate point snapping to network #650

2

pysal/pysal#650 ------------------------------ > Current implementation is exact, but crawls when the network gets large. Adding an option to approximation which only uses the kd-tree for the segment nodes might be...

[ENH] add customizations to `PointPatterns.__init__`

1

Currently, `PointPatterns` to takes a `kwarg` (`attributes`) to include all non-spatial data along with the coordinates as a simple `bool`. Moreover, this is a simple list of record attributes with...

Potential functions: * [`network._yield_napts`](https://github.com/pysal/spaghetti/blob/cf7908bae2d6686ec7d72b9e8ae0e92d035bd2a3/spaghetti/network.py#L561-L593) * [`network._evaluate_napts`](https://github.com/pysal/spaghetti/blob/cf7908bae2d6686ec7d72b9e8ae0e92d035bd2a3/spaghetti/network.py#L595-L651) * [`network._newpoint_coords`](https://github.com/pysal/spaghetti/blob/cf7908bae2d6686ec7d72b9e8ae0e92d035bd2a3/spaghetti/network.py#L1190-L1242) * [`network. enum_links_vertex `](https://github.com/pysal/spaghetti/blob/cf7908bae2d6686ec7d72b9e8ae0e92d035bd2a3/spaghetti/network.py#L1345-L1379) * [`network.allneighbordistances`](https://github.com/pysal/spaghetti/blob/cf7908bae2d6686ec7d72b9e8ae0e92d035bd2a3/spaghetti/network.py#L1469-L1744) * [`network.nearestneighbordistances`](https://github.com/pysal/spaghetti/blob/cf7908bae2d6686ec7d72b9e8ae0e92d035bd2a3/spaghetti/network.py#L1746-L1883) * [`network.split_arcs`](https://github.com/pysal/spaghetti/blob/cf7908bae2d6686ec7d72b9e8ae0e92d035bd2a3/spaghetti/network.py#L2112-L2256) * [`util.snap_points_to_links`](https://github.com/pysal/spaghetti/blob/cf7908bae2d6686ec7d72b9e8ae0e92d035bd2a3/spaghetti/util.py#L386-L493) * [`util.get_neighbor_distances`](https://github.com/pysal/spaghetti/blob/cf7908bae2d6686ec7d72b9e8ae0e92d035bd2a3/spaghetti/util.py#L52-L102)

Dijkstra from graph

7

- Currently the dijsktra runs off the network spatial representation (`arcs`, `vertices`) - Include flag for dijkstra to run off graph when available (`edges`, `nodes`)

points counterpart for graph representation

1

`vertex_coords`, `vertices`, and `vertex_list` attributes from network spatial representation have no counterpart for graph representation. - [ ] `node_coords` - [ ] `nodes` - [ ] `node_list`

Currently, `pysal/spaghetti` does not store any attributes from the line `.shp`/`gdf` used to instantiate the a `spaghetti.Network` object. The option to store available attribute data such as direction, road class,...