From Friday, April 19th (11:00 PM CDT) through Saturday, April 20th (2:00 PM CDT), 2024, ni.com will undergo system upgrades that may result in temporary service interruption.

We appreciate your patience as we improve our online experience.

Algorithms after Dijkstra and Kruskal for Big Data and IoT Toolkit

Ovak Technologies

Loading Pricing

Price may vary with addition of accessories and services.

Contact us with questions for pricing.

Unit price does not include Import duty, VAT, or Sales Tax.

The Algorithms after Dijkstra and Kruskal for Big Data and IoT Toolkit provides shortest-path and minimum-spanning tree-finding algorithms.

The Algorithms after Dijkstra and Kruskal for Big Data and IoT Toolkit is a software add-on for LabVIEW. This add-on helps you find the shortest path between two points for vehicle routing problems, survivable network design problem, and more. It includes the autoconfig protocol for Ethernet bridging to avoid cycles in a network. The add-on’s features include approximation algorithms for NP-hardness problems, feature-learning for real-time face verification, image registration with Rényi entropy, and model locality of particle interactions in turbulent fluid flows. The Algorithms after Dijkstra and Kruskal for Big Data and IoT Toolkit also helps you find the minimum-spanning tree of a graph.

Part Number(s): 784952-35

Disclaimer: The Third-Party Add-Ons for LabVIEW on this page are offered by independent third-party providers who are solely responsible for these products. NI has no responsibility whatsoever for the performance, product descriptions, specifications, referenced content, or any and all claims or representations of these third-party providers. NI makes no warranty whatsoever, neither express nor implied, with respect to the goods, the referenced contents, or any and all claims or representations of the third-party providers.