Code:
/ Net / Net / 3.5.50727.3053 / DEVDIV / depot / DevDiv / releases / Orcas / SP / ndp / fx / src / DataEntity / System / Data / Map / Update / Internal / UndirectedGraph.cs / 1 / 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
- DependencySource.cs
- Part.cs
- AssociationSetMetadata.cs
- HostingEnvironment.cs
- XmlSchemaSubstitutionGroup.cs
- ToolBarPanel.cs
- ProcessProtocolHandler.cs
- ListViewPagedDataSource.cs
- QilInvoke.cs
- JsonFormatGeneratorStatics.cs
- ConsoleCancelEventArgs.cs
- URLIdentityPermission.cs
- FrameworkContentElementAutomationPeer.cs
- ControlValuePropertyAttribute.cs
- HashRepartitionStream.cs
- SchemaMerger.cs
- ButtonFieldBase.cs
- ZoneButton.cs
- SmtpAuthenticationManager.cs
- XmlnsCache.cs
- CatalogZoneAutoFormat.cs
- WebEventTraceProvider.cs
- DataTemplateSelector.cs
- Label.cs
- InvokeFunc.cs
- UseLicense.cs
- TripleDESCryptoServiceProvider.cs
- OneOfConst.cs
- MetadataSource.cs
- SpellerStatusTable.cs
- DataGridViewIntLinkedList.cs
- AxisAngleRotation3D.cs
- DataRowChangeEvent.cs
- DesignSurface.cs
- PointCollectionValueSerializer.cs
- DPCustomTypeDescriptor.cs
- RMPublishingDialog.cs
- CachedFontFamily.cs
- FixedSOMTable.cs
- DataPagerCommandEventArgs.cs
- XhtmlMobileTextWriter.cs
- TextLineBreak.cs
- WebProxyScriptElement.cs
- OdbcEnvironment.cs
- MultiTrigger.cs
- ExpressionBinding.cs
- ViewKeyConstraint.cs
- parserscommon.cs
- CodeExpressionStatement.cs
- NotCondition.cs
- TcpClientChannel.cs
- ThreadStaticAttribute.cs
- SolidBrush.cs
- OracleDataReader.cs
- DatatypeImplementation.cs
- FormatPage.cs
- PropertyInformationCollection.cs
- PeerApplication.cs
- QilLoop.cs
- PageThemeParser.cs
- RegexCode.cs
- SHA256.cs
- FileUpload.cs
- ObsoleteAttribute.cs
- HttpRequest.cs
- HttpSessionStateBase.cs
- ProcessHostFactoryHelper.cs
- SingleStorage.cs
- VSWCFServiceContractGenerator.cs
- CustomErrorsSection.cs
- InitializerFacet.cs
- ZipIOLocalFileBlock.cs
- CRYPTPROTECT_PROMPTSTRUCT.cs
- CharacterMetricsDictionary.cs
- BoundColumn.cs
- RegexCaptureCollection.cs
- ChildrenQuery.cs
- EntityDesignerUtils.cs
- ServiceHostingEnvironment.cs
- FixedTextPointer.cs
- CoreChannel.cs
- SingleConverter.cs
- TextParagraphCache.cs
- NodeFunctions.cs
- DirtyTextRange.cs
- RefreshResponseInfo.cs
- PlaceHolder.cs
- DataGridClipboardHelper.cs
- BamlLocalizabilityResolver.cs
- Random.cs
- RegionInfo.cs
- CommonGetThemePartSize.cs
- ContractNamespaceAttribute.cs
- IsolationInterop.cs
- SelectionItemProviderWrapper.cs
- Point4D.cs
- ImmComposition.cs
- LayoutDump.cs
- WindowsSolidBrush.cs
- TypeGenericEnumerableViewSchema.cs