metricGraph Class Reference
[Graph composition by node distances]

Complete graphs where edge length represent a shortest path. More...

#include <denseGraph.h>

Inheritance diagram for metricGraph:

Public Member Functions
	metricGraph (abstractGraph &G) throw (ERRejected)

---

Detailed Description

Complete graphs where edge length represent a shortest path.

Metric graphs are complete graphs which respect the triangle inequality d(uw) <= d(uv) + d(vw). They are obtained from another (possibly sparse) graph by setting the length labels according to the shortest path lengths in the original graph

---

Constructor & Destructor Documentation

metricGraph (  abstractGraph &  G  )  throw (ERRejected)