QuickGraph

QuickGraph Namespace

Type	Description
AdjacencyGraph<'TVertex, 'TEdge>	A mutable directed graph data structure efficient for sparse graph representation where out-edge need to be enumerated only.
ArrayAdjacencyGraph<'TVertex, 'TEdge>	An immutable directed graph data structure efficient for large sparse graph representation where out-edge need to be enumerated only.
ArrayBidirectionalGraph<'TVertex, 'TEdge>	An immutable directed graph data structure efficient for large sparse graph representation where out-edge need to be enumerated only.
ArrayEqualityComparer<'T>	Equality comparer for array of T using Equals1 method.
ArrayUndirectedGraph<'TVertex, 'TEdge>	An immutable undirected graph data structure based on arrays.
BidirectionAdapterGraph<'TVertex, 'TEdge>	Wraps a vertex list graph (out-edges only) and caches the in-edge dictionary.
BidirectionalGraph<'TVertex, 'TEdge>	A mutable directed graph data structure efficient for sparse graph representation where out-edge and in-edges need to be enumerated. Requires twice as much memory as the adjacency graph.
BidirectionalMatrixGraph<'TEdge>
ClusteredAdjacencyGraph<'TVertex, 'TEdge>
CompressedSparseRowGraph<'TVertex>	Directed graph representation using a Compressed Sparse Row representation (http://www.cs.utk.edu/~dongarra/etemplates/node373.html)
CreateEdgeDelegate<'TVertex, 'TEdge>	An edge factory delegate
CreateVertexDelegate<'TVertex, 'TEdge>	A vertex factory delegate.
DelegateBidirectionalIncidenceGraph<'TVertex, 'TEdge>	A delegate based bidirectional implicit graph
DelegateImplicitGraph<'TVertex, 'TEdge>	A delegate-based implicit graph
DelegateImplicitUndirectedGraph<'TVertex, 'TEdge>	A functional implicit undirected graph
DelegateIncidenceGraph<'TVertex, 'TEdge>	A delegate-based incidence graph
DelegateUndirectedGraph<'TVertex, 'TEdge>	A functional implicit undirected graph
DelegateVertexAndEdgeListGraph<'TVertex, 'TEdge>	A delegate-based incidence graph
DotParserAdapter
DoubleEqualityComparer	IEqualityComparer for floats with user-specified tolerance.
Edge<'TVertex>	The default implementation.
EdgeAction<'TVertex, 'TEdge>	The handler for events involving edges
EdgeEdgeAction<'TVertex, 'TEdge>	The handler for events involving two edges
EdgeEqualityComparer<'TVertex, 'TEdge>
EdgeEventArgs<'TVertex, 'TEdge>	An event involving an edge.
EdgeExtensions
EdgeFactory<'TVertex, 'TEdge>	An edge factory
EdgeIdentity<'TVertex, 'TEdge>
EdgeListGraph<'TVertex, 'TEdge>
EdgePredicate<'TVertex, 'TEdge>
EnumerableContract
EqualityExtensions	Deep equality methods for collections (arrays, dictionaries) implemented as extension methods.
EquatableEdge<'TVertex>	An equatable edge implementation
EquatableTermEdge<'TVertex>	An equatable term edge implementation
EquateGraphs
FloatEqualityComparer	IEqualityComparer for floats with user-specified tolerance.
GraphColor	Colors used in vertex coloring algorithms
GraphExtensions	Extension methods for populating graph datastructures
IBidirectionalGraph<'TVertex, 'TEdge>	A directed graph datastructure that is efficient to traverse both in and out edges.
IBidirectionalIncidenceGraph<'TVertex, 'TEdge>	A directed graph datastructure that is efficient to traverse both in and out edges.
ICloneableEdge<'TVertex, 'TEdge>	A cloneable edge
IClusteredGraph
IEdge<'TVertex>	A directed edge
IEdgeListAndIncidenceGraph<'TVertex, 'TEdge>	An incidence graph whose edges can be enumerated
IEdgeListGraph<'TVertex, 'TEdge>	A graph whose edges can be enumerated
IEdgeSet<'TVertex, 'TEdge>	A set of edges
IGraph<'TVertex, 'TEdge>	A graph with vertices of type and edges of type
IHierarchy<'TVertex, 'TEdge>
IHyperEdge<'TVertex>
IImplicitGraph<'TVertex, 'TEdge>	A implicit directed graph datastructure
IImplicitUndirectedGraph<'TVertex, 'TEdge>
IImplicitVertexSet<'TVertex>	An implicit set of vertices
IIncidenceGraph<'TVertex, 'TEdge>
IMutableBidirectionalGraph<'TVertex, 'TEdge>	A mutable bidirectional directed graph
IMutableEdgeListGraph<'TVertex, 'TEdge>	A mutable edge list graph.
IMutableGraph<'TVertex, 'TEdge>	A mutable graph instance
IMutableIncidenceGraph<'TVertex, 'TEdge>	A mutable incidence graph
IMutableTermBidirectionalGraph<'TVertex, 'TEdge>
IMutableUndirectedGraph<'TVertex, 'TEdge>	A mutable indirect graph
IMutableVertexAndEdgeListGraph<'TVertex, 'TEdge>	A mutable vertex and edge list graph
IMutableVertexAndEdgeSet<'TVertex, 'TEdge>	A mutable vertex and edge set
IMutableVertexListGraph<'TVertex, 'TEdge>	A mutable vertex list graph
IMutableVertexSet<'TVertex>	A mutable vertex set
ITagged<'TTag>	An instance holding a tag
ITermBidirectionalGraph<'TVertex, 'TEdge>
ITermEdge<'TVertex>	A directed edge with terminal indices
IUndirectedEdge<'TVertex>	An undirected edge.
IUndirectedGraph<'TVertex, 'TEdge>	An undirected graph
IVertexAndEdgeListGraph<'TVertex, 'TEdge>	A directed graph where vertices and edges can be enumerated efficiently.
IVertexListGraph<'TVertex, 'TEdge>	A directed graph datastructure where out-edges can be traversed, i.e. a vertex set + implicit graph.
IVertexSet<'TVertex>	A set of vertices
IdentifiableEdgeFactory<'TVertex, 'TEdge>	A factory of identifiable edges.
IdentifiableVertexFactory<'TVertex>	A factory of identifiable vertices.
NegativeCycleGraphException
NegativeWeightException
NoPathFoundException
NonAcyclicGraphException
NonStronglyConnectedGraphException	Exception raised when an algorithm detects a non-strongly connected graph.
ParallelEdgeNotAllowedException
QuickGraphException
QuickGraphResourceManager
ReferenceEqualityComparer<'T>	EqualityComparer that uses Object.ReferenceEquals to compare items.
ReversedBidirectionalGraph<'TVertex, 'TEdge>
SEdge<'TVertex>	An struct based implementation.
SEquatableEdge<'TVertex>	An struct based implementation.
SEquatableUndirectedEdge<'TVertex>	An struct based implementation.
SReversedEdge<'TVertex, 'TEdge>	A reversed edge
STaggedEdge<'TVertex, 'TTag>	A tagged edge as value type.
STaggedEquatableEdge<'TVertex, 'TTag>	A tagged edge as value type.
SUndirectedEdge<'TVertex>	An struct based implementation.
SUndirectedTaggedEdge<'TVertex, 'TTag>	An struct based implementation.
TaggedEdge<'TVertex, 'TTag>
TaggedEquatableEdge<'TVertex, 'TTag>	An equatable, tagged, edge
TaggedUndirectedEdge<'TVertex, 'TTag>	A tagged undirected edge.
TermBidirectionalGraph<'TVertex, 'TEdge>
TermEdge<'TVertex>	The default implementation.
TryFunc<'T1, 'T2, 'T3, 'T4, 'TResult>
TryFunc<'T1, 'T2, 'T3, 'TResult>
TryFunc<'T1, 'T2, 'TResult>
TryFunc<'T, 'TResult>
UndirectedBidirectionalGraph<'TVertex, 'TEdge>
UndirectedEdge<'TVertex>	The default implementation.
UndirectedEdgeAction<'TVertex, 'TEdge>
UndirectedEdgeEventArgs<'TVertex, 'TEdge>
UndirectedGraph<'TVertex, 'TEdge>
VertexAction<'TVertex>
VertexEventArgs<'TVertex>
VertexEventHandler<'TVertex>
VertexFactory<'TVertex>
VertexIdentity<'TVertex>
VertexIndexer<'TVertex>
VertexPredicate<'TVertex>

