Basic Examples (2) 

Find a weak path graph for a simple directed graph:

In[1]:=

Out[1]=

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":

In[2]:=

Out[2]=

In[3]:=

Out[3]=

Scope (4) 

WeakPathGraphs works with undirected graphs:

In[4]:=

Out[4]=

Directed graphs:

In[5]:=

Out[5]=

Multigraphs:

In[6]:=

Out[6]=

Mixed graphs:

In[7]:=

Out[7]=

In[8]:=

Out[8]=

Options (1) 

One can use any option available to Graph to override inheritance of options from the underlying graph or to add other options:

In[9]:=

Out[9]=

In[10]:=

Out[10]=

In[11]:=

Out[11]=

Applications (3) 

One can show the weak paths in the context of the original graph:

In[12]:=

Out[12]=

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:

In[13]:=

Out[13]=

There are no conventional paths:

In[14]:=

Out[14]=

There are paths if orientation is disregarded:

In[15]:=

Out[15]=

Find "backdoor" paths as well as directed paths in a causal network:

In[16]:=

Out[16]=

In[17]:=

Out[17]=

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:

In[18]:=

Out[18]=

Characterize all the "triples" on direction tolerant paths between two vertices as "chains," "forks" or "colliders":

In[19]:=

In[20]:=

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:

In[21]:=

Out[21]=

In[22]:=

In[23]:=

Out[23]=