Basic Examples (2)
Find a weak path graph for a simple directed graph:
Take a graph and find all paths between "sodium" and "sbp" assuming the graph was undirected, but preserve the direction of the original edges in the resulting "weak path graph":
Scope (6)
WeakPathGraphs works with undirected graphs:
Same idea but with different options to improve rendering:
Directed graphs:
Multigraphs:
Mixed graphs:
Weighted graphs:
Weighted graphs with EdgeWeight disinherited:
Small graphs:
Options (2)
By default, the weak path graphs created by this function inherit options from the underlying graph. One can use any option available to Graph to override those options or to add other options:
One can also choose to prevent inheritance altogether:
One can also choose to inherit only listed options:
And one can combine inheritance of listed options with additional options:
Instead of a list of options you want inherited, you can specify options you want disinherited:
Applications (3)
One can show the weak paths in the context of the original graph:
Find links between blogs that exist only when the orientation of the graph is disregarded, but show the orientation of the edges on the path:
There are no conventional paths:
There are paths if orientation is disregarded:
Find "backdoor" paths as well as directed paths in a causal network:
Show that deleting all incoming edges to attention disorder means that the only paths remaining between lung cancer and car accident are direct causal chains:
Characterize all the "triples" on direction tolerant paths between two vertices as "chains," "forks" or "colliders":
Neat Examples (1)
Determine whether two nodes of a graph are "d-separated" from each other by seeing if there are colliders on all the weak paths between two vertices: