Graph.h

// This file is part of Topologic software library.
// Copyright(C) 2019, Cardiff University and University College London
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with this program. If not, see <https://www.gnu.org/licenses/>.

#pragma once

#include <TopologicCore/include/Graph.h>

#ifdef TOPOLOGIC_DYNAMO
using namespace Autodesk::DesignScript::Runtime;
#endif

using namespace System;
using namespace System::Collections::Generic;

namespace Topologic {
    ref class Vertex;
    ref class Edge;
    ref class Wire;
    ref class Topology;

    public ref class Graph
    {
    public:

#ifdef TOPOLOGIC_DYNAMO
        static Graph^ ByTopology(
            Topology^ topology,
            [DefaultArgument("true")] bool direct,
            [DefaultArgument("false")] bool viaSharedTopologies,
            [DefaultArgument("false")] bool viaSharedApertures,
            [DefaultArgument("false")] bool toExteriorTopologies,
            [DefaultArgument("false")] bool toExteriorApertures,
            [DefaultArgument("false")] bool useFaceInternalVertex,
            [DefaultArgument("0.0001")] double tolerance);
#else
        static Graph^ ByTopology(
            Topology^ topology,
            bool direct,
            bool viaSharedTopologies,
            bool viaSharedApertures,
            bool toExteriorTopologies,
            bool toExteriorApertures,
            bool useFaceInternalVertex,
            double tolerance);
#endif

        property List<Vertex^>^ Vertices
        {
            List<Vertex^>^ get();
        }

        property List<Vertex^>^ IsolatedVertices
        {
            List<Vertex^>^ get();
        }

        property List<Edge^>^ Edges
        {
            List<Edge^>^ get();
        }

        property Topology^ Topology
        {
            Topologic::Topology^ get();
        }

        List<Vertex^>^ VerticesAtCoordinates(
            double x, double y, double z, 
#ifdef TOPOLOGIC_DYNAMO
            [Autodesk::DesignScript::Runtime::DefaultArgument("0.0001")]
#endif
            double tolerance);

        Graph^ AddVertices(
            List<Vertex^>^ vertices,
#ifdef TOPOLOGIC_DYNAMO
            [Autodesk::DesignScript::Runtime::DefaultArgument("0.0001")]
#endif
            double tolerance);

        Graph^ AddEdges(
            List<Edge^>^ edges,
#ifdef TOPOLOGIC_DYNAMO
            [Autodesk::DesignScript::Runtime::DefaultArgument("0.0001")]
#endif
            double tolerance);

        Graph^ Connect(
            Vertex^ vertex1, 
            Vertex^ vertex2, 
#ifdef TOPOLOGIC_DYNAMO
            [Autodesk::DesignScript::Runtime::DefaultArgument("0.0001")]
#endif
            double tolerance);

        int VertexDegree(Vertex^ vertex);

        List<Vertex^>^ AdjacentVertices(Vertex^ vertex);

        bool ContainsVertex(Vertex^ vertex, 
#ifdef TOPOLOGIC_DYNAMO
            [Autodesk::DesignScript::Runtime::DefaultArgument("0.0001")]
#endif
            double tolerance);

        bool ContainsEdge(Edge^ edge, 
#ifdef TOPOLOGIC_DYNAMO
            [Autodesk::DesignScript::Runtime::DefaultArgument("0.0001")]
#endif
            double tolerance);

        property List<int>^ DegreeSequence
        {
            List<int>^ get();
        }

        property double Density
        {
            double get();
        }

        property bool IsComplete
        {
            bool get();
        }

        property int MinimumDelta
        {
            int get();
        }

        property int MaximumDelta
        {
            int get();
        }

        property int Diameter
        {
            int get();
        }

        List<Wire^>^ AllPaths(
            Vertex^ startVertex, 
            Vertex^ endVertex, 
#ifdef TOPOLOGIC_DYNAMO
            [Autodesk::DesignScript::Runtime::DefaultArgument("null")]
#endif
            Nullable<int> timeLimitInSeconds);

        Wire^ Path(Vertex^ startVertex, Vertex^ endVertex);


        Wire^ ShortestPath(Vertex^ startVertex, Vertex^ endVertex,
#ifdef TOPOLOGIC_DYNAMO
            [Autodesk::DesignScript::Runtime::DefaultArgument("null")]
#endif
        String^ vertexKey,
#ifdef TOPOLOGIC_DYNAMO
            [Autodesk::DesignScript::Runtime::DefaultArgument("null")]
#endif
        String^ edgeKey);

        List<Wire^>^ ShortestPaths(Vertex^ startVertex, Vertex^ endVertex,
#ifdef TOPOLOGIC_DYNAMO
            [Autodesk::DesignScript::Runtime::DefaultArgument("null")]
#endif
            String^ vertexKey,
#ifdef TOPOLOGIC_DYNAMO
            [Autodesk::DesignScript::Runtime::DefaultArgument("null")]
#endif
            String^ edgeKey,
#ifdef TOPOLOGIC_DYNAMO
            [Autodesk::DesignScript::Runtime::DefaultArgument("null")]
#endif
        Nullable<int> timeLimitInSeconds);

        int TopologicalDistance(Vertex^ startVertex, Vertex^ endVertex);

        bool IsErdoesGallai(List<int>^ sequence);

        Graph^ RemoveVertices(List<Vertex^>^ vertices);

        Graph^ RemoveEdges(List<Edge^>^ edges);

        Edge^ Edge(Vertex^ vertex1, Vertex^ vertex2,
#ifdef TOPOLOGIC_DYNAMO
            [Autodesk::DesignScript::Runtime::DefaultArgument("0.0001")]
#endif
            double tolerance);

        List<Topologic::Edge^>^ IncidentEdges(Vertex^ vertex,
#ifdef TOPOLOGIC_DYNAMO
            [Autodesk::DesignScript::Runtime::DefaultArgument("0.0001")]
#endif
            double tolerance);

    public protected:
        Graph();

        Graph(const std::shared_ptr<TopologicCore::Graph>& kpCoreGraph);

    protected:
        virtual ~Graph();

        std::shared_ptr<TopologicCore::Graph>* m_pCoreGraph;
    };
}