Code:
/ Dotnetfx_Vista_SP2 / Dotnetfx_Vista_SP2 / 8.0.50727.4016 / DEVDIV / depot / DevDiv / releases / Orcas / QFE / 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
- InputLanguageSource.cs
- UIElementPropertyUndoUnit.cs
- SrgsSubset.cs
- XmlILAnnotation.cs
- ProfileBuildProvider.cs
- Latin1Encoding.cs
- ScriptResourceMapping.cs
- ConfigXmlComment.cs
- DbTransaction.cs
- TextBoxRenderer.cs
- StoryFragments.cs
- BamlLocalizer.cs
- AdornerHitTestResult.cs
- CustomAttribute.cs
- DataGridViewAccessibleObject.cs
- ExternalDataExchangeService.cs
- Token.cs
- DynamicResourceExtensionConverter.cs
- VoiceSynthesis.cs
- FunctionDetailsReader.cs
- StringSource.cs
- Ports.cs
- SingleStorage.cs
- BitmapFrame.cs
- ContentHostHelper.cs
- SqlBinder.cs
- CommandValueSerializer.cs
- HtmlInputFile.cs
- XmlSchemaParticle.cs
- Roles.cs
- CredentialSelector.cs
- DataServiceQueryProvider.cs
- DoubleAnimationUsingKeyFrames.cs
- ContractReference.cs
- SocketStream.cs
- HtmlInputButton.cs
- ActivityCodeDomSerializer.cs
- _FixedSizeReader.cs
- RoutedCommand.cs
- BoolExpressionVisitors.cs
- BaseTemplatedMobileComponentEditor.cs
- TextTreeDeleteContentUndoUnit.cs
- GridEntry.cs
- BindingUtils.cs
- GeneralTransformGroup.cs
- StoreItemCollection.cs
- WebPartConnectionCollection.cs
- XDRSchema.cs
- EntityContainer.cs
- SchemaCollectionCompiler.cs
- WindowsSpinner.cs
- AddToCollection.cs
- GlyphRun.cs
- Resources.Designer.cs
- XmlSchemaComplexContentExtension.cs
- LoginUtil.cs
- SqlReorderer.cs
- NamespaceTable.cs
- ToolboxDataAttribute.cs
- DataControlFieldHeaderCell.cs
- MenuItemCollection.cs
- SessionState.cs
- DbConnectionStringBuilder.cs
- GridItemPattern.cs
- DataGridTextBox.cs
- IdentitySection.cs
- AudioStateChangedEventArgs.cs
- figurelengthconverter.cs
- XmlHierarchicalEnumerable.cs
- XmlSchemaImport.cs
- SessionParameter.cs
- LingerOption.cs
- HuffModule.cs
- CheckableControlBaseAdapter.cs
- TextProperties.cs
- CodeGeneratorAttribute.cs
- Configuration.cs
- DWriteFactory.cs
- DataRecord.cs
- SafeNativeMethods.cs
- TransformedBitmap.cs
- ContentHostHelper.cs
- KnowledgeBase.cs
- OleDbRowUpdatingEvent.cs
- _SafeNetHandles.cs
- AccessibleObject.cs
- EmbeddedMailObject.cs
- RectAnimationUsingKeyFrames.cs
- StrongNameMembershipCondition.cs
- MetabaseServerConfig.cs
- VirtualPathData.cs
- Membership.cs
- ToolStripRenderEventArgs.cs
- WebBodyFormatMessageProperty.cs
- ExpressionNormalizer.cs
- MimeXmlImporter.cs
- CompModSwitches.cs
- FormViewAutoFormat.cs
- PeerNameResolver.cs
- MsdtcWrapper.cs