QuickGraph.Algorithms Namespace

Type	Description
AlgorithmBase<'TGraph>
AlgorithmEventHandler<'TGraph>
AlgorithmExtensions	Various extension methods to build algorithms
CentralityApproximationAlgorithm<'TVertex, 'TEdge>
ComponentWithEdges
ComputationState	The computation state of a graph algorithm
DistanceRelaxers
EulerianTrailAlgorithm<'TVertex, 'TEdge>
IAlgorithm<'TGraph>
IComputation
IConnectedComponentAlgorithm<'TVertex, 'TEdge, 'TGraph>
IDistanceRecorderAlgorithm<'TVertex, 'TEdge>	An algorithm that exposes events to compute a distance map between vertices
IDistanceRelaxer
IEdgeColorizerAlgorithm<'TVertex, 'TEdge>
IEdgePredecessorRecorderAlgorithm<'TVertex, 'TEdge>
IEndPathEdgeRecorderAlgorithm<'TVertex, 'TEdge>
ITreeBuilderAlgorithm<'TVertex, 'TEdge>
IUndirectedTreeBuilderAlgorithm<'TVertex, 'TEdge>
IUndirectedVertexPredecessorRecorderAlgorithm<'TVertex, 'TEdge>
IVertexColorizerAlgorithm<'TVertex, 'TEdge>
IVertexPredecessorRecorderAlgorithm<'TVertex, 'TEdge>
IVertexTimeStamperAlgorithm<'TVertex, 'TEdge>
IsEulerianGraphAlgorithm<'TVertex, 'TEdge>
IsHamiltonianGraphAlgorithm<'TVertex, 'TEdge>
MaximumBipartiteMatchingAlgorithm<'TVertex, 'TEdge>
RandomGraphFactory
RootedAlgorithmBase<'TVertex, 'TGraph>
RootedSearchAlgorithmBase<'TVertex, 'TGraph>
TarjanOfflineLeastCommonAncestorAlgorithm<'TVertex, 'TEdge>	Offline least common ancestor in a rooted tre
TransitiveClosureAlgorithm<'TVertex, 'TEdge>
TransitiveReductionAlgorithm<'TVertex, 'TEdge>
ApproxCompleteColoringAlgorithm<'Vertex, 'Edge>
BergerShorMinimumFeedbackArcSetAlgorithm
BipartiteDimensionAlgorithm
Chromosome
DomaticPartition<'Vertex, 'Edge>
EdgeColoringAlgorithm<'Vertex, 'Edge>
Fitness
Individual
MaxCardinality<'Vertex, 'Edge>
MaximumIndependentSetAlgorithm
MinimumDominatingSetGeneticAlgorithm
Population

