Am 19.10.20 um 19:19 schrieb Gerion Entrup: > Hi, > > the dominator_tree function in graph_tool.topology outputs a vertex property > map that codifies a graph. > To use the other graph_tool algorithms, it would be beneficial to get the > dominator_tree back as Graph (or better GraphView). > > Is there already a way to do this? Otherwise, how do you like the idea to > implement it? > > A possible use case is it to check, if a dominates b. > This would be the pseudo code, if dominator_tree returns a graph like object: > > dom_tree = graph_tool.topology.dominator_tree(graph, start, as_graph=True)
That seems too ad hoc for me. I would prefer a more general function that creates a tree graph from an adjacency vector. Please open an issue for this, and I will take care when I find the time. Best, Tiago -- Tiago de Paula Peixoto <ti...@skewed.de>
signature.asc
Description: OpenPGP digital signature
_______________________________________________ graph-tool mailing list graph-tool@skewed.de https://lists.skewed.de/mailman/listinfo/graph-tool
