max/graph-algorithms
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

updated weighted_graph

Browse source
This commit is contained in:
GregorSamsa42 2024-08-01 23:04:06 +02:00
parent 5f71dd5d45
commit 54cef5809d
2 changed files with 10 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
weighted_graph.cpp
View file

@ -19,13 +19,14 @@ int Node::deg() const
WeightedGraph::WeightedGraph(size_t num_nodes) : nodes(num_nodes)
{
edges = 0;
}
void WeightedGraph::add_edge(int from, int to, double weight)
{
nodes[from].add_edge(to, weight);
nodes[to].add_edge(from, weight);
edges++;
}
std::list<std::pair<int, double>> WeightedGraph::adjList(int node_id) const
@ -43,6 +44,11 @@ size_t WeightedGraph::num_nodes() const
return nodes.size();
}
int WeightedGraph::num_edges() const
{
return edges;
}
std::pair<int,double> WeightedGraph::min_neighbour(int node_id) const
{
if (adjList(node_id).empty())
@ -82,6 +88,7 @@ WeightedGraph WeightedGraph::remove_parallel() const
for (const auto& [to, weight] : lightestEdges)
{
G.nodes[i].add_edge(to, weight);
G.edges++;
}
}
return G;

2
weighted_graph.h
View file

@ -20,12 +20,14 @@ public:
void add_edge(int from, int to, double weight);
std::list<std::pair<int, double>> adjList(int node_id) const;
size_t num_nodes() const;
int num_edges() const;
int deg(int v) const;
std::pair<int,double> min_neighbour(int node_id) const;
WeightedGraph remove_parallel() const;
private:
std::vector<Node> nodes;
int edges;
};
#endif //C___WEIGHTEDGRAPH_H