Algorithms after Dijkstra and Kruskal for Big Data and IoT Toolkit

Loading Pricing

Price may vary with addition of accessories and services.

Contact us with questions for pricing.

Online purchasing is unavailable. NI currently does not offer online purchasing for your selected country. Please work with one of our distributors who can help you find what you need.

Price does not include VAT.

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