Module	Description
ChromaticPolynomial
GeneticConstants
InducedPathAlgorithm

QuickGraph.Algorithms.AssigmentProblem Namespace

Type	Description
HungarianAlgorithm
HungarianIteration

QuickGraph.Algorithms.Cliques Namespace

Type	Description
MaximumCliqueAlgorithmBase<'TVertex, 'TEdge>

QuickGraph.Algorithms.Condensation Namespace

Type	Description
CondensationGraphAlgorithm<'TVertex, 'TEdge, 'TGraph>
CondensedEdge<'TVertex, 'TEdge, 'TGraph>
EdgeMergeCondensationGraphAlgorithm<'TVertex, 'TEdge>
MergedEdge<'TVertex, 'TEdge>

QuickGraph.Algorithms.ConnectedComponents Namespace

Type	Description
ConnectedComponentsAlgorithm<'TVertex, 'TEdge>
IncrementalConnectedComponentsAlgorithm<'TVertex, 'TEdge>
StronglyConnectedComponentsAlgorithm<'TVertex, 'TEdge>
WeaklyConnectedComponentsAlgorithm<'TVertex, 'TEdge>

QuickGraph.Algorithms.Exploration Namespace

Type	Description
CloneableVertexGraphExplorerAlgorithm<'TVertex, 'TEdge>
ITransitionFactory<'TVertex, 'TEdge>
TransitionFactoryImplicitGraph<'TVertex, 'TEdge>

