Mathematical algorithm for graphs












0












$begingroup$


I would like to make a computer program that would give the fewest number of nodes needed to make a graph traversable. When a node is 'on' all the arcs coming off it are reachable until the next node. If this node is 'on' then all the arcs coming off this are reachable etc. If a node is 'off', and arcs between it and another 'off' node are not reachable.



My question is, is there a mathematical algorithm that I could use to make this in a program? I was thinking maybe Primm's but this is to make all the nodes reachable, not the arcs.










share|cite|improve this question









$endgroup$

















    0












    $begingroup$


    I would like to make a computer program that would give the fewest number of nodes needed to make a graph traversable. When a node is 'on' all the arcs coming off it are reachable until the next node. If this node is 'on' then all the arcs coming off this are reachable etc. If a node is 'off', and arcs between it and another 'off' node are not reachable.



    My question is, is there a mathematical algorithm that I could use to make this in a program? I was thinking maybe Primm's but this is to make all the nodes reachable, not the arcs.










    share|cite|improve this question









    $endgroup$















      0












      0








      0





      $begingroup$


      I would like to make a computer program that would give the fewest number of nodes needed to make a graph traversable. When a node is 'on' all the arcs coming off it are reachable until the next node. If this node is 'on' then all the arcs coming off this are reachable etc. If a node is 'off', and arcs between it and another 'off' node are not reachable.



      My question is, is there a mathematical algorithm that I could use to make this in a program? I was thinking maybe Primm's but this is to make all the nodes reachable, not the arcs.










      share|cite|improve this question









      $endgroup$




      I would like to make a computer program that would give the fewest number of nodes needed to make a graph traversable. When a node is 'on' all the arcs coming off it are reachable until the next node. If this node is 'on' then all the arcs coming off this are reachable etc. If a node is 'off', and arcs between it and another 'off' node are not reachable.



      My question is, is there a mathematical algorithm that I could use to make this in a program? I was thinking maybe Primm's but this is to make all the nodes reachable, not the arcs.







      algorithms network






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Dec 22 '18 at 10:44









      calcstudentcalcstudent

      359210




      359210






















          1 Answer
          1






          active

          oldest

          votes


















          1












          $begingroup$

          I believe your are talking about the Vertex Cover problem, which is unfortunately $NP$-complete.






          share|cite|improve this answer









          $endgroup$














            Your Answer








            StackExchange.ready(function() {
            var channelOptions = {
            tags: "".split(" "),
            id: "69"
            };
            initTagRenderer("".split(" "), "".split(" "), channelOptions);

            StackExchange.using("externalEditor", function() {
            // Have to fire editor after snippets, if snippets enabled
            if (StackExchange.settings.snippets.snippetsEnabled) {
            StackExchange.using("snippets", function() {
            createEditor();
            });
            }
            else {
            createEditor();
            }
            });

            function createEditor() {
            StackExchange.prepareEditor({
            heartbeatType: 'answer',
            autoActivateHeartbeat: false,
            convertImagesToLinks: true,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: 10,
            bindNavPrevention: true,
            postfix: "",
            imageUploader: {
            brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
            contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
            allowUrls: true
            },
            noCode: true, onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            });


            }
            });














            draft saved

            draft discarded


















            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3049297%2fmathematical-algorithm-for-graphs%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            1












            $begingroup$

            I believe your are talking about the Vertex Cover problem, which is unfortunately $NP$-complete.






            share|cite|improve this answer









            $endgroup$


















              1












              $begingroup$

              I believe your are talking about the Vertex Cover problem, which is unfortunately $NP$-complete.






              share|cite|improve this answer









              $endgroup$
















                1












                1








                1





                $begingroup$

                I believe your are talking about the Vertex Cover problem, which is unfortunately $NP$-complete.






                share|cite|improve this answer









                $endgroup$



                I believe your are talking about the Vertex Cover problem, which is unfortunately $NP$-complete.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Dec 22 '18 at 14:35









                SmileyCraftSmileyCraft

                3,776519




                3,776519






























                    draft saved

                    draft discarded




















































                    Thanks for contributing an answer to Mathematics Stack Exchange!


                    • Please be sure to answer the question. Provide details and share your research!

                    But avoid



                    • Asking for help, clarification, or responding to other answers.

                    • Making statements based on opinion; back them up with references or personal experience.


                    Use MathJax to format equations. MathJax reference.


                    To learn more, see our tips on writing great answers.




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function () {
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3049297%2fmathematical-algorithm-for-graphs%23new-answer', 'question_page');
                    }
                    );

                    Post as a guest















                    Required, but never shown





















































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown

































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown







                    Popular posts from this blog

                    Plaza Victoria

                    Puebla de Zaragoza

                    Musa