1-10 of 81 < Previous Next >
3 votes
closed

Implement INotifyCollectionChanged where applicable.

Hi, Im looking for advise or suggestion. I need to fill a WPF TreeView from modified GeneralTree. General tree could be modified like this: public interface INavigatorCollectionItem { } ...

id# 9143 | Planned Release: 1.3 Beta | Last Updated: Today at 7:28 AM  by rhanekom
2 votes
closed

make Listbase.IsReadOnly and ListBase.IsFixedSize public so children do not have to re-implement them

make Listbase.IsReadOnly and ListBase.IsFixedSize public so children do not have to re-implement them

id# 16760 | Planned Release: 1.3 Beta | Last Updated: Today at 7:28 AM  by rhanekom
3 votes

FibonacciHeap<T> implementation

An implementation of a Fibonacci Heap. Possibly move the Priority Queue over to a Fibonacci Heap (some timing tests require for decision).

id# 6840 | Planned Release: None | Last Updated: Aug 25 at 5:04 PM  by andrei1089
4 votes

AVL Search Tree

Implementation of an AVL Search tree.

id# 9400 | Planned Release: 1.4 Alpha | Last Updated: Aug 25 at 5:03 PM  by andrei1089
2 votes
closed

Add GeneralTree<T>FindNode() method from patch

Hi, in the patch section you can find a small patch for the general tree. It introduces a new FindNode() method. The new (additional!) FindNode() accepts a generic comparison value and a matching ...

id# 11529 | Planned Release: 1.3 Beta | Last Updated: Jul 7 at 5:19 AM  by rhanekom
2 votes
closed

change GetEnumerator() and MoveNext() calls to foreach loops where applicable.

change GetEnumerator() and MoveNext() calls to foreach loops where applicable. GeneralTree<T> public void Accept(IVisitor<T> visitor); BinarySearchTreeBase<TKey, TValue> public void Accept(IVisi...

id# 15707 | Planned Release: 1.3 Beta | Last Updated: Jul 7 at 5:16 AM  by rhanekom
2 votes
closed

Matrix - Gaussian Elimination

Gaussian Elimination algorithm for the mathematical matrix. See http://en.wikipedia.org/wiki/Gaussian_elimination.

id# 11688 | Planned Release: 1.3 Beta | Last Updated: Jul 7 at 5:15 AM  by rhanekom
2 votes
closed

Optimize peek and pop on VisitableStack and add collection push methods

extension public void Push(IEnumerable<T> collection) { data.AddRange(collection); } public void Push(params T[] args) { Push(args); }

id# 15708 | Planned Release: 1.3 Beta | Last Updated: Jul 7 at 5:15 AM  by rhanekom
1 vote
closed

RedBlackTree Bug - Corruption

Hi, I've found that the NGeneric red black tree implementation has a bug. The bug results in tree corruption. I have attached some code that demonstrates the problem: /// This red black tree st...

id# 13944 | Planned Release: 1.3 Alpha | Last Updated: Jul 7 at 5:15 AM  by rhanekom
2 votes
closed

Calculation of Matrix Rank

See http://en.wikipedia.org/wiki/Rank_(linear_algebra).

id# 11689 | Planned Release: 1.3 Beta | Last Updated: Jul 6 at 10:29 PM  by SimonCropp

Configure View

Search
Sort by Id
Release
Title
Updated
Votes
1-10 of 81 < Previous 1 2 3 4 5 6 7 8 9 Next >
Updating...