QuickGraph.Algorithms.GraphColoring.VertexColoring Namespace

Type	Description
InputModel<'TVertex, 'TEdge>
OutputModel<'TVertex, 'TEdge>
VertexColoringAlgorithm<'TVertex, 'TEdge>

QuickGraph.Algorithms.KernighanLinAlgoritm Namespace

Type	Description
KernighanLinAlgoritm<'TVertex, 'TEdge>
Partition<'TVertex>

QuickGraph.Algorithms.MaximumFlow Namespace

Type	Description
AllVerticesGraphAugmentorAlgorithm<'TVertex, 'TEdge>
EdmondsKarpMaximumFlowAlgorithm<'TVertex, 'TEdge>	Edmond and Karp maximum flow algorithm for directed graph with positive capacities and flows.
GraphAugmentorAlgorithmBase<'TVertex, 'TEdge, 'TGraph>
GraphBalancerAlgorithm<'TVertex, 'TEdge>
MaximumFlowAlgorithm<'TVertex, 'TEdge>	Abstract base class for maximum flow algorithms.
MultiSourceSinkGraphAugmentorAlgorithm<'TVertex, 'TEdge>
ReversedEdgeAugmentorAlgorithm<'TVertex, 'TEdge>

QuickGraph.Algorithms.MinimumSpanningTree Namespace

Type	Description
IMinimumSpanningTreeAlgorithm<'TVertex, 'TEdge>
KruskalMinimumSpanningTreeAlgorithm<'TVertex, 'TEdge>
PrimMinimumSpanningTreeAlgorithm<'TVertex, 'TEdge>

QuickGraph.Algorithms.Observers Namespace

Type	Description
EdgePredecessorRecorderObserver<'TVertex, 'TEdge>
EdgeRecorderObserver<'TVertex, 'TEdge>
IObserver<'TAlgorithm>	An algorithm observer
UndirectedVertexDistanceRecorderObserver<'TVertex, 'TEdge>	A distance recorder for undirected tree builder algorithms
UndirectedVertexPredecessorRecorderObserver<'TVertex, 'TEdge>
VertexDistanceRecorderObserver<'TVertex, 'TEdge>	A distance recorder for directed tree builder algorithms
VertexPredecessorPathRecorderObserver<'TVertex, 'TEdge>
VertexPredecessorRecorderObserver<'TVertex, 'TEdge>
VertexRecorderObserver<'TVertex, 'TEdge>
VertexTimeStamperObserver<'TVertex, 'TEdge>

QuickGraph.Algorithms.RandomWalks Namespace

Type	Description
CyclePoppingRandomTreeAlgorithm<'TVertex, 'TEdge>	Wilson-Propp Cycle-Popping Algorithm for Random Tree Generation.
IEdgeChain<'TVertex, 'TEdge>
IMarkovEdgeChain<'TVertex, 'TEdge>
MarkovEdgeChainBase<'TVertex, 'TEdge>
NormalizedMarkovEdgeChain<'TVertex, 'TEdge>
RandomWalkAlgorithm<'TVertex, 'TEdge>
RoundRobinEdgeChain<'TVertex, 'TEdge>
VanishingWeightedMarkovEdgeChain<'TVertex, 'TEdge>
WeightedMarkovEdgeChain<'TVertex, 'TEdge>
WeightedMarkovEdgeChainBase<'TVertex, 'TEdge>

