Code:
/ 4.0 / 4.0 / DEVDIV_TFS / Dev10 / Releases / RTMRel / ndp / fx / src / DataEntity / System / Data / Map / Update / Internal / UndirectedGraph.cs / 1305376 / UndirectedGraph.cs
//---------------------------------------------------------------------- //// Copyright (c) Microsoft Corporation. All rights reserved. // // // @owner [....] // @backupOwner [....] //--------------------------------------------------------------------- using System.Data.Common.Utils; using System.Collections.Generic; using System.Text; namespace System.Data.Mapping.Update.Internal { // Maintains a graph where the direction of the edges is not important class UndirectedGraph: InternalBase { #region Constructor internal UndirectedGraph(IEqualityComparer comparer) { m_graph = new Graph (comparer); m_comparer = comparer; } #endregion #region Fields private Graph m_graph; // Directed graph where we added both edges private IEqualityComparer m_comparer; #endregion #region Properties internal IEnumerable Vertices { get { return m_graph.Vertices; } } /// /// Returns the edges of the graph /// internal IEnumerable> Edges { get { return m_graph.Edges; } } #endregion #region Methods // effects: Adds a new node to the graph. Does nothing if the vertex already exists. internal void AddVertex(TVertex vertex) { m_graph.AddVertex(vertex); } // requires: first and second must exist. An edge between first and // second must not already exist // effects: Adds a new unidirectional edge to the graph. internal void AddEdge(TVertex first, TVertex second) { m_graph.AddEdge(first, second); m_graph.AddEdge(second, first); } // effects: Given a graph of T, returns a map such that nodes in the // same connected component are in the same list in the KeyToListMap internal KeyToListMap GenerateConnectedComponents() { int count = 0; // Set the "component number" for each node Dictionary componentMap = new Dictionary (m_comparer); foreach (TVertex vertex in Vertices) { componentMap.Add(vertex, new ComponentNum(count)); count++; } // Run the connected components algorithm (Page 441 of the CLR -- Cormen, Rivest, Lieserson) foreach (KeyValuePair edge in Edges) { if (componentMap[edge.Key].componentNum != componentMap[edge.Value].componentNum) { // Set the component numbers of both of the nodes to be the same int oldValue = componentMap[edge.Value].componentNum; int newValue = componentMap[edge.Key].componentNum; componentMap[edge.Value].componentNum = newValue; // Since we are resetting edge.Value's component number, find all components whose value // is oldValue and reset it to the new value foreach (TVertex vertex in componentMap.Keys) { if (componentMap[vertex].componentNum == oldValue) { componentMap[vertex].componentNum = newValue; } } } } // Now just grab the vertices which have the same set numbers KeyToListMap result = new KeyToListMap (EqualityComparer .Default); foreach (TVertex vertex in Vertices) { int componentNum = componentMap[vertex].componentNum; result.Add(componentNum, vertex); } return result; } internal override void ToCompactString(StringBuilder builder) { builder.Append(m_graph.ToString()); } // A class just for ensuring that we do not modify the hash table // while iterating over it. Keeps track of the component number for a // connected component private class ComponentNum { internal ComponentNum(int compNum) { componentNum = compNum; } internal int componentNum; public override string ToString() { return StringUtil.FormatInvariant("{0}", componentNum); } }; #endregion } } // File provided for Reference Use Only by Microsoft Corporation (c) 2007. //---------------------------------------------------------------------- // // Copyright (c) Microsoft Corporation. All rights reserved. // // // @owner [....] // @backupOwner [....] //--------------------------------------------------------------------- using System.Data.Common.Utils; using System.Collections.Generic; using System.Text; namespace System.Data.Mapping.Update.Internal { // Maintains a graph where the direction of the edges is not important class UndirectedGraph: InternalBase { #region Constructor internal UndirectedGraph(IEqualityComparer comparer) { m_graph = new Graph (comparer); m_comparer = comparer; } #endregion #region Fields private Graph m_graph; // Directed graph where we added both edges private IEqualityComparer m_comparer; #endregion #region Properties internal IEnumerable Vertices { get { return m_graph.Vertices; } } /// /// Returns the edges of the graph /// internal IEnumerable> Edges { get { return m_graph.Edges; } } #endregion #region Methods // effects: Adds a new node to the graph. Does nothing if the vertex already exists. internal void AddVertex(TVertex vertex) { m_graph.AddVertex(vertex); } // requires: first and second must exist. An edge between first and // second must not already exist // effects: Adds a new unidirectional edge to the graph. internal void AddEdge(TVertex first, TVertex second) { m_graph.AddEdge(first, second); m_graph.AddEdge(second, first); } // effects: Given a graph of T, returns a map such that nodes in the // same connected component are in the same list in the KeyToListMap internal KeyToListMap GenerateConnectedComponents() { int count = 0; // Set the "component number" for each node Dictionary componentMap = new Dictionary (m_comparer); foreach (TVertex vertex in Vertices) { componentMap.Add(vertex, new ComponentNum(count)); count++; } // Run the connected components algorithm (Page 441 of the CLR -- Cormen, Rivest, Lieserson) foreach (KeyValuePair edge in Edges) { if (componentMap[edge.Key].componentNum != componentMap[edge.Value].componentNum) { // Set the component numbers of both of the nodes to be the same int oldValue = componentMap[edge.Value].componentNum; int newValue = componentMap[edge.Key].componentNum; componentMap[edge.Value].componentNum = newValue; // Since we are resetting edge.Value's component number, find all components whose value // is oldValue and reset it to the new value foreach (TVertex vertex in componentMap.Keys) { if (componentMap[vertex].componentNum == oldValue) { componentMap[vertex].componentNum = newValue; } } } } // Now just grab the vertices which have the same set numbers KeyToListMap result = new KeyToListMap (EqualityComparer .Default); foreach (TVertex vertex in Vertices) { int componentNum = componentMap[vertex].componentNum; result.Add(componentNum, vertex); } return result; } internal override void ToCompactString(StringBuilder builder) { builder.Append(m_graph.ToString()); } // A class just for ensuring that we do not modify the hash table // while iterating over it. Keeps track of the component number for a // connected component private class ComponentNum { internal ComponentNum(int compNum) { componentNum = compNum; } internal int componentNum; public override string ToString() { return StringUtil.FormatInvariant("{0}", componentNum); } }; #endregion } } // File provided for Reference Use Only by Microsoft Corporation (c) 2007.
Link Menu
This book is available now!
Buy at Amazon US or
Buy at Amazon UK
- OleDbException.cs
- PerfCounters.cs
- LayoutSettings.cs
- UiaCoreProviderApi.cs
- TextOnlyOutput.cs
- EventMappingSettings.cs
- ResourceContainer.cs
- TimelineGroup.cs
- IncomingWebResponseContext.cs
- ScrollBarAutomationPeer.cs
- DocumentOrderQuery.cs
- Panel.cs
- SoapIgnoreAttribute.cs
- MultiBindingExpression.cs
- GPRECTF.cs
- DbException.cs
- SqlDuplicator.cs
- StateValidator.cs
- SatelliteContractVersionAttribute.cs
- XmlNodeChangedEventManager.cs
- ToolStrip.cs
- NullRuntimeConfig.cs
- DataServiceProcessingPipeline.cs
- XmlCustomFormatter.cs
- OleDragDropHandler.cs
- FunctionParameter.cs
- Graph.cs
- TranslateTransform3D.cs
- ForEachAction.cs
- WindowsGraphicsWrapper.cs
- ThreadBehavior.cs
- DataSourceCollectionBase.cs
- RecognizeCompletedEventArgs.cs
- SoapInteropTypes.cs
- DependencyObjectType.cs
- FormattedTextSymbols.cs
- FacetValueContainer.cs
- DbConnectionStringBuilder.cs
- NativeMethods.cs
- SelectionEditingBehavior.cs
- _LocalDataStore.cs
- dtdvalidator.cs
- RoutingConfiguration.cs
- CalendarButtonAutomationPeer.cs
- ResolveNextArgumentWorkItem.cs
- ToolStripItemRenderEventArgs.cs
- DeploymentSectionCache.cs
- SchemaType.cs
- ElementsClipboardData.cs
- DataGridViewMethods.cs
- ConnectionsZone.cs
- MediaTimeline.cs
- HttpPostedFile.cs
- AssemblyBuilder.cs
- AxHost.cs
- BaseResourcesBuildProvider.cs
- AutomationIdentifier.cs
- SimpleWebHandlerParser.cs
- CodeParameterDeclarationExpressionCollection.cs
- TypeSystem.cs
- SByte.cs
- SvcMapFile.cs
- _NTAuthentication.cs
- XD.cs
- PackUriHelper.cs
- BitmapDownload.cs
- HtmlDocument.cs
- OracleBinary.cs
- Utils.cs
- DomainLiteralReader.cs
- DelimitedListTraceListener.cs
- GroupBoxRenderer.cs
- TextEffect.cs
- DataGrid.cs
- XmlNodeComparer.cs
- ExpressionDumper.cs
- ListViewGroupItemCollection.cs
- ManagedFilter.cs
- CollectionMarkupSerializer.cs
- AsymmetricKeyExchangeDeformatter.cs
- OleDbDataAdapter.cs
- TreeViewImageGenerator.cs
- AnimatedTypeHelpers.cs
- DataGridViewAutoSizeColumnModeEventArgs.cs
- autovalidator.cs
- Visual3DCollection.cs
- StringPropertyBuilder.cs
- TemplatedAdorner.cs
- StatusBarPanel.cs
- translator.cs
- StaticTextPointer.cs
- SqlServer2KCompatibilityCheck.cs
- XsdDateTime.cs
- DefaultMemberAttribute.cs
- ByteStack.cs
- Geometry3D.cs
- ClientApiGenerator.cs
- PackageFilter.cs
- ListItemDetailViewAttribute.cs
- PasswordTextContainer.cs