smk's Blogs
  • Home
  • 1. Fundamentals
  • 2. Data Structure
    • 3-Elementary Data Structure
      • 1-Building Blocks
      • 2-Arrays
      • 3-Linked Lists
      • 4-Elementary List Processing
      • 5-Memory Allocation for Lists
      • 6-Strings
      • 7-Compound Data Structures
    • 4-Abstract Data Structures
      • 0-Introduction
      • 1-Abstract Objects & Collections of Objects
      • 2-Pushdown Stack ADT
      • 3-Examples of Stack-ADT Clients
      • 4-Stack ADT Implementation
      • 5-Creation of New ADT
      • 6-FIFO Queues and Generalized Queue
      • 7-Duplicates and Index Items
      • 8-First Class ADTs
      • 9-Application Based ADTs
      • 10-Perspective
    • 5-Recursion and Trees
      • 1-Recursive Algorithms
      • 2-Divide and Conquer
      • 3-Dynamic Programming
      • 4-Trees
      • 5-Properties of trees
      • 6-Tree Traversal
      • 7-Recursive Binary TreeAlgo
      • 8-Graph Traversal
  • 3. Sorting
    • 6-Elementary Sorting Methods
      • 1-Rules of the Game
      • 2-Selection_sort
      • 3-Insertion_sort
      • 4-Bubble_sort
      • 5-Performance Characteristics of Elementary sorts
      • 6-Shell_sort
      • 7-Sorting of Other type of data
      • 8-Index and Pointer Sorting
      • 9-Sorting of Linked Lists
    • 7-Quicksort
      • 0-Introduction
      • 1-The Basic Algorithm
      • 2-Performance Characterstics of Quicksort
      • 3-Stack Size
      • 4-Small Subfiles
      • 5-Median of three partitioning
      • 6-Duplicate Keys
      • 7-Strings and Vectors
      • 8-Selection
    • 8-Merging and Mergesort
      • 0-Introduction
      • 1-Two Way Merging
      • 2-Abstract In-place merge
      • 3-Top Down mergesort
      • 4-Improvements to basic algorithm
      • 5-Bottom up mergesort
      • 6-Performance characteristics of mergesort
      • 7-Linked list implementations of mergesort
      • 8-Recursion Revisited
    • 9-Priority Queues and Heapsort
      • 0-Introduction
      • 1-Elementary Implementations
      • 2-Heap Data Structure
      • 3-Algorithms on heap
      • 4-Heapsort
      • 5-Priority Queue ADT
      • 6-Priority Queues for Index Items
      • 7-Binomial Queues
    • 10-Radix Sorting
      • 0-Introduction
      • 1-Bits Bytes and Words
      • 2-Binary Quicksort
      • 3-MSD Radix Sort
      • 4-Three way radix quicksort
      • 5-LSD Radix sort
      • 6-Performance Chracterstics of Radix Sorts
      • 7-Sublinear Time Sort
    • 11-Special Purpose Sorting Methods
      • 0-Introduction
      • 1-Batcher's OddEven
      • 2-Sorting Networks
      • 3-External Sorting
      • 4-SortMerge Implementation
      • 5-Parallel SortMerge
  • 4. Searching
    • 12-Symbol Tables and Binary Search
      • 1-Symbol Table Abstract Data Type
      • 2-Key Indexed Search
      • 3-Sequential Search
      • 4-Binary search
      • 5-Binary search trees(BSTs)
      • 6-Performance Characteristics of BSTs
      • 7-Index implementations with Symbol Tables
      • 8-Insertion at root in BSTs
      • 9-BST Implementations of Other ADT functions
    • 13-Balanced Trees
      • 1_Randomized BSTs
      • 2_Splay BSTs
      • 3-Top-Down 2-3-4 Tress
      • 4 Red Black Trees
      • 5 Skip Lists
      • 6 Performance Chracteristics
    • 14-Hashing
      • 1-Hashing Functions
      • 2 Separate Chaining
      • 3-Linear Probing
      • 4-Double Hashing
      • 5-Dynamic Hash Tables
      • 6-Perspective
    • 15-Radix Search
      • 1-Digital Search trees
      • 2-Tries
      • 3-Patricia_Tries
      • 4-Multiway Tries and TSTs
      • 5-TextStrings and Index algorithms
    • 16-External Sorting
      • 1 Rules of Game
      • 2 Indexed Sequential Access
      • 3 B Trees
      • 4 Extendible Hashing
      • 5-Perspective
  • 5. Graph Algorithms
    • 17-Graph Properties and Types
      • 1-Glossary
      • 2 Graph ADT
      • 3 Adjacency matrix
      • 4-Adjacency Lists Representation
      • 5-Variation Extensions Costs
      • 6 Graph Generators
      • 7-Simple Euler and Hamilton Paths
      • 8-Graph Processing Problems
    • 18-Graph Search
      • 1-Exploring a Maze
      • 2-Depth first search
      • 3-Graph Search ADT
      • 4 Properties of DFS Forests
      • 5-DFS Algorithms
      • 6-Separability and Biconnectivity
      • 7-Breadth First Search
      • 8-Generalized Graph Search
      • 9-Analysis Graph Algorithms
    • 19-Digraphs and DAGs
      • 1-Glossary and Rules of Game
      • 2-Anatomy of DFS in Digraphs
      • 3-Reachability and Transitive Closure
      • 4-Equivalence Relations and Partial Orders
      • 5-DAGs
      • 6 Topological Sorting
      • 7-Reachability in DAGs
      • 8-Strong Components in Digraphs
      • 9-Transitive Closure Revisited
      • 10-Perspective
    • 20-MSTs
      • 1-Representations
      • 2-Underlying Principles of MST algo
      • 3-Prims algo and priority first search
      • 4-Kruskal's Algorithm
      • 5-Boruvkas Algorithm
      • 6-Comparisons and Improvemetns
      • 7-Euclidean MST
    • 21-Shortest Paths
      • 0-introduction
      • 1-Underlying principles
      • 2-Dijkstras Algorithm
      • 3-All pair Shortest Paths
      • 4-shortest path in acyclic networks
      • 5-euclidean networks
      • 6-reduction
      • 7-negative weights
      • 8-perspective
    • 22-Network Flows
      • 0-introduction
      • 1-flow networks
      • 2 augmeting path maxflow algorithms
      • 3-preflow push maxflow algorithms
      • 4-maxflow reductions
      • 5-mincost flows
      • 6-network simplex algorithm
      • 7-mincost flow reductions
      • 8-perspective
  • 6. Strings
    • 0-Introduction
    • 1-String Sorts
    • 2-Tries
    • 3-Substring Search
    • 4-Regular Expression
    • 5-Data Compression
  • Problems : Basics 1
    • Predicate Framework of Binary Search
    • Binary Search continued ....
    • Recursion 1
    • Recursion 2
    • Recursion 3
    • 2 Pointers
    • Ad Hoc
  • Problems : Basics 2
    • Sorting
    • Linked Lists
    • Stacks
    • Queues
    • Linked Lists
    • Binary Search Tree
    • BST Review
    • Trees-1
    • Trees-2
  • Problems : Basics 3
    • Sorting
    • Heaps
    • Tries
    • Bit Manipulation
    • Strings 1
    • Strings from cp-algorithms
  • Problems : DP
    • DP 1
    • DP 2
    • DP 3
    • DP 4
    • DP 5
  • Problems : Graphs
    • Graphs 1
    • Graphs 2
    • Graphs 3
    • Graphs 4
  • Absolute freeBSD
    • Getting More Help
    • Before you Install
    • Installing
    • Start Me up! The Boot Process
    • Read this before you break something
    • Kernel Games
    • Configuring Networking
    • The Network
  • CP3 Book
    • Introduction
    • Data Structures and Libraries
    • Problem Solving Paradigm
  • Data Structure Library
    • Graphs
      • Traversal
      • MST
      • Single-Source Shortest Paths
      • Network Flow
      • Special Graph
      • Dijkstra
    • Trees
      • Disjoint Set Union
      • Fenwick Tree
      • Sqrt Decomposition
      • Segment Trees
      • Graphs
  • Synopsis
  • InterviewBit
    • Bit Manipulation
  • Nettech_2022
    • Day1
  • STL
  • Unix Setup
    • updates
    • shells
    • ssh
    • user
    • user bins
    • GNU screen
    • tmux
    • VCS
  • Windows
    • chocolatey
    • diskpart
    • WSL
    • Partitions Records and Bootloaders
    • General Issues
    • postgreSQL

Built with from Grav and Hugo by smk

> Data Structure Library > Graphs

Graphs

  • Traversal
  • MST
  • Single-Source Shortest Paths
  • Network Flow
  • Special Graph
  • Dijkstra