QuickGraph.Algorithms.RankedShortestPath Namespace

Type	Description
HoffmanPavleyRankedShortestPathAlgorithm<'TVertex, 'TEdge>	Hoffman and Pavley K-shortest path algorithm.
RankedShortestPathAlgorithmBase<'TVertex, 'TEdge, 'TGraph>

QuickGraph.Algorithms.Ranking Namespace

Type	Description
PageRankAlgorithm<'TVertex, 'TEdge>

QuickGraph.Algorithms.Search Namespace

Type	Description
BestFirstFrontierSearchAlgorithm<'TVertex, 'TEdge>	Best first frontier search
BidirectionalDepthFirstSearchAlgorithm<'TVertex, 'TEdge>	A depth and height first search algorithm for directed graphs
BreadthFirstSearchAlgorithm<'TVertex, 'TEdge>	A breath first search algorithm for directed graphs
DepthFirstSearchAlgorithm<'TVertex, 'TEdge>	A depth first search algorithm for directed graph
EdgeDepthFirstSearchAlgorithm<'TVertex, 'TEdge>	A edge depth first search algorithm for directed graphs
ImplicitDepthFirstSearchAlgorithm<'TVertex, 'TEdge>	A depth first search algorithm for implicit directed graphs
ImplicitEdgeDepthFirstSearchAlgorithm<'TVertex, 'TEdge>	A edge depth first search algorithm for implicit directed graphs
UndirectedBreadthFirstSearchAlgorithm<'TVertex, 'TEdge>	A breath first search algorithm for undirected graphs
UndirectedDepthFirstSearchAlgorithm<'TVertex, 'TEdge>	A depth first search algorithm for directed graph

QuickGraph.Algorithms.Services Namespace

Type	Description
IAlgorithmComponent
IAlgorithmServices	Common services available to algorithm instances
ICancelManager
IService	Interface implemented by graph services

QuickGraph.Algorithms.ShortestPath Namespace

Type	Description
AStarShortestPathAlgorithm<'TVertex, 'TEdge>	A* single-source shortest path algorithm for directed graph with positive distance.
BellmanFordShortestPathAlgorithm<'TVertex, 'TEdge>	Bellman Ford shortest path algorithm.
DagShortestPathAlgorithm<'TVertex, 'TEdge>	A single-source shortest path algorithm for directed acyclic graph.
DijkstraShortestPathAlgorithm<'TVertex, 'TEdge>	Dijkstra single-source shortest path algorithm for directed graph with positive distance.
FloydWarshallAllShortestPathAlgorithm<'TVertex, 'TEdge>	Floyd-Warshall all shortest path algorith,
ShortestPathAlgorithmBase<'TVertex, 'TEdge, 'TGraph>
UndirectedDijkstraShortestPathAlgorithm<'TVertex, 'TEdge>	A single-source shortest path algorithm for undirected graph with positive distance.
UndirectedShortestPathAlgorithmBase<'TVertex, 'TEdge>

QuickGraph.Algorithms.ShortestPath.Yen Namespace

Type	Description
YenShortestPathsAlgorithm<'TVertex>

QuickGraph.Algorithms.TSP Namespace

Type	Description
TSP<'TVertex, 'TEdge, 'TGraph>
TaskPriority

QuickGraph.Algorithms.TopologicalSort Namespace

Type	Description
SourceFirstBidirectionalTopologicalSortAlgorithm<'TVertex, 'TEdge>
SourceFirstTopologicalSortAlgorithm<'TVertex, 'TEdge>
TopologicalSortAlgorithm<'TVertex, 'TEdge>
TopologicalSortDirection
UndirectedFirstTopologicalSortAlgorithm<'TVertex, 'TEdge>
UndirectedTopologicalSortAlgorithm<'TVertex, 'TEdge>

