Car network construction using iGraph - most have inf from navigation about osm-pg-etl HOT 2 CLOSED

Directed = False simply because I'm not sure we have attributes for links with dual directions. If we set the graph as directed it will follow the direction of the links always, and increase distances where the representation does not have separate links for each lane (very common). In my previous work it was not important to have it directed, but we must investigate here.

Before running, we must test if the network is fully connected. The giant connected component is the one we keep, any small isolated clusters must be removed so that origins/destinations don't "snap" to an isolated link - unreachable.
But, if these smaller components are too many or too big, we might be missing links. We must do this connected component analysis, and add an attribute to the graph table with the id of the connected components, and map them to inspect.

from osm-pg-etl.

This captures the largest component: G.components().giant() For the case of Canada, the largest component has a share of nodes as 96%. By keeping the largest connected graph for routing, the issue is solved.

from osm-pg-etl.