Extract subgraph by specifying edges

조회 수: 3 (최근 30일)
Kamal Premaratne
Kamal Premaratne 2022년 2월 17일
댓글: Kamal Premaratne 2022년 2월 21일
I have a digraph G from which I want to extract a subgraph by specifying specific edges (not vertices). As an example, suppose G has the following edge table:
EndNodes Weight Label
-------------- --------- --------
1 2 1 1
1 3 2 1
4 1 3 1
4 2 4 1
4 3 5 2
4 5 6 2
5 6 7 2
5 7 8 2
7 6 9 1
Each edge has a weight and also a label. I want to extract the digraph which has the edges with, say, label 2 only. The subgraph command allows one to extract the subgraph by specifying the nodes, but not edges (as far as I know). I can of course use
>> EdgeTable = G.Edges(G.Edges.label == 2, :)
>> G_subgraph = digraph(EdgeTable);
But this does not transfer the node properties that the nodes may have in G's node table (e.g., G.Nodes.Color, etc.).
Any assistance would be greatly appreciated. Thank you.
-- Kamal

채택된 답변

Anshika Chourasia
Anshika Chourasia 2022년 2월 21일
Hi Kamal,
I understand you want to extract subgraph by specifying specific edges.
Possible workaround for this problem is to have a vector named “EdgeNumber” containing the edge numbers for the interested label value and then store the end nodes in “EndNode” corresponding to those edges. Then, using the normal procedure to extract subgraph that contains only the nodes specified by “EndNode”.
Please refer this link for more information on extracting a subgraph through selected edges.
  댓글 수: 1
Kamal Premaratne
Kamal Premaratne 2022년 2월 21일
Thank you Anshika. Yes, I think you are right in that the best way is to copy the full digraph to another variable and then remove from it the edges that are not needed. As far as I can see, this is the only way to retain the node and edge properties in the subgraph.

댓글을 달려면 로그인하십시오.

추가 답변 (0개)

카테고리

Help CenterFile 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