QuickGraph.Collections Namespace

Type	Description
BinaryHeap<'TPriority, 'TValue>	Binary heap
BinaryQueue<'TVertex, 'TDistance>
EdgeEdgeDictionary<'TVertex, 'TEdge>
EdgeList<'TVertex, 'TEdge>
FibonacciHeap<'TPriority, 'TValue>
FibonacciHeapCell<'TPriority, 'TValue>
FibonacciHeapLinkedList<'TPriority, 'TValue>
FibonacciQueue<'TVertex, 'TDistance>
ForestDisjointSet<'T>	Disjoint-set implementation with path compression and union-by-rank optimizations. optimization
HeapDirection	Specifies the order in which a Heap will Dequeue items.
IDisjointSet<'T>	A disjoint-set data structure
IEdgeList<'TVertex, 'TEdge>	A cloneable list of edges
IPriorityQueue<'T>
IQueue<'T>
IVertexEdgeDictionary<'TVertex, 'TEdge>	A dictionary of vertices to a list of edges
Queue<'T>
SoftHeap<'TKey, 'TValue>
TermEdgeList<'TVertex, 'TEdge>
VertexEdgeDictionary<'TVertex, 'TEdge>
VertexList<'TVertex>

QuickGraph.Contracts Namespace

Type	Description
GraphContract	Debug only assertions and assumptions

QuickGraph.Data Namespace

Type	Description
DataRelationEdge
DataSetGraph
DataSetGraphExtensions
DataSetGraphPopulatorAlgorithm
DataSetGraphvizAlgorithm	An algorithm that renders a DataSet graph to the Graphviz DOT format.

QuickGraph.FSA Namespace

Module	Description
GraphBasedFsa

QuickGraph.FST Namespace

Module	Description
FstTable
GraphBasedFst

QuickGraph.Glee Namespace

Type	Description
GleeDefaultGraphPopulator<'TVertex, 'TEdge>
GleeEdgeEventArgs<'TVertex, 'TEdge>
GleeEdgeEventHandler<'Vertex, 'Edge>
GleeGraphExtensions
GleeGraphPopulator<'TVertex, 'TEdge>
GleeIndentifiableGraphPopulator<'TVertex, 'TEdge>
GleeToStringGraphPopulator<'TVertex, 'TEdge>
GleeVertexEventArgs<'TVertex>
GleeVertexNodeEventHandler<'Vertex>

QuickGraph.Graphviz Namespace

Type	Description
CondensatedGraphRenderer<'TVertex, 'TEdge, 'TGraph>
EdgeMergeCondensatedGraphRenderer<'TVertex, 'TEdge>
FileDotEngine	Default dot engine implementation, writes dot code to disk
FormatClusterEventArgs<'TVertex, 'TEdge>	A clustered graph event argument.
FormatClusterEventHandler<'TVertex, 'TEdge>
FormatEdgeAction<'TVertex, 'TEdge>
FormatEdgeEventArgs<'TVertex, 'TEdge>
FormatVertexEventArgs<'TVertex>
FormatVertexEventHandler<'TVertex>
GraphRendererBase<'TVertex, 'TEdge>
GraphvizAlgorithm<'TVertex, 'TEdge>	An algorithm that renders a graph to the Graphviz DOT format.
GraphvizExtensions	Helper extensions to render graphs to graphviz
IDotEngine
SvgHtmlWrapper

QuickGraph.Graphviz.Dot Namespace

Type	Description
GraphvizArrow
GraphvizArrowClipping
GraphvizArrowFilling
GraphvizArrowShape
GraphvizClusterMode
GraphvizEdge
GraphvizEdgeDirection
GraphvizEdgeExtremity
GraphvizEdgeLabel
GraphvizEdgeStyle
GraphvizGraph
GraphvizImageType
GraphvizLabelJustification
GraphvizLabelLocation
GraphvizLayer
GraphvizLayerCollection
GraphvizOutputMode
GraphvizPageDirection
GraphvizRankDirection
GraphvizRatioMode
GraphvizRecord
GraphvizRecordCell
GraphvizRecordCellCollection
GraphvizRecordEscaper
GraphvizVertex
GraphvizVertexShape
GraphvizVertexStyle

