We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent b18b439 commit c4dda39Copy full SHA for c4dda39
DataStructures/Graphs/CliqueGraph.cs
@@ -6,7 +6,7 @@
6
namespace DataStructures.Graphs
7
{
8
/// <summary>
9
- /// Represents a unweighted underected graph, modeling with a set of its maximal complete subgraphs of it.
+ /// Represents an unweighted undirected graph, modeling with a set of its maximal complete subgraphs of it.
10
/// Should be fast in clustered graphs
11
/// </summary>
12
public class CliqueGraph<T> : IGraph<T> where T : IComparable<T>, IEquatable<T>
@@ -848,4 +848,4 @@ bool IEquatable<UnordererPair<T>>.Equals(UnordererPair<T> other)
848
#endregion
849
}
850
851
-}
+}
0 commit comments