Show / Hide Table of Contents

Interface IEdgeRoutingAlgorithm<TVertex, TEdge, TGraph>

Represents an edge routing algorithm.

Inherited Members
QuikGraph.Algorithms.IAlgorithm<TGraph>.VisitedGraph
QuikGraph.Algorithms.IComputation.Compute()
QuikGraph.Algorithms.IComputation.Abort()
QuikGraph.Algorithms.IComputation.SyncRoot
QuikGraph.Algorithms.IComputation.State
QuikGraph.Algorithms.IComputation.StateChanged
QuikGraph.Algorithms.IComputation.Started
QuikGraph.Algorithms.IComputation.Finished
QuikGraph.Algorithms.IComputation.Aborted
Namespace: GraphShape.Algorithms.EdgeRouting
Assembly: GraphShape.dll
Syntax
public interface IEdgeRoutingAlgorithm<TVertex, TEdge, out TGraph> : IAlgorithm<TGraph>, IComputation where TEdge : IEdge<TVertex> where TGraph : IVertexAndEdgeListGraph<TVertex, TEdge>
Type Parameters
Name Description
TVertex

Vertex type.

TEdge

Edge type.

TGraph

Graph type.

Properties

| Improve this Doc View Source

EdgeRoutes

The routing points of the edges (routes).

Declaration
IDictionary<TEdge, Point[]> EdgeRoutes { get; }
Property Value
Type Description
System.Collections.Generic.IDictionary<TEdge, Point[]>

Extension Methods

GraphHelpers.GetDistances<TVertex, TEdge, TGraph>(TGraph)
GraphHelpers.GetDiameter<TVertex, TEdge, TGraph>(TGraph)
GraphHelpers.GetDiameter<TVertex, TEdge, TGraph>(TGraph, out Double[,])
  • Improve this Doc
  • View Source
In This Article
Back to top GraphShape