graph - OpenGenus IQ: Learn Computer Science

How TensorFlow uses Graph data structure concepts?

In this article, we explain various concepts in TensorFlow such as tensors, dataflow graphs and several optimizations such as decision tree pruning and demonstrate the use of graph data structure and algorithm concepts in TensorFlow

graph algorithm

Graph Representation: Adjacency Matrix and Adjacency List

A Graph is represented in two major data structures namely Adjacency Matrix and Adjacency List. This forms the basis of every graph algorithm. In this article, we have explored the two graph data structures in depth and explain when to use one of them

graph

Cheriton-Tarjan Minimum Spanning tree algorithm

The Cheriton-Tarjan algorithm is a modification of Kruskal's algorithm designed to reduce the O(e log e) term. Similar to Kruskal's algorithm, it grows a spanning forest, beginning with a forest of n = |G| components each consisting of a single node.