Skip to content

Add graph centrality algorithms to compute central and median nodes i… #11880

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 1 commit into from
Closed

Add graph centrality algorithms to compute central and median nodes i… #11880

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 16 additions & 0 deletions graphs/dijkstra_algorithm.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,6 +4,22 @@

import math
import sys
from dataclasses import dataclass, field


@dataclass
class Edge:
destination: int
weight: float


@dataclass
class Node:
node_id: int
distance: float = float("inf") # Initialize with "infinity" distance
parent: int | None = None
edges: list[Edge] = field(default_factory=list)


# For storing the vertex set to retrieve node with the lowest distance

Expand Down