Home > Term: undirected graph
undirected graph
A graph whose edges are unordered pairs of vertices. That is, each edge connects two vertices. Formal Definition: A graph G is a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ ((u,v)
- Jenis Kata: noun
- Industri / Domain: Sains komputer
- Kategori: Algorithms & data structures
- Government Agency: NIST
0
Penulis
- GeorgeV
- 100% positive feedback