QuickGraph.Petri Namespace

Type	Description
AllwaysTrueConditionExpression<'Token>
IArc<'Token>	A directed edge of a net which may connect a to a or a to a .
IConditionExpression<'Token>
IExpression<'Token>
IMutablePetriNet<'Token>
IPetriGraph<'Token>
IPetriNet<'Token>	A High Level Petri Graph.
IPetriVertex	A vertex (node) of a Petri Graph.
IPlace<'Token>	A Place in the HLPN framework
ITransition<'Token>	A node of a net, taken from the transition kind.
IdentityExpression<'Token>
PetriNet<'Token>
PetriNetSimulator<'Token>

QuickGraph.Predicates Namespace

Type	Description
FilteredBidirectionalGraph<'TVertex, 'TEdge, 'TGraph>
FilteredEdgeListGraph<'TVertex, 'TEdge, 'TGraph>
FilteredGraph<'TVertex, 'TEdge, 'TGraph>
FilteredImplicitGraph<'TVertex, 'TEdge, 'TGraph>
FilteredImplicitVertexSet<'TVertex, 'TEdge, 'TGraph>
FilteredIncidenceGraph<'TVertex, 'TEdge, 'TGraph>
FilteredUndirectedGraph<'TVertex, 'TEdge, 'TGraph>
FilteredVertexAndEdgeListGraph<'TVertex, 'TEdge, 'TGraph>
FilteredVertexListGraph<'TVertex, 'TEdge, 'Graph>
InDictionaryVertexPredicate<'TVertex, 'TValue>
IsolatedVertexPredicate<'TVertex, 'TEdge>	A vertex predicate that detects vertex with no in or out edges.
ResidualEdgePredicate<'TVertex, 'TEdge>
ReversedResidualEdgePredicate<'TVertex, 'TEdge>
SinkVertexPredicate<'TVertex, 'TEdge>

QuickGraph.Samples Namespace

Type	Description
GraphCreation
GraphvizSamples
WikiSamples

QuickGraph.Serialization Namespace

Type	Description
DirectedGraphMLAlgorithm<'TVertex, 'TEdge>
DirectedGraphMLExtensions	Directed Graph Markup Language extensions
GraphMLDeserializer<'TVertex, 'TEdge, 'TGraph>	A GraphML ( http://graphml.graphdrawing.org/ ) format deserializer.
GraphMLExtensions
GraphMLSerializer<'TVertex, 'TEdge, 'TGraph>	A GraphML ( http://graphml.graphdrawing.org/ ) format serializer.
GraphMLXmlResolver	A resolver that loads graphml DTD and XSD schemas from embedded resources.
SerializationExtensions
SerializerBase<'TVertex, 'TEdge>
XmlReaderExtensions
XmlSerializableEdge<'TVertex>
XmlSerializableGraph<'TVertex, 'TEdge, 'TGraph>	A base class that creates a proxy to a graph that is xml serializable
XmlWriterExtensions

QuickGraph.Serialization.DirectedGraphML Namespace

Type	Description
ClrBoolean
DirectedGraph
DirectedGraphAlias
DirectedGraphCategory
DirectedGraphLink
DirectedGraphLinkCategory
DirectedGraphName
DirectedGraphNode
DirectedGraphNodeCategory
DirectedGraphPath
DirectedGraphProperty
DirectedGraphStyle
DirectedGraphStyleCondition
DirectedGraphStyleSetter
FontStyleEnum
FontWeightEnum
FrameKindEnum
GraphDirectionEnum
GroupEnum
HorizontalAlignmentEnum
LayoutEnum
PropertyType
TargetTypeEnum
VerticalAlignmentEnum
VisibilityEnum

global Namespace

Module	Description
HelperTypes