How to convert graph to digraph?

2017 8 4
1 个回答
回答已采纳
更新时间：2023 11 9
13 次查看（30 天）

0 个投票

Hi all -
I plotted an graph and want to make some specific edges to be directed (digraph). Just to be a bit clearer: I have a full plotted and formatted minimum spanning tree from a graph which is not directed. I want to loop through the edges and, if a certain condition is met, replace the edge for a directed edge, pointing from node A to node B.
Is this possible? My graph would have both directed and undirected edges.
Best.

请先登录，再回答此问题。

 采纳的回答

Christine Tobler
Christine Tobler 2017-8-4

0 个投票

I'm afraid it's not possible to have both directed and undirected edges in the same graph. To convert a graph to a digraph, you could use
gDirected = digraph(adjacency(gUndirected));
This will replace every undirected edge with two directed edges going in opposing directions. You could then use rmedge to remove the edges that go in the direction you don't want.
Within most graph algorithms, these two edges will behave the same way as the undirected edge did - but of course, the plot will look very different.

5 个评论
显示 3更早的评论 隐藏 3更早的评论

Felipe Schuback
Felipe Schuback 2017-8-7
Hi Christine, thank you very much for the info. But just to make sure, you are saying that it is not possible in any way to get something like the photo I have attached? Some edges with no arrows and some with arrows (if some condition is met)?
Walter Roberson
Walter Roberson 2017-8-8
In order to do that you would have to use two plot() of two different graphs, with the positions of each node carefully set so that everything lined up "just right".
Felipe Schuback
Felipe Schuback 2017-8-8
Thank you Walter, for your answer. I imagined I would have to do something like that. Do you have any suggestions on how I would be able to do something like this?
Reihaneh Jahedan
Reihaneh Jahedan 2023-11-8
If our graph is weighted and has different weight in different edges, how can we preserve these weights while converting to directed graph?
Walter Roberson
Walter Roberson 2023-11-9
Ran in:
Ran in:
@Reihaneh Jahedan
In the following code, I replace self-loops by a single undirectional edge from the node to itself, with weight the same as the graph weight. There are some cases in which people might feel that instead a self-loop should be replaced with two unidirectional loops from the node to itself, each with the weight of the original self-loop... but that is not what I implemented.
G = graph([0.0 0.1 0.2 0.3
0.1 0.0 0.4 0.5
0.2 0.4 10.0 0.6
0.3 0.5 0.6 0.0
])
G =
graph with properties: Edges: [7×2 table] Nodes: [4×0 table]
HEdges1 = G.Edges;
HEdges2 = table(fliplr(HEdges1.EndNodes), HEdges1.Weight, 'VariableNames', {'EndNodes', 'Weight'});
HEdges = unique([HEdges1; HEdges2], 'rows');
H = digraph(HEdges);
H =
digraph with properties: Edges: [13×2 table] Nodes: [4×0 table]
plot(G,'EdgeLabel',G.Edges.Weight)
plot(H,'EdgeLabel',H.Edges.Weight)

请先登录，再进行评论。

更多回答（0 个）

类别

在 帮助中心 和 File Exchange 中查找有关 Graph and Network Algorithms 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by