✳flâneur — a map of the web's best reading

sparse graph

xlinux.nist.gov · 176 words · saved by 1 readers

Definition of sparse graph, possibly with links to more information and implementations.

sparse graph sparse graph (definition) Definition: A graph in which the number of edges is much less than the possible number of edges. Generalization (I am a kind of ...) graph . See also dense graph , complete graph , adjacency-list representation . Note: A directed graph can have at most n(n-1) edges, where n is the number of vertices . An undirected graph can have at most n(n-1)/2 edges. There is no strict distinction between sparse and dense graphs. Typically, a sparse (connected) graph has about as many edges as vertices, and a dense graph has nearly the maximum number of edges. Author:

Explore this link on the map →

related reading