IT blogs

Java, Utility tools, Software reviews etc.

Sunday, 27 April 2025

[Graph] - DAG : An important observation

In a DAG, a mutually unreachable pair (s,t) can exist if and only if there exists at least one topological level with at least two nodes. 

Read the post at Notion : https://www.notion.so/DAG-Directed-Acyclic-Graph-1d8d32fa6ba880e7aea2d3eb59ad46e1

Posted by Kunal Krishna at 18:34 No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Labels: DAG, graph, programming
Newer Posts Older Posts Home
Subscribe to: Posts (Atom)

About Me

My photo
Kunal Krishna
View my complete profile

Blog Archive

  • ▼  2025 (4)
    • ►  August (1)
    • ▼  April (1)
      • [Graph] - DAG : An important observation
    • ►  March (2)
  • ►  2024 (2)
    • ►  March (1)
    • ►  January (1)
  • ►  2023 (7)
    • ►  November (1)
    • ►  October (2)
    • ►  April (1)
    • ►  March (3)
  • ►  2017 (2)
    • ►  January (2)
  • ►  2014 (1)
    • ►  October (1)
Simple theme. Theme images by centauria. Powered by Blogger.