Show / Hide Table of Contents

Interface IMutableUndirectedGraph<TVertex, TEdge>

A mutable indirect graph with vertices of type TVertex and edges of type TEdge.

Inherited Members
IImplicitUndirectedGraph<TVertex, TEdge>.EdgeEqualityComparer
IImplicitUndirectedGraph<TVertex, TEdge>.AdjacentEdges(TVertex)
IImplicitUndirectedGraph<TVertex, TEdge>.AdjacentDegree(TVertex)
IImplicitUndirectedGraph<TVertex, TEdge>.IsAdjacentEdgesEmpty(TVertex)
IImplicitUndirectedGraph<TVertex, TEdge>.AdjacentEdge(TVertex, Int32)
IImplicitUndirectedGraph<TVertex, TEdge>.TryGetEdge(TVertex, TVertex, TEdge)
IImplicitUndirectedGraph<TVertex, TEdge>.ContainsEdge(TVertex, TVertex)
IMutableVertexAndEdgeSet<TVertex, TEdge>.AddVerticesAndEdge(TEdge)
IMutableVertexAndEdgeSet<TVertex, TEdge>.AddVerticesAndEdgeRange(IEnumerable<TEdge>)
IMutableVertexSet<TVertex>.VertexAdded
IMutableVertexSet<TVertex>.AddVertex(TVertex)
IMutableVertexSet<TVertex>.AddVertexRange(IEnumerable<TVertex>)
IMutableVertexSet<TVertex>.VertexRemoved
IMutableVertexSet<TVertex>.RemoveVertex(TVertex)
IMutableVertexSet<TVertex>.RemoveVertexIf(VertexPredicate<TVertex>)
IMutableEdgeListGraph<TVertex, TEdge>.AddEdge(TEdge)
IMutableEdgeListGraph<TVertex, TEdge>.EdgeAdded
IMutableEdgeListGraph<TVertex, TEdge>.AddEdgeRange(IEnumerable<TEdge>)
IMutableEdgeListGraph<TVertex, TEdge>.RemoveEdge(TEdge)
IMutableEdgeListGraph<TVertex, TEdge>.EdgeRemoved
IMutableEdgeListGraph<TVertex, TEdge>.RemoveEdgeIf(EdgePredicate<TVertex, TEdge>)
IMutableGraph<TVertex, TEdge>.Clear()
IGraph<TVertex, TEdge>.IsDirected
IGraph<TVertex, TEdge>.AllowParallelEdges
IEdgeSet<TVertex, TEdge>.IsEdgesEmpty
IEdgeSet<TVertex, TEdge>.EdgeCount
IEdgeSet<TVertex, TEdge>.Edges
IEdgeSet<TVertex, TEdge>.ContainsEdge(TEdge)
IVertexSet<TVertex>.IsVerticesEmpty
IVertexSet<TVertex>.VertexCount
IVertexSet<TVertex>.Vertices
IImplicitVertexSet<TVertex>.ContainsVertex(TVertex)
Namespace: QuikGraph
Assembly: QuikGraph.dll
Syntax
public interface IMutableUndirectedGraph<TVertex, TEdge> : IUndirectedGraph<TVertex, TEdge>, IImplicitUndirectedGraph<TVertex, TEdge>, IMutableVertexAndEdgeSet<TVertex, TEdge>, IMutableVertexSet<TVertex>, IMutableEdgeListGraph<TVertex, TEdge>, IMutableGraph<TVertex, TEdge>, IEdgeListGraph<TVertex, TEdge>, IGraph<TVertex, TEdge>, IEdgeSet<TVertex, TEdge>, IVertexSet<TVertex>, IImplicitVertexSet<TVertex> where TEdge : IEdge<TVertex>
Type Parameters
Name Description
TVertex

Vertex type.

TEdge

Edge type.

Methods

| Improve this Doc View Source

ClearAdjacentEdges(TVertex)

Clears adjacent edges of the given vertex.

Declaration
void ClearAdjacentEdges(TVertex vertex)
Parameters
Type Name Description
TVertex vertex

The vertex.

Exceptions
Type Condition
System.ArgumentNullException

vertex is null.

| Improve this Doc View Source

RemoveAdjacentEdgeIf(TVertex, EdgePredicate<TVertex, TEdge>)

Removes adjacent edges of the given vertex if edge matches the predicate.

Declaration
int RemoveAdjacentEdgeIf(TVertex vertex, EdgePredicate<TVertex, TEdge> predicate)
Parameters
Type Name Description
TVertex vertex

The vertex.

EdgePredicate<TVertex, TEdge> predicate

Predicate to match edges.

Returns
Type Description
System.Int32

The number of removed edges.

Exceptions
Type Condition
System.ArgumentNullException

vertex is null.

System.ArgumentNullException

predicate is null.

Extension Methods

GraphMLExtensions.SerializeToGraphML<TVertex, TEdge, TGraph>(TGraph, String)
GraphMLExtensions.SerializeToGraphML<TVertex, TEdge, TGraph>(TGraph, String, VertexIdentity<TVertex>, EdgeIdentity<TVertex, TEdge>)
GraphMLExtensions.SerializeToGraphML<TVertex, TEdge, TGraph>(TGraph, XmlWriter)
GraphMLExtensions.SerializeToGraphML<TVertex, TEdge, TGraph>(TGraph, XmlWriter, VertexIdentity<TVertex>, EdgeIdentity<TVertex, TEdge>)
GraphMLExtensions.DeserializeFromGraphML<TVertex, TEdge, TGraph>(TGraph, XmlReader, IdentifiableVertexFactory<TVertex>, IdentifiableEdgeFactory<TVertex, TEdge>)
GraphMLExtensions.DeserializeFromGraphML<TVertex, TEdge, TGraph>(TGraph, TextReader, IdentifiableVertexFactory<TVertex>, IdentifiableEdgeFactory<TVertex, TEdge>)
GraphMLExtensions.DeserializeFromGraphML<TVertex, TEdge, TGraph>(TGraph, String, IdentifiableVertexFactory<TVertex>, IdentifiableEdgeFactory<TVertex, TEdge>)
GraphMLExtensions.DeserializeAndValidateFromGraphML<TVertex, TEdge, TGraph>(TGraph, TextReader, IdentifiableVertexFactory<TVertex>, IdentifiableEdgeFactory<TVertex, TEdge>)
SerializationExtensions.SerializeToBinary<TVertex, TEdge>(IGraph<TVertex, TEdge>, Stream)
SerializationExtensions.SerializeToXml<TVertex, TEdge, TGraph>(TGraph, XmlWriter, VertexIdentity<TVertex>, EdgeIdentity<TVertex, TEdge>, String, String, String, String)
SerializationExtensions.SerializeToXml<TVertex, TEdge, TGraph>(TGraph, XmlWriter, VertexIdentity<TVertex>, EdgeIdentity<TVertex, TEdge>, String, String, String, String, Action<XmlWriter, TGraph>, Action<XmlWriter, TVertex>, Action<XmlWriter, TEdge>)
GraphExtensions.ToBidirectionalGraph<TVertex, TEdge>(IUndirectedGraph<TVertex, TEdge>)
GraphExtensions.ToArrayUndirectedGraph<TVertex, TEdge>(IUndirectedGraph<TVertex, TEdge>)
AlgorithmExtensions.GetVertexIdentity<TVertex>(IVertexSet<TVertex>)
AlgorithmExtensions.GetEdgeIdentity<TVertex, TEdge>(IEdgeSet<TVertex, TEdge>)
AlgorithmExtensions.ShortestPathsDijkstra<TVertex, TEdge>(IUndirectedGraph<TVertex, TEdge>, Func<TEdge, Double>, TVertex)
AlgorithmExtensions.TopologicalSort<TVertex, TEdge>(IUndirectedGraph<TVertex, TEdge>)
AlgorithmExtensions.SourceFirstTopologicalSort<TVertex, TEdge>(IUndirectedGraph<TVertex, TEdge>)
AlgorithmExtensions.ConnectedComponents<TVertex, TEdge>(IUndirectedGraph<TVertex, TEdge>, IDictionary<TVertex, Int32>)
AlgorithmExtensions.IncrementalConnectedComponents<TVertex, TEdge>(IMutableVertexAndEdgeSet<TVertex, TEdge>, out Func<KeyValuePair<Int32, IDictionary<TVertex, Int32>>>)
AlgorithmExtensions.IsUndirectedAcyclicGraph<TVertex, TEdge>(IUndirectedGraph<TVertex, TEdge>)
AlgorithmExtensions.ComputeDisjointSet<TVertex, TEdge>(IUndirectedGraph<TVertex, TEdge>)
AlgorithmExtensions.MinimumSpanningTreePrim<TVertex, TEdge>(IUndirectedGraph<TVertex, TEdge>, Func<TEdge, Double>)
AlgorithmExtensions.MinimumSpanningTreeKruskal<TVertex, TEdge>(IUndirectedGraph<TVertex, TEdge>, Func<TEdge, Double>)
AlgorithmExtensions.ComputeTransitiveReduction<TVertex, TEdge>(IEdgeListGraph<TVertex, TEdge>)
AlgorithmExtensions.ComputeTransitiveClosure<TVertex, TEdge>(IEdgeListGraph<TVertex, TEdge>, Func<TVertex, TVertex, TEdge>)
GraphvizExtensions.ToGraphviz<TVertex, TEdge>(IEdgeListGraph<TVertex, TEdge>)
GraphvizExtensions.ToGraphviz<TVertex, TEdge>(IEdgeListGraph<TVertex, TEdge>, Action<GraphvizAlgorithm<TVertex, TEdge>>)
GraphvizExtensions.ToSvg<TVertex, TEdge>(IEdgeListGraph<TVertex, TEdge>)
GraphvizExtensions.ToSvg<TVertex, TEdge>(IEdgeListGraph<TVertex, TEdge>, Action<GraphvizAlgorithm<TVertex, TEdge>>)
MsaglGraphExtensions.CreateMsaglPopulator<TVertex, TEdge>(IEdgeListGraph<TVertex, TEdge>)
MsaglGraphExtensions.CreateMsaglPopulator<TVertex, TEdge>(IEdgeListGraph<TVertex, TEdge>, String, IFormatProvider)
MsaglGraphExtensions.CreateMsaglPopulator<TVertex, TEdge>(IEdgeListGraph<TVertex, TEdge>, VertexIdentity<TVertex>)
MsaglGraphExtensions.ToMsaglGraph<TVertex, TEdge>(IEdgeListGraph<TVertex, TEdge>, MsaglVertexNodeEventHandler<TVertex>, MsaglEdgeEventHandler<TVertex, TEdge>)
MsaglGraphExtensions.ToMsaglGraph<TVertex, TEdge>(IEdgeListGraph<TVertex, TEdge>, VertexIdentity<TVertex>, MsaglVertexNodeEventHandler<TVertex>, MsaglEdgeEventHandler<TVertex, TEdge>)
  • Improve this Doc
  • View Source
In This Article
Back to top QuikGraph