Advanced Programming I Lecture Notes
21 March 2006 • Graph Basics
Euler's original graph
is not a graph because of the, for example, duplicate edges between the western and northern vertices. Graphs with duplicate edges are known as
hypergraphs
.
This page last modified on 24 January 2006.
