英和和英

出典:『Wikipedia』 (2011/06/12 19:50 UTC 版)

英語による解説

引用

In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges. The opposite, a graph with only a few edges, is a sparse graph. The distinction between sparse and dense graphs is rather vague, and depends on the context.