Each kind of graph can be inspected to know:

  • the number of connected components
  • the size of the graph individuals/concepts/relations
  • the degree of the vertices min, max and average
  • is it normalized ?
  • is it redundant ?


A View is opened named Graph Inspector

 

Redundancy


A redundant graph can trigger a positive constraint violation when irredundant form will not.
Detecting and computing redundancies can be an heavy operation, the wizard doesn't automatically provide it.
Click on button to run algorithm.


When the graph is too big, redundancy is not automatically computed. Click on button to compute it:

and sometime it is a too long term job...

 If redundancies exist, they can be edited to eliminate redundant parts of the graph.



Created with the Personal Edition of HelpNDoc: Easily create EBooks