greedy_algorithms::dijkstra::Graph Class Reference

Wrapper class for storing a graph. More...

Collaboration diagram for greedy_algorithms::dijkstra::Graph:

Public Member Functions
	Graph (const int V)
	Constructs a graph.
void	add_edge (int src, int dst, int weight)
	Adds an edge to the graph.

Public Attributes
int	vertexNum = 0
std::vector< std::vector< int > >	edges {}

Detailed Description

Wrapper class for storing a graph.

Definition at line 35 of file dijkstra_greedy.cpp.

Constructor & Destructor Documentation

Graph()

greedy_algorithms::dijkstra::Graph::Graph ( const int V )

inlineexplicit

Constructs a graph.

Parameters

V	number of vertices of the graph

Definition at line 44 of file dijkstra_greedy.cpp.

                                {
        // Initialize the array edges
        this->edges = std::vector<std::vector<int>>(V, std::vector<int>(V, 0));
        for (int i = 0; i < V; i++) {
            edges[i] = std::vector<int>(V, 0);
        }
 
        // Fills the array with zeros
        for (int i = 0; i < V; i++) {
            for (int j = 0; j < V; j++) {
                edges[i][j] = 0;
            }
        }
 
        this->vertexNum = V;
    }

Member Function Documentation

add_edge()

void greedy_algorithms::dijkstra::Graph::add_edge ( int src, int dst, int weight )

inline

Adds an edge to the graph.

Parameters

src	the graph the edge should be added to
dst	the position where the edge should be added to
weight	the weight of the edge that should be added

Returns

void

Definition at line 68 of file dijkstra_greedy.cpp.

                                                {
        this->edges[src][dst] = weight;
    }

Member Data Documentation

edges

std::vector<std::vector<int> > greedy_algorithms::dijkstra::Graph::edges {}

Definition at line 38 of file dijkstra_greedy.cpp.

{};

vertexNum

int greedy_algorithms::dijkstra::Graph::vertexNum = 0

Definition at line 37 of file dijkstra_greedy.cpp.

---

The documentation for this class was generated from the following file:

• greedy_algorithms/dijkstra_greedy.cpp