Algorithms after Dijkstra and Kruskal for Big Data and IoT Toolkit

Ovak Technologies

加载价格

价格可能因附件和服务的增加而有所不同。

请联系我们询价。

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.

产品编号: 784952-35

本页面上的LabVIEW第三方附加软件由独立的第三方供应商提供,这些供应商对这些产品负全部责任。 对于第三方供应商提供的任何产品性能、产品描述、规范、参考内容或陈述,NI概不负责。 对于第三方供应商提供的产品、参考内容或陈述,NI不作任何明示或暗示的保证。