distanceGraph Class Reference
[Graph composition by node distances]

Complete digraphs where arc length represent a shortest directed path. More...

#include <denseDigraph.h>

Inheritance diagram for distanceGraph:

denseDiGraph abstractDiGraph abstractMixedGraph managedObject goblinRootObject

Public Member Functions

 distanceGraph (abstractMixedGraph &G) throw (ERRejected)

Detailed Description

Complete digraphs where arc length represent a shortest directed path.

Distance graphs are complete digraphs which are obtained from a mixed graph graph by setting the length labels according to the shortest directed path lengths in the original mixed graph


Constructor & Destructor Documentation

distanceGraph abstractMixedGraph G  )  throw (ERRejected)