Code:
/ Dotnetfx_Win7_3.5.1 / Dotnetfx_Win7_3.5.1 / 3.5.1 / DEVDIV / depot / DevDiv / releases / Orcas / NetFXw7 / 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
- MsmqIntegrationSecurityMode.cs
- PatternMatcher.cs
- DateBoldEvent.cs
- PreviewKeyDownEventArgs.cs
- TextPointer.cs
- MessagePropertyDescription.cs
- SudsCommon.cs
- ConfigXmlText.cs
- LicenseManager.cs
- ExportOptions.cs
- FileRecordSequence.cs
- SystemWebExtensionsSectionGroup.cs
- PhysicalAddress.cs
- ContentPlaceHolder.cs
- UnsafeNativeMethods.cs
- TempFiles.cs
- MasterPage.cs
- ListControl.cs
- DeploymentSection.cs
- WindowCollection.cs
- QilTernary.cs
- CodeParameterDeclarationExpressionCollection.cs
- ObjectConverter.cs
- StorageScalarPropertyMapping.cs
- ButtonChrome.cs
- QueryOptionExpression.cs
- safelinkcollection.cs
- LinkArea.cs
- ExpressionTable.cs
- ValueUtilsSmi.cs
- SqlTypeConverter.cs
- MouseButton.cs
- XmlWriter.cs
- DSASignatureFormatter.cs
- ToolStripManager.cs
- Int32Rect.cs
- DynamicDocumentPaginator.cs
- BinaryConverter.cs
- webbrowsersite.cs
- StringDictionary.cs
- ScriptResourceHandler.cs
- ModuleElement.cs
- TemplateColumn.cs
- PersonalizationAdministration.cs
- DateRangeEvent.cs
- LongSumAggregationOperator.cs
- MarkupCompilePass2.cs
- DataGridViewColumn.cs
- JumpTask.cs
- ExtenderProviderService.cs
- ComponentResourceKey.cs
- _ContextAwareResult.cs
- ToolStripItemTextRenderEventArgs.cs
- MsmqProcessProtocolHandler.cs
- Range.cs
- ConditionalExpression.cs
- XmlSchemaNotation.cs
- M3DUtil.cs
- EncoderBestFitFallback.cs
- DocumentSchemaValidator.cs
- XamlFigureLengthSerializer.cs
- EdmMember.cs
- MimeObjectFactory.cs
- Helpers.cs
- ConfigXmlDocument.cs
- PersonalizationStateInfo.cs
- XmlReaderDelegator.cs
- ElementAtQueryOperator.cs
- CellPartitioner.cs
- GC.cs
- TableLayoutPanelResizeGlyph.cs
- CodeTypeParameterCollection.cs
- DataTableClearEvent.cs
- xmlsaver.cs
- MimeMultiPart.cs
- IImplicitResourceProvider.cs
- FrameworkTemplate.cs
- WeakReferenceEnumerator.cs
- HttpConfigurationContext.cs
- Transform.cs
- wmiprovider.cs
- X509Extension.cs
- ConfigurationException.cs
- KeyManager.cs
- ResourcePermissionBase.cs
- WMIGenerator.cs
- Win32PrintDialog.cs
- NameNode.cs
- DbConnectionOptions.cs
- WeakEventManager.cs
- CrossSiteScriptingValidation.cs
- TextBlockAutomationPeer.cs
- XmlComment.cs
- Configuration.cs
- GeometryHitTestParameters.cs
- HeaderPanel.cs
- WebPartDeleteVerb.cs
- WebPartDescriptionCollection.cs
- GridViewPageEventArgs.cs
- NavigateEvent.cs