Skip to content

Data Structures and Algorithms

Graph Diameter

Initializing search

Home
Algorithms
Data Structures
Analysis
Resources
Competitive Programming

Data Structures and Algorithms

Home
Algorithms
Algorithms
- Flow Chart for solving problem
- Arrays
  Arrays
  - Searching
    
    Searching
    
    Binary Search
  - Sorting
    
    Sorting
    
    Bubble Sort
    
    Count Sort
    
    Heap Sort
    
    Insertion Sort
    
    Merge Sort
    
    Quick Sort
    
    Radix Sort
    
    Selection Sort
- Graphs
  Graphs
  - All pair shortest path
    
    All pair shortest path
  - Bipartite graph
    
    Bipartite graph
  - Bridges
    
    Bridges
  - Cycles detection
    
    Cycles detection
  - Directed acyclic graph
    
    Directed acyclic graph
    
    Topological sort
  - Disjoint union
    
    Disjoint union
  - Eulerian graph
    
    Eulerian graph
  - Graph coloring
    
    Graph coloring
  - Graph diameter
    
    Graph diameter
  - Hamiltonian cycle
    
    Hamiltonian cycle
  - Minimum spanning tree
    
    Minimum spanning tree
    
    Kruskal's Algorithm
    
    Prims Algorithm
  - Network flow
    
    Network flow
  - Planarity testing
    
    Planarity testing
  - Shortest path
    
    Shortest path
    
    Dijkstras Shortest Path Algorithm
  - Strongly connected components
    
    Strongly connected components
  - Travelling salesman problem
    
    Travelling salesman problem
  - Traversal
    
    Traversal
    
    Breadth First Search
    
    BFS-Trees
    
    Depth First Search
    
    DFS-Trees
- Techniques
  Techniques
Data Structures
Data Structures
- Abstract data type
  Abstract data type
  - Dequeue
    
    Dequeue
  - Queue
    
    Queue
  - Stack
    
    Stack
- Arrays
  Arrays
- Graphs
  Graphs
- Linked list
  Linked list
- Trees
  Trees
  - Binary tree
    
    Binary tree
    
    Binary heap
    
    Binary heap
    
    Binary search tree
    
    Binary search tree
    
    Traversal
    
    Traversal
  - Segment tree
    
    Segment tree
  - Trie
    
    Trie
Analysis
Analysis
Resources
Competitive Programming
Competitive Programming

Graph Diameter

What is the diameter of the graph, i.e., the longest shortest path between any two nodes?

Copyright Shivanshu Semwal

Made with Material for MkDocs