フィルターのクリア

How to obtain a graph?

2 ビュー (過去 30 日間)
Andrea Miceli
Andrea Miceli 2021 年 7 月 16 日
編集済み: Matt J 2021 年 7 月 16 日
Hello to evreyone, I did a digraph on matlab and the result is what you see in the pic attached. What i am intereset in doing is to take just one node from this graph and see to which other nodes it connects to ( both in-degree and out-degree). As you can imagine, for a presentation the graph below is not really clear. I've already checked other function such as "subgraph", but I was not able to manage it. Can someone help me in doing this?
Thanks in advance

採用された回答

Matt J
Matt J 2021 年 7 月 16 日
編集済み: Matt J 2021 年 7 月 16 日
I've already checked other function such as "subgraph", but I was not able to manage it.
That should have worked,
neighb=[predecessors(G,nodeID); nodeID; successors(G,nodeID)];
Gsub=subgraph(G,neighb)

その他の回答 (0 件)

カテゴリ

Help Center および File ExchangeGraph and Network Algorithms についてさらに検索

Community Treasure Hunt

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

Start Hunting!

Translated by