GraphsThe data type graph is the basic data type for representing graphs in LEDA. It can represent directed and undirected graphs G=(V,E), where V is the list of nodes and E is the list of directed, respectively undirected, edges. Nodes and edges are of type item.The main difference between directed and undirected graphs is the way edges incident to a node are stored. An edge is incident to a node if the node is an end vertex of the edge. Details can be found on the Graph Manual Page. The data type Simple example of how to use graph Strengths
Disadvantages
TipsUsegraph to represent directed and undirected graphs, and
planar maps. Only if you have good reasons use Planar
Maps. |
See also:How to Associate Information with graphs GraphWin for visualizing graphs and graph algorithms Manual Entries: |