Arborescence.Primitives
0.3.0
See the version list below for details.
dotnet add package Arborescence.Primitives --version 0.3.0
NuGet\Install-Package Arborescence.Primitives -Version 0.3.0
<PackageReference Include="Arborescence.Primitives" Version="0.3.0" />
paket add Arborescence.Primitives --version 0.3.0
#r "nuget: Arborescence.Primitives, 0.3.0"
// Install Arborescence.Primitives as a Cake Addin #addin nuget:?package=Arborescence.Primitives&version=0.3.0 // Install Arborescence.Primitives as a Cake Tool #tool nuget:?package=Arborescence.Primitives&version=0.3.0
Basic blocks for building algorithms and data structures.
Commonly used types:
• Endpoints
• ArrayPrefix<T>
• ArraySegmentEnumerator<T>
Product | Versions Compatible and additional computed target framework versions. |
---|---|
.NET | net5.0 was computed. net5.0-windows was computed. net6.0 was computed. net6.0-android was computed. net6.0-ios was computed. net6.0-maccatalyst was computed. net6.0-macos was computed. net6.0-tvos was computed. net6.0-windows was computed. net7.0 was computed. net7.0-android was computed. net7.0-ios was computed. net7.0-maccatalyst was computed. net7.0-macos was computed. net7.0-tvos was computed. net7.0-windows was computed. net8.0 was computed. net8.0-android was computed. net8.0-browser was computed. net8.0-ios was computed. net8.0-maccatalyst was computed. net8.0-macos was computed. net8.0-tvos was computed. net8.0-windows was computed. |
.NET Core | netcoreapp1.0 was computed. netcoreapp1.1 was computed. netcoreapp2.0 was computed. netcoreapp2.1 was computed. netcoreapp2.2 was computed. netcoreapp3.0 was computed. netcoreapp3.1 was computed. |
.NET Standard | netstandard1.3 is compatible. netstandard1.4 was computed. netstandard1.5 was computed. netstandard1.6 was computed. netstandard2.0 is compatible. netstandard2.1 is compatible. |
.NET Framework | net46 was computed. net461 is compatible. net462 was computed. net463 was computed. net47 was computed. net471 was computed. net472 was computed. net48 was computed. net481 was computed. |
MonoAndroid | monoandroid was computed. |
MonoMac | monomac was computed. |
MonoTouch | monotouch was computed. |
Tizen | tizen30 was computed. tizen40 was computed. tizen60 was computed. |
Universal Windows Platform | uap was computed. uap10.0 was computed. |
Xamarin.iOS | xamarinios was computed. |
Xamarin.Mac | xamarinmac was computed. |
Xamarin.TVOS | xamarintvos was computed. |
Xamarin.WatchOS | xamarinwatchos was computed. |
-
.NETFramework 4.6.1
- No dependencies.
-
.NETStandard 1.3
- No dependencies.
-
.NETStandard 2.0
- No dependencies.
-
.NETStandard 2.1
- No dependencies.
NuGet packages (5)
Showing the top 5 NuGet packages that depend on Arborescence.Primitives:
Package | Downloads |
---|---|
Arborescence.Traversal
Graph traversal algorithms: BFS, DFS. Commonly used types: • Adjacency.EnumerableBfs<TVertex, TNeighborEnumerator> • Adjacency.EnumerableDfs<TVertex, TNeighborEnumerator> • Adjacency.EnumerableGenericSearch<TVertex, TNeighborEnumerator> • Adjacency.EagerBfs<TVertex, TNeighborEnumerator> • Adjacency.EagerDfs<TVertex, TNeighborEnumerator> • Incidence.EnumerableBfs<TVertex, TEdge, TEdgeEnumerator> • Incidence.EnumerableDfs<TVertex, TEdge, TEdgeEnumerator> • Incidence.EnumerableGenericSearch<TVertex, TEdge, TEdgeEnumerator> • Incidence.EagerBfs<TVertex, TEdge, TEdgeEnumerator> • Incidence.EagerDfs<TVertex, TEdge, TEdgeEnumerator> |
|
Arborescence.Models
Data structures that provide a generic implementation of graph interfaces and collection concepts. Commonly used types: • AdditiveMonoid<T> • AdjacencyEnumerator<TVertex, TEdge, TGraph, TEdgeEnumerator> • IncidenceEnumerator<TVertex, TNeighborEnumerator> • ListAdjacencyGraph<TVertex, TVertexMultimap> • ListIncidenceGraph<TVertex, TEdge, …> • ListEnumeratorProvider<T> |
|
Arborescence.Primitives.Specialized
Basic blocks for building algorithms and data structures. Commonly used types: • Int32ColorDictionary • Int32Dictionary<TValue, TValueList> • Int32ReadOnlyDictionary<TValue, TValueList> • Int32Set |
|
Arborescence.Traversal.Specialized
Graph traversal algorithms specialized for integer vertices from a contiguous range. Commonly used types: • Adjacency.EnumerableBfs<TNeighborEnumerator> • Adjacency.EnumerableDfs<TNeighborEnumerator> • Adjacency.EnumerableGenericSearch<TNeighborEnumerator> • Adjacency.EagerBfs<TNeighborEnumerator> • Adjacency.EagerDfs<TNeighborEnumerator> • Incidence.EnumerableBfs<TEdge, TEdgeEnumerator> • Incidence.EnumerableDfs<TEdge, TEdgeEnumerator> • Incidence.EnumerableGenericSearch<TEdge, TEdgeEnumerator> • Incidence.EagerBfs<TEdge, TEdgeEnumerator> • Incidence.EagerDfs<TEdge, TEdgeEnumerator> |
|
Arborescence.Search
Graph search algorithms: Dijkstra. Commonly used types: - Adjacency.AdditiveEnumerableDijkstra<TVertex, TWeight> - Adjacency.AdditiveEnumerableDijkstra<TVertex, TNeighborEnumerator, TWeight> - Adjacency.EnumerableDijkstra<TVertex, TWeight> - Adjacency.EnumerableDijkstra<TVertex, TNeighborEnumerator, TWeight> |
GitHub repositories
This package is not used by any popular GitHub repositories.
Version | Downloads | Last updated |
---|---|---|
0.17.0 | 602 | 1/11/2024 |
0.16.5 | 544 | 1/7/2024 |
0.16.4 | 555 | 1/2/2024 |
0.16.2 | 982 | 7/27/2023 |
0.16.0 | 760 | 6/4/2023 |
0.15.0 | 495 | 1/17/2023 |
0.14.0 | 650 | 1/7/2023 |
0.13.1 | 584 | 7/6/2021 |
0.13.0 | 577 | 6/27/2021 |
0.12.0 | 368 | 6/9/2021 |
0.11.0 | 633 | 5/30/2021 |
0.10.0 | 599 | 5/29/2021 |
0.9.0 | 589 | 1/15/2021 |
0.7.1 | 849 | 12/26/2020 |
0.7.0 | 731 | 12/25/2020 |
0.6.0 | 671 | 11/9/2020 |
0.4.0 | 1,320 | 9/23/2020 |
0.3.0 | 1,145 | 7/30/2020 |
0.1.1 | 889 | 7/7/2020 |