Skip to main content
  • Home
  • Development
  • Documentation
  • Donate
  • Operational login
  • Browse the archive

swh logo
SoftwareHeritage
Software
Heritage
Archive
Features
  • Search

  • Downloads

  • Save code now

  • Add forge now

  • Help

Revision 121131be58bc1b6f91a4863bd01fe7cbd0439ab9 authored by Max Göttlicher on 16 August 2023, 15:14:58 UTC, committed by Max Göttlicher on 16 August 2023, 15:16:03 UTC
readme
1 parent 0fb04b6
  • Files
  • Changes
  • b2278c7
  • /
  • shave_graph.cpp
Raw File Download

To reference or cite the objects present in the Software Heritage archive, permalinks based on SoftWare Hash IDentifiers (SWHIDs) must be used.
Select below a type of object currently browsed in order to display its associated SWHID and permalink.

  • revision
  • directory
  • content
revision badge
swh:1:rev:121131be58bc1b6f91a4863bd01fe7cbd0439ab9
directory badge
swh:1:dir:b2278c7375efaffbd65306197e258beaec2c3780
content badge
swh:1:cnt:0a4d7a0836e612ef4bdd3d4eccb8776997eafaea

This interface enables to generate software citations, provided that the root directory of browsed objects contains a citation.cff or codemeta.json file.
Select below a type of object currently browsed in order to generate citations for them.

  • revision
  • directory
  • content
(requires biblatex-software package)
Generating citation ...
(requires biblatex-software package)
Generating citation ...
(requires biblatex-software package)
Generating citation ...
shave_graph.cpp
//
// Created by max on 18.08.22.
//

#include <mpgraphs/graph.hpp>
#include <range/v3/all.hpp>
#include <boost/program_options.hpp>

#include "pds.hpp"
#include "graphio.hpp"

using Graph = pds::PowerGrid;//setgraph::SetGraph<setgraph::Empty, setgraph::Empty, setgraph::EdgeDirection::Undirected>;
using Vertex = Graph::VertexDescriptor;
using Edge = Graph::VertexDescriptor;

void shave(Graph& graph, bool leaves = true, bool paths = true) {
    std::vector<Vertex> deg1;
    std::vector<Vertex> deg2;
    for (Vertex v: graph.vertices()) {
        graph.removeEdge(v, v);
        if (graph.degree(v) <= 1) {
            deg1.push_back(v);
        } else if (graph.degree(v) == 2) {
            deg2.push_back(v);
        }
    }
    while ((leaves && !deg1.empty()) || (paths && !deg2.empty())) {
        while (leaves && !deg1.empty()) {
            auto v = deg1.back(); deg1.pop_back();
            if (graph.hasVertex(v)) {
                for (auto w: graph.neighbors(v)) {
                    if (graph.degree(w) <= 2) {
                        deg1.push_back(w);
                    } else if (graph.degree(w) == 3) {
                        deg2.push_back(w);
                    }
                }
                graph.removeVertex(v);
            }
        }
        while (paths && !deg2.empty()) {
            auto v = deg2.back(); deg2.pop_back();
            if (graph.hasVertex(v)) {
                if (graph.degree(v) == 2) {
                    auto neighbors = graph.neighbors(v) | ranges::to<std::vector>();
                    if (!graph.edge(neighbors[0], neighbors[1])) {
                        graph.addEdge(neighbors[0], neighbors[1]);
                        graph.removeVertex(v);
                    }
                } else if (graph.degree(v) < 2) {
                    deg1.push_back(v);
                }
            }
        }
    }
}

int main(int argc, const char** argv) {
    namespace po = boost::program_options;
    po::options_description desc;
    using std::string, std::vector;
    desc.add_options()
            ("graph,f", po::value<string>(), "graph input file")
            ("outfile,o", po::value<string>()->required(), "graph output file")
            ("leaves,l", "remove leaves")
            ("paths,p","contract paths")
            ;
    po::positional_options_description pos;
    pos.add("graph", 1).add("outfile", 1);

    po::variables_map vm;
    po::store(po::command_line_parser(argc, argv).options(desc).positional(pos).run(), vm);
    po::notify(vm);

    auto graph = pds::readGraphML(vm["graph"].as<string>());
    shave(graph, vm.count("leaves"), vm.count("paths"));

    pds::writePds(graph, vm["outfile"].as<string>());
}
The diff you're trying to view is too large. Only the first 1000 changed files have been loaded.
Showing with 0 additions and 0 deletions (0 / 0 diffs computed)
swh spinner

Computing file changes ...

back to top

Software Heritage — Copyright (C) 2015–2026, The Software Heritage developers. License: GNU AGPLv3+.
The source code of Software Heritage itself is available on our development forge.
The source code files archived by Software Heritage are available under their own copyright and licenses.
Terms of use: Archive access, API— Content policy— Contact— JavaScript license information— Web API