The sfnetwork class | Structure | Directionality | Directed networks | Undirected networks | Mixed networks | Geometries | Extract geometries | Replace geometries | Drop geometries | Bounding box | Coordinate reference system | Coordinate precision | Attribute-geometry relations | Creating sfnetwork objects | From node and edge tables | From spatial lines | From spatial points | From other network representations | From files | From OpenStreetMap data | Random networks | Validating sfnetwork objects

Spatial filters | Using st_filter | Using spatial node and edge query functions | Clipping | Spatial joins | Using st_join | Join points to their nearest node | Blending points into a network | Joining two networks

The basics | Choosing a routing backend | Specifying origins and destinations | Specifying edge weights | Applications | K shortest paths | Closest facility analysis | Traveling salesman problem | Isodistance polygons | Custom routing | Dual-weighted routing

Rationale | Representing spatial networks | Analyzing spatial networks | Network analysis with tidygraph | Measures | Community detection | Morphers | Spatial analysis with sf | Coordinate reference systems | Spatial predicates | Spatial joins and filters | Geometric unary operations | Spatial network specific additions | Relating networks and spatial simple features | Spatial measures | Spatial clustering | Spatial morphers | Utilities | Non-tidyverse workflows | Visualizing spatial networks | Learning more

The basics | Simplify the network | Subdivide edges | Smooth pseudo nodes | Require equal attributes | Summarize attribute values | Simplify intersections | Merge nodes at equal locations | Overview | Non-tidyverse workflow