Graf

İlişkileri temsil eden kenarlarla bağlı köşeler.

A graph is a mathematical structure used to model pairwise relations between objects. It consists of vertices (nodes) and edges (lines connecting nodes). Graphs can be directed or undirected, weighted or unweighted, and are essential for modeling social networks, maps, and internet links.

        graph LR
  Center["Graf"]:::main
  Rel_tree["tree"]:::related -.-> Center
  click Rel_tree "/terms/tree"
  Rel_linked_list["linked-list"]:::related -.-> Center
  click Rel_linked_list "/terms/linked-list"
  Rel_database["database"]:::related -.-> Center
  click Rel_database "/terms/database"
  classDef main fill:#7c3aed,stroke:#8b5cf6,stroke-width:2px,color:white,font-weight:bold,rx:5,ry:5;
  classDef pre fill:#0f172a,stroke:#3b82f6,color:#94a3b8,rx:5,ry:5;
  classDef child fill:#0f172a,stroke:#10b981,color:#94a3b8,rx:5,ry:5;
  classDef related fill:#0f172a,stroke:#8b5cf6,stroke-dasharray: 5 5,color:#94a3b8,rx:5,ry:5;
  linkStyle default stroke:#4b5563,stroke-width:2px;

      

🧠 Bilgi testi

1 / 1

🧒 5 yaşındaki gibi açıkla

Yollarla birbirine bağlı şehirlerin haritasını düşünün. Şehirler nokta (köşeler), yollar çizgidir (kenarlar). Bu bir graftır!

🤓 Expert Deep Dive

Algoritmalar: BFS, DFS, Dijkstra, A*, Floyd-Warshall. Güçlü bağlantılı bileşenler. Minimum kapsayan ağaç. PageRank. Graf veritabanları (Neo4j).

📚 Kaynaklar