有 n 个节点的有向图中的最大边数是多少? [英] What is the maximum number of edges in a directed graph with n nodes?

问题描述

有 n 个节点的有向图中的最大边数是多少?有上限吗?

What is the maximum number of edges in a directed graph with n nodes? Is there any upper bound?

推荐答案

如果您有 N 个节点，则有 N - 1 个有向边可以从中引出(转到每个其他节点).因此，最大边数为N * (N - 1).

If you have N nodes, there are N - 1 directed edges than can lead from it (going to every other node). Therefore, the maximum number of edges is N * (N - 1).

这篇关于有 n 个节点的有向图中的最大边数是多少?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！