In[]:=
ggg=
;
In[]:=
path=With[{gg=IndexGraph[ggg]},FindShortestPath[gg,First[VertexList[gg]],Last[VertexList[gg]]]]
Out[]=
{1,95,186,364,728,886,1443,1973,2301,2394,2409}
In[]:=
GraphEmbedding[ggg][[path]]
Out[]=
{{2.42492,432.598},{25.0927,411.426},{35.8659,400.939},{23.5055,372.233},{-178.19,345.614},{-181.892,314.463},{-75.9954,241.002},{-100.01,212.951},{-114.243,186.429},{-99.2106,168.957},{-110.741,145.856}}
In[]:=
grgg=
;
In[]:=
TourVideo[grgg,Rectangle[#-100,#+100]&/@{{2.4249239803556506`,432.5984463579368`},{25.092650107142287`,411.4261847060755`},{35.8658679055291`,400.9389423283477`},{23.505524565139318`,372.23284948815893`},{-178.19000494169194`,345.6144658624224`},{-181.89177334508565`,314.4626435844191`},{-75.99539248312274`,241.00201450573184`},{-100.01022620346077`,212.95141578903204`},{-114.2431960045293`,186.42923741700415`},{-99.21058660642248`,168.9566793616494`},{-110.74103562805124`,145.85599696394144`}}]
Out[]=
​
In[]:=
Image

Out[]=
In[]:=
ggx=Import[StringJoin[NotebookDirectory[],​​"FromBrad/GraphData/k2r2ReducedGraph.wxf"]];
In[]:=
First[VertexList[#]]&/@WeaklyConnectedGraphComponents[ggx]
Out[]=
{{{276,285295007},{20,16847199},{272,16847199}},{{0,65815}}}
In[]:=
VertexCount/@WeaklyConnectedGraphComponents[ggx]
Out[]=
{2409,1}
In[]:=
Head[Import@CloudObject[
https://www.wolframcloud.com/obj/bc2fb7a7-419b-46a4-8cbd-5a691c1872b7
]]
Out[]=
Graph
In[]:=
Import@CloudObject[
https://www.wolframcloud.com/obj/bc2fb7a7-419b-46a4-8cbd-5a691c1872b7
]
Out[]=
In[]:=
With[{gqg=Import@CloudObject[
https://www.wolframcloud.com/obj/bc2fb7a7-419b-46a4-8cbd-5a691c1872b7
]},Row[ConnectedGraphComponents[Graph[addVertexFigures[VertexOutComponentGraph[gqg,{{20,16847199},{276,285295007},{272,16847199}},{1}],$LifetimeData[2,2,"All"],{2,2},VertexSize->.3,"VertexFigures"->1],GraphLayout->"RadialEmbedding",VertexCoordinates->Automatic],ImageSize->30]," "]]
Fix hardcoded vertx
and the distribution of lifetimes (heights) achieved is
Label x scale
while the successive longest-lifetime patterns are (the lifetime-108 phenotypes are at different “levels” because of the asymmetric choice of initial condition):

Treeification

Other Stuff

Stupidly slow:
XXXX
If you remove a node, then everything that has single “supply” below that node is also removed...
How many nodes have to be removed before it has a significant effect?
All paths from root go through dominator....
[[ This gives immediate dominator ]]
This shows which nodes one must necessarily go through to reach subsequent nodes
LUCA : last universal common ancestor ;; map of the least common ancestors for each set of nodes
Like speciation / isolation of nodes
[[[ Large structures tend to be endpoints, not ancestors ]]]
The 1-ancestor nodes live in the large fanout trees (?)