Nevron .NET Vision Documentation

Nevron.Diagram.DataStructures Namespace

Nevron.Diagram Assembly : Nevron.Diagram.DataStructures Namespace |

Classes

Class | Description | |
---|---|---|

NAccumulatingVisitor | The NAccumulatingVisitor class is used to accumulate the visited graph parts | |

NBicomp | Decomposes a graph into its biconnected components and builds it block-cut tree, in which each node is a cut vertex or a biconnected component. | |

NCountingVisitor | The NCountingVisitor is used to count the visited graph parts | |

NGraph | The NGraph class represents a graph | |

NGraphAdapter | The NGraphAdapter class is used to abstract users from the actual way in which the specified objects form graphs. | |

NGraphBarycenterCrossingReductor | Implememnts the barycenter method for the layer-by-layer crossing reduction problem. | |

NGraphBuilder | The NGraphBuilder class is used for the construction of a graph, which represents a single or multiple connected object regions. | |

NGraphCrossingReductorBase | The base class for all crossing reductors for bipartite graphs. | |

NGraphEdge | The NGraphEdge class represents an edge connecting two vertices | |

NGraphEdgeList | The NGraphEdgeList class represents a typed list of NGraphEdge instances | |

NGraphFullCrossingReductor | Investigates all possible permutations and provides an optimal solution for the one sided crossing reduction problem. | |

NGraphGeneticCrossingReductor | Solves the crossing reduction problem by using genetic algorithm. | |

NGraphPart | The NGraphPart class servers as base class for graph edges, graph vertices, tree edges and tree vertices | |

NGraphPartContainer | The NGraphPartContainer class serves as base class for graphs and trees | |

NGraphPartFactory | The NGraphPartFactory class is used by the graph builder for the actual construction of graph parts | |

NGraphPartVisitor | The NGraphPartVisitor class is used to visit the parts of graphs and trees and serves as base class for all types of graph part visitors | |

NGraphVertex | The NGraphVertex class represents a vertex in a graph | |

NGraphVertexDegreeComparer | The NGraphVertexDegreeComparer class implements the IComparer interface and compares graph vertices by their degree | |

NGraphVertexList | The NGraphVertexList class represents a typed list of NGraphVertex instances | |

NObjectGraphPartMap | The NObjectGraphPartMap class, represents a mapping between a logical object and a graph part. An instance of this class is produced by graph and tree builders. | |

NPTreeVertex | ||

NShapeGraphAdapter | The NShapeGraphAdapter is used to adapt shapes and shapes connections as graph relations | |

NShortestPathDijkstra | Implements a generalized Dijkstra's algorithm to calculate the shortest path problem. | |

NTree | The NTree class represents a tree | |

NTreeEdge | The NTreeEdge class represents an edge connecting two tree vertices | |

NTreeEdgeList | The NTreeEdgeList class represents a typed list of NTreeEdge instances | |

NTreeVertex | The NTreeVertex class represents a vertex in a tree (tree item) | |

NTreeVertexList | The NTreeVertexList class represents a typed list of NTreeVertex instances |

Delegates

Delegate | Description | |
---|---|---|

NShortestPathDijkstra.InternodeTraversalCost | Determines the cost of moving from a given node to another given node.
The cost of the transition from | |

NShortestPathDijkstra.NearbyNodesHint | An optional delegate that can help optimize the algorithm by showing it a subset of nodes to consider. Very useful for limited connectivity graphs. (like pixels on a screen!) |

See Also