Skip to main content

functions - Vertex descendants subgraph


Keywords: vertex, ancestors, descendants, subgraph, directed graph, flow subtree




So let's say we have a TreeGraph:


opts = Sequence[
   EdgeShapeFunction -> GraphElementData["FilledArrow", "ArrowSize" -> 0.02], 
   VertexLabels      -> "Name"
];

data = RandomInteger[#] -> # + 1 & /@ Range[0, 10];

g = TreeGraph[data, opts]


enter image description here


Question


What's the proper/functional way to get subgraph containing only successors of given node with respect to the flow.


I'm not very familiar with graphs so I have a solution (bottom) but I suppose I'm missing some basic graph related functions.


Example


for 0 it would be the whole graph


for 4 it would be {4->5, 5->8, 8->9}


Problem


I can't find appriopriate function and AdjacencyList/IncidenceList don't respect the direction of the flow:


topV = 4;

HighlightGraph[g, 
  {Style[topV, Blue], AdjacencyList[g, topV, 2], IncidenceList[g, topV, 2]}
]

enter image description here


My brute force but not so stupid solution:


let's cut the inflow! so the AdjacencyList won't leave this way :)


subTreeWF[g, 4] // TreeGraph[#, opts] &

enter image description here



I'm assuming here that the topNode is not the final one, in such case additional check is needed.


subTreeWF[treeGraph_, topNode_] := Module[{edges},
  edges = EdgeList @ treeGraph;
  edges = DeleteCases[  edges, 
     (Rule | DirectedEdge | UndirectedEdge)[_, topNode]
  ];

  IncidenceList[Graph @ edges, topNode, \[Infinity]]

]



g = Graph[RandomInteger[#] -> # + 1 & /@ Range[0, 30], opts];

topV = 5;

HighlightGraph[g, {Style[topV, Blue], subTreeWF[g, topV]}]

enter image description here



Answer




You are looking for VertexOutComponent.


VertexOutComponent[g, 4]

gives you the successors of 4. Use Subgraph to get an actual graph out of those. With HighlightGraph, you can also use a subgraph, it will highlight both vertices and edges: HighlightGraph[g, Subgraph[g, VertexOutComponent[g, 4]]].


For visualizing the graph, use GraphLayout -> "LayeredDigraphEmbedding", which will place the root at the topmost position. Some other tree layouts have a "RootVertex" suboptions to achieve this (e.g. for undirected where anything can be the "root").


Comments

Post a Comment

Popular posts from this blog

functions - Get leading series expansion term?

Given a function f[x] , I would like to have a function leadingSeries that returns just the leading term in the series around x=0 . For example: leadingSeries[(1/x + 2)/(4 + 1/x^2 + x)] x and leadingSeries[(1/x + 2 + (1 - 1/x^3)/4)/(4 + x)] -(1/(16 x^3)) Is there such a function in Mathematica? Or maybe one can implement it efficiently? EDIT I finally went with the following implementation, based on Carl Woll 's answer: lds[ex_,x_]:=( (ex/.x->(x+O[x]^2))/.SeriesData[U_,Z_,L_List,Mi_,Ma_,De_]:>SeriesData[U,Z,{L[[1]]},Mi,Mi+1,De]//Quiet//Normal) The advantage is, that this one also properly works with functions whose leading term is a constant: lds[Exp[x],x] 1 Answer Update 1 Updated to eliminate SeriesData and to not return additional terms Perhaps you could use: leadingSeries[expr_, x_] := Normal[expr /. x->(x+O[x]^2) /. a_List :> Take[a, 1]] Then for your examples: leadingSeries[(1/x + 2)/(4 + 1/x^2 + x), x] leadingSeries[Exp[x], x] leadingSeries[(1/x + 2 + (1 - 1/x...
Post a Comment
Read more

mathematical optimization - Minimizing using indices, error: Part::pkspec1: The expression cannot be used as a part specification

I want to use Minimize where the variables to minimize are indices pointing into an array. Here a MWE that hopefully shows what my problem is. vars = u@# & /@ Range[3]; cons = Flatten@ { Table[(u[j] != #) & /@ vars[[j + 1 ;; -1]], {j, 1, 3 - 1}], 1 vec1 = {1, 2, 3}; vec2 = {1, 2, 3}; Minimize[{Total@((vec1[[#]] - vec2[[u[#]]])^2 & /@ Range[1, 3]), cons}, vars, Integers] The error I get: Part::pkspec1: The expression u[1] cannot be used as a part specification. >> Answer Ok, it seems that one can get around Mathematica trying to evaluate vec2[[u[1]]] too early by using the function Indexed[vec2,u[1]] . The working MWE would then look like the following: vars = u@# & /@ Range[3]; cons = Flatten@{ Table[(u[j] != #) & /@ vars[[j + 1 ;; -1]], {j, 1, 3 - 1}], 1 vec1 = {1, 2, 3}; vec2 = {1, 2, 3}; NMinimize[ {Total@((vec1[[#]] - Indexed[vec2, u[#]])^2 & /@ R...
Post a Comment
Read more

How to remap graph properties?

Graph objects support both custom properties, which do not have special meanings, and standard properties, which may be used by some functions. When importing from formats such as GraphML, we usually get a result with custom properties. What is the simplest way to remap one property to another, e.g. to remap a custom property to a standard one so it can be used with various functions? Example: Let's get Zachary's karate club network with edge weights and vertex names from here: http://nexus.igraph.org/api/dataset_info?id=1&format=html g = Import[ "http://nexus.igraph.org/api/dataset?id=1&format=GraphML", {"ZIP", "karate.GraphML"}] I can remap "name" to VertexLabels and "weights" to EdgeWeight like this: sp[prop_][g_] := SetProperty[g, prop] g2 = g // sp[EdgeWeight -> (PropertyValue[{g, #}, "weight"] & /@ EdgeList[g])] // sp[VertexLabels -> (# -> PropertyValue[{g, #}, "name"]...
Post a Comment
Read more