Author Archives: Stanislav_Panteleev

Delphi. MVC pattern in UniGUI vs traditional coding to form

Posted on 16.10.2017 by Stanislav_Panteleev

My discussion on forum Conclusion – mvc is possible to implement, but not obligatory. Standart delphi structure of dfm and pas is natural to delphi enviroment. Maybe mvc pattern would be better for big projects…

Posted in Delphi, UniGui | Leave a comment

Delphi. UniGUI. Calc, just calc

Posted on 16.10.2017 by Stanislav_Panteleev

Wanted to show 2 patterns on calc example, but calc itself has become not simple task… Below version that works correctly but there is things to do…

unit Main;

interface

uses
  Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms,
  Dialogs, uniGUITypes, uniGUIAbstractClasses, uniGUIClasses, uniGUIRegClasses,
  uniGUIForm, uniEdit, uniGUIBaseClasses, uniButton, uniBitBtn, uniLabel;

type
  TMainForm = class(TUniForm)
    b8: TUniBitBtn;
    b9: TUniBitBtn;
    b4: TUniBitBtn;
    b5: TUniBitBtn;
    b6: TUniBitBtn;
    bOne: TUniBitBtn;
    b2: TUniBitBtn;
    b3: TUniBitBtn;
    eResult: TUniEdit;
    UniBitBtn10: TUniBitBtn;
    bEqual: TUniBitBtn;
    bDivide: TUniBitBtn;
    bMultiply: TUniBitBtn;
    bMinus: TUniBitBtn;
    bPlus: TUniBitBtn;
    bCE: TUniBitBtn;
    b7: TUniBitBtn;
    unilabel: TUniLabel;
    procedure UniFormCreate(Sender: TObject);
    procedure digitClick(Sender: TObject);
    procedure signClick(Sender: TObject);
    procedure bEqualClick(Sender: TObject);
    procedure bCEClick(Sender: TObject);
  private
    { Private declarations }
    faIsEmpty: Boolean;
    fbIsEmpty: Boolean;
    fcIsEmpty: Boolean;
    fdIsEmpty: Boolean;
    fIsSignClickedBefore: Boolean;
    fIsDigitClicked: Boolean;
    fa, fb, fc: real;
    fd: char;
    foperators: set of Char;
    procedure nullAll;
  public
    { Public declarations }
  end;

function MainForm: TMainForm;

implementation

{$R *.dfm}

uses
  uniGUIVars, MainModule, uniGUIApplication, System.Generics.Collections;

function MainForm: TMainForm;
begin
  Result := TMainForm(UniMainModule.GetFormInstance(TMainForm));
end;

procedure TMainForm.bCEClick(Sender: TObject);
begin
  nullAll();
end;

procedure TMainForm.bEqualClick(Sender: TObject);
begin
  case fd of
    '-':
      fc := fa - fb;
    '+':
      fc := fa + fb;
    '*':
      fc := fa * fb;
    '/':
      fc := fa / fb;
  end;
  fa := fc;
  fbIsEmpty := True;
  eResult.Text := FloatToStr(fc);
end;

procedure TMainForm.nullAll;
begin
  fa := 0.00;
  fb := 0.00;
  fc := 0.00;
  unilabel.Caption := '';
  faIsEmpty := true;
  fbIsEmpty := true;
  fcIsEmpty := true;
  fdIsEmpty := true;
  foperators := ['+', '-', '*', '/'];
  unilabel.Caption := '';
  eResult.Text := '';
end;

procedure TMainForm.digitClick(Sender: TObject);
begin
  fIsSignClickedBefore := false;
  fIsDigitClicked := True;
  if faIsEmpty then
  begin
    fa := strToFloat((Sender as TUniBitbtn).Caption);
    faIsEmpty := false;
  end
  else
  begin
    fb := strToFloat((Sender as TUniBitbtn).Caption);
    fbIsEmpty := False;
  end;
  unilabel.Caption := unilabel.Caption + (Sender as TUniBitbtn).Caption;
end;

procedure TMainForm.signClick(Sender: TObject);
var
  s: string;
  lastSymbol:char;
begin
  fdIsEmpty := false;
  if fIsSignClickedBefore then
  begin
    s := unilabel.Caption;
    lastSymbol:=s[Length(s)];
    if ((s[Length(s)] in foperators) and ((lastSymbol <> (Sender as TUniBitbtn).Caption))) then
    begin
      delete(s, length(s), 1);
      fdIsEmpty := true;
      unilabel.Caption := s;
      //fIsSignClickedBefore := false;
    end
    else if (s[Length(s)] = (Sender as TUniBitbtn).Caption) then
      exit;
  end;

  unilabel.Caption := unilabel.Caption + (Sender as TUniBitbtn).Caption;
  s := (Sender as TUniBitBtn).Caption;
  fd := s[Low(s)];
  if fdIsEmpty then
    exit;

  if not fIsDigitClicked and fIsSignClickedBefore then
    exit;

  fIsSignClickedBefore := true;

  if (not faIsEmpty) and (not fbIsEmpty) then
  begin
    case fd of
      '-':
        fc := fa - fb;
      '+':
        fc := fa + fb;
      '*':
        fc := fa * fb;
      '/':
        fc := fa / fb;
    end;
    fa := fc;
    eResult.Text := FloatToStr(fc);
    fIsDigitClicked := false;
  end;
end;

procedure TMainForm.UniFormCreate(Sender: TObject);
begin
  nullAll();
end;


initialization
  RegisterAppFormClass(TMainForm);

end.

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

unit Main;

interface

uses

Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms,

Dialogs, uniGUITypes, uniGUIAbstractClasses, uniGUIClasses, uniGUIRegClasses,

uniGUIForm, uniEdit, uniGUIBaseClasses, uniButton, uniBitBtn, uniLabel;

type

TMainForm = class(TUniForm)

b8: TUniBitBtn;

b9: TUniBitBtn;

b4: TUniBitBtn;

b5: TUniBitBtn;

b6: TUniBitBtn;

bOne: TUniBitBtn;

b2: TUniBitBtn;

b3: TUniBitBtn;

eResult: TUniEdit;

UniBitBtn10: TUniBitBtn;

bEqual: TUniBitBtn;

bDivide: TUniBitBtn;

bMultiply: TUniBitBtn;

bMinus: TUniBitBtn;

bPlus: TUniBitBtn;

bCE: TUniBitBtn;

b7: TUniBitBtn;

unilabel: TUniLabel;

procedure UniFormCreate(Sender: TObject);

procedure digitClick(Sender: TObject);

procedure signClick(Sender: TObject);

procedure bEqualClick(Sender: TObject);

procedure bCEClick(Sender: TObject);

private

{ Private declarations }

faIsEmpty: Boolean;

fbIsEmpty: Boolean;

fcIsEmpty: Boolean;

fdIsEmpty: Boolean;

fIsSignClickedBefore: Boolean;

fIsDigitClicked: Boolean;

fa, fb, fc: real;

fd: char;

foperators: set of Char;

procedure nullAll;

public

{ Public declarations }

end;

function MainForm: TMainForm;

implementation

{$R *.dfm}

uses

uniGUIVars, MainModule, uniGUIApplication, System.Generics.Collections;

function MainForm: TMainForm;

begin

Result := TMainForm(UniMainModule.GetFormInstance(TMainForm));

end;

procedure TMainForm.bCEClick(Sender: TObject);

begin

nullAll();

end;

procedure TMainForm.bEqualClick(Sender: TObject);

begin

case fd of

'-':

fc := fa - fb;

'+':

fc := fa + fb;

'*':

fc := fa * fb;

'/':

fc := fa / fb;

end;

fa := fc;

fbIsEmpty := True;

eResult.Text := FloatToStr(fc);

end;

procedure TMainForm.nullAll;

begin

fa := 0.00;

fb := 0.00;

fc := 0.00;

unilabel.Caption := '';

faIsEmpty := true;

fbIsEmpty := true;

fcIsEmpty := true;

fdIsEmpty := true;

foperators := ['+', '-', '*', '/'];

unilabel.Caption := '';

eResult.Text := '';

end;

procedure TMainForm.digitClick(Sender: TObject);

begin

fIsSignClickedBefore := false;

fIsDigitClicked := True;

if faIsEmpty then

begin

fa := strToFloat((Sender as TUniBitbtn).Caption);

faIsEmpty := false;

end

else

begin

fb := strToFloat((Sender as TUniBitbtn).Caption);

fbIsEmpty := False;

end;

unilabel.Caption := unilabel.Caption + (Sender as TUniBitbtn).Caption;

end;

procedure TMainForm.signClick(Sender: TObject);

var

s: string;

lastSymbol:char;

begin

fdIsEmpty := false;

if fIsSignClickedBefore then

begin

s := unilabel.Caption;

lastSymbol:=s[Length(s)];

if ((s[Length(s)] in foperators) and ((lastSymbol <> (Sender as TUniBitbtn).Caption))) then

begin

delete(s, length(s), 1);

fdIsEmpty := true;

unilabel.Caption := s;

//fIsSignClickedBefore := false;

end

else if (s[Length(s)] = (Sender as TUniBitbtn).Caption) then

exit;

end;

unilabel.Caption := unilabel.Caption + (Sender as TUniBitbtn).Caption;

s := (Sender as TUniBitBtn).Caption;

fd := s[Low(s)];

if fdIsEmpty then

exit;

if not fIsDigitClicked and fIsSignClickedBefore then

exit;

fIsSignClickedBefore := true;

if (not faIsEmpty) and (not fbIsEmpty) then

begin

case fd of

'-':

fc := fa - fb;

'+':

fc := fa + fb;

'*':

fc := fa * fb;

'/':

fc := fa / fb;

end;

fa := fc;

eResult.Text := FloatToStr(fc);

fIsDigitClicked := false;

end;

procedure TMainForm.UniFormCreate(Sender: TObject);

begin

nullAll();

end;

initialization

RegisterAppFormClass(TMainForm);

end.

Posted in Delphi, UniGui | Leave a comment

MySQL. function to count ratio. Example from project

Posted on 14.10.2017 by Stanislav_Panteleev

Was needed to count progress of finished / all elements,below is an example how to do this…

CREATE DEFINER=`root`@`localhost` FUNCTION `eventElementProgress`(eventsID integer,testsID integer) RETURNS varchar(45) CHARSET utf8
BEGIN
DECLARE allVar INT; 
DECLARE finishedVar INT;
DECLARE rounded decimal(10,2);
DECLARE r decimal(10,2);
DECLARE progressInChars varchar(45); 

SELECT count(*) FROM coffeetest_db.users_has_events_has_tests where events_id=eventsID 
and tests_id=testsID  into allVar;

SELECT count(*) FROM coffeetest_db.users_has_events_has_tests where events_id=eventsID 
and tests_id=testsID and status_id=(select max(id) from status) into finishedVar;
#select (finishedVar/allVar*100) into r;
#select cast(round((finishedVar/allVar*100),2) as char (50)) into progressInChars ;
select (finishedVar/allVar*100) into r;
select round(r,2) into rounded;
select cast(rounded as char(50)) into progressInChars;
#select round(r,2) into rounded;
#select progressInChars;

RETURN progressInChars;
END

CREATE DEFINER=`root`@`localhost` FUNCTION `eventElementProgress`(eventsID integer,testsID integer) RETURNS varchar(45) CHARSET utf8

BEGIN

DECLARE allVar INT;

DECLARE finishedVar INT;

DECLARE rounded decimal(10,2);

DECLARE r decimal(10,2);

DECLARE progressInChars varchar(45);

SELECT count(*) FROM coffeetest_db.users_has_events_has_tests where events_id=eventsID

and tests_id=testsID into allVar;

SELECT count(*) FROM coffeetest_db.users_has_events_has_tests where events_id=eventsID

and tests_id=testsID and status_id=(select max(id) from status) into finishedVar;

#select (finishedVar/allVar*100) into r;

#select cast(round((finishedVar/allVar*100),2) as char (50)) into progressInChars ;

select (finishedVar/allVar*100) into r;

select round(r,2) into rounded;

select cast(rounded as char(50)) into progressInChars;

#select round(r,2) into rounded;

#select progressInChars;

RETURN progressInChars;

END

Posted in Delphi | Leave a comment

Delphi. FireMonkeyStyles

Posted on 14.10.2017 by Stanislav_Panteleev

Posted in Delphi, FireMonkey | Leave a comment

Delphi. FastReportVCL – merge / concat many reports

Posted on 12.10.2017 by Stanislav_Panteleev

I needed report from runtime and disign time to be merged, so below is simpliest way to do this…

procedure TReportSettingsEventsForm.concatReports(AresultReport: TfrxReport; a: array of TfrxReport);
var
  i: Integer;
  ms: TMemoryStream;
  guid: TGUID;
  filename: string;
  guid2: TGUID;
  filename2: string;
begin
  for i := Low(a) to High(a) do
  begin
    ms := TMemoryStream.Create();
    try
      Createguid(guid);
      filename := guid.ToString() + '.fp3';
      a[i].SaveToFile(filename);
      AresultReport.LoadFromFile(filename);
      AresultReport.PrepareReport(false);
    finally
      ms.free();
      if TFile.Exists(filename) then
        TFile.Delete(filename);
    end;
  end;
end;

procedure TReportSettingsEventsForm.concatReports(AresultReport: TfrxReport; a: array of TfrxReport);

var

i: Integer;

ms: TMemoryStream;

guid: TGUID;

filename: string;

guid2: TGUID;

filename2: string;

begin

for i := Low(a) to High(a) do

begin

ms := TMemoryStream.Create();

try

Createguid(guid);

filename := guid.ToString() + '.fp3';

a[i].SaveToFile(filename);

AresultReport.LoadFromFile(filename);

AresultReport.PrepareReport(false);

finally

ms.free();

if TFile.Exists(filename) then

TFile.Delete(filename);

end;

example of use

procedure TReportSettingsEventsForm.showReport;
var
  a: array of TfrxReport;
begin
  frxResources.LoadFromFile('Russian.frc'); // setting language
  PrepareDynamicReport();
  MainReport.Clear();
  a := [TitlePage_Runtime, Data_DesignTime, frxReport1];
  concatReports(MainReport, a);
  with MainReport do
  begin
    PreviewOptions.ThumbnailVisible := true;
    ShowPreparedReport();
  end;
end;

procedure TReportSettingsEventsForm.showReport;

var

a: array of TfrxReport;

begin

frxResources.LoadFromFile('Russian.frc'); // setting language

PrepareDynamicReport();

MainReport.Clear();

a := [TitlePage_Runtime, Data_DesignTime, frxReport1];

concatReports(MainReport, a);

with MainReport do

begin

PreviewOptions.ThumbnailVisible := true;

ShowPreparedReport();

end;

Building a composite report (batch printing) In some cases it is required to organize printing … Continue reading →

Posted in Delphi, FastReport | Leave a comment

Delphi. FastReportVCL – change language to Russian, example

Posted on 12.10.2017 by Stanislav_Panteleev

for exmaple we will change language of previewer to russian find dir where languages are (for ex.)

C:\Program Files (x86)\FastReport 5 VCL Enterprise\Res\Russian

1	C:\Program Files (x86)\FastReport 5 VCL Enterprise\Res\Russian

open cmd and type

cd C:\Program Files (x86)\FastReport 5 VCL Enterprise\Res\Russian

1	cd C:\Program Files (x86)\FastReport 5 VCL Enterprise\Res\Russian

type

mk.bat

mk.bat

you will recieve Russian.frc file In runtime call

uses frxRes; frxResources.LoadFromFile('russian.frc');

1	uses frxRes; frxResources.LoadFromFile('russian.frc');

Posted in Delphi, FastReport | Leave a comment

C#. BipartiteGraph

Posted on 03.10.2017 by Stanislav_Panteleev

Seidgwicksource Git Bipartite.cs

using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace BipartiteGraphExample
{
    public class Bipartite
    {
        public bool isBipartite { get; set; }   // is the graph bipartite?
        private bool[] color;       // color[v] gives vertices on one side of bipartition
        private bool[] marked;      // marked[v] = true if v has been visited in DFS
        private int[] edgeTo;          // edgeTo[v] = last edge on path to v
        public Stack<int> cycle;  // odd-length cycle

        /**
   * Determines whether an undirected graph is bipartite and finds either a
   * bipartition or an odd-length cycle.
   *
   * @param  G the graph
   */
        public Bipartite(Graph G)
        {
            isBipartite = true;
            color = new bool [G.V];
            marked = new bool [G.V];
            edgeTo = new int[G.V];

            for (int v = 0; v < G.V; v++)
            {
                if (!marked[v])
                {
                    dfs(G, v);
                }
            }
            Trace.Assert(check(G));
        }

        private void dfs(Graph G, int v)
        {
            marked[v] = true;
            foreach (int w in G.adjVerticles(v))
            {

                // short circuit if odd-length cycle found
                if (cycle != null) return;

                // found uncolored vertex, so recur
                if (!marked[w])
                {
                    edgeTo[w] = v;
                    color[w] = !color[v];
                    dfs(G, w);
                }

                // if v-w create an odd-length cycle, find it
                else if (color[w] == color[v])
                {
                    isBipartite = false;
                    cycle = new Stack<int>();
                    cycle.Push(w);  // don't need this unless you want to include start vertex twice
                    for (int x = v; x != w; x = edgeTo[x])
                    {
                        cycle.Push(x);
                    }
                    cycle.Push(w);
                }
            }
        }
        public bool getColor(int v)
        {
            validateVertex(v);
            if (!isBipartite)
                throw new ArgumentException("graph is not bipartite");
            return color[v];
        }
        /**
   * Returns an odd-length cycle if the graph is not bipartite, and
   * {@code null} otherwise.
   *
   * @return an odd-length cycle if the graph is not bipartite
   *         (and hence has an odd-length cycle), and {@code null}
   *         otherwise
   */
        public IEnumerable<int> oddCycle()
        {
            return cycle;
        }

        private bool check(Graph G)
        {
            // graph is bipartite
            if (isBipartite)
            {
                for (int v = 0; v < G.V; v++)
                {
                    foreach (int w in G.adjVerticles(v))
                    {
                        if (color[v] == color[w])
                        {
                            Console.WriteLine("edge %d-%d with %d and %d in same side of bipartition\n", v, w, v, w);
                            return false;
                        }
                    }
                }
            }
            // graph has an odd-length cycle
            else
            {
                // verify cycle
                int first = -1, last = -1;
                foreach (int v in oddCycle())
                {
                    if (first == -1) first = v;
                    last = v;
                }
                if (first != last)
                {
                    Console.WriteLine("cycle begins with %d and ends with %d\n", first, last);
                    return false;
                }
            }

            return true;
        }
        // throw an IllegalArgumentException unless {@code 0 <= v < V}
        private void validateVertex(int v)
        {
            int V = marked.Length;
            if (v < 0 || v >= V)
                throw new ArgumentException("vertex " + v + " is not between 0 and " + (V - 1));
        }
        public void showCycle()
        {
            foreach (var c in cycle) Console.WriteLine(c);
        }

    }
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

using System;

using System.Collections.Generic;

using System.Diagnostics;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace BipartiteGraphExample

{

public class Bipartite

{

public bool isBipartite { get; set; } // is the graph bipartite?

private bool[] color; // color[v] gives vertices on one side of bipartition

private bool[] marked; // marked[v] = true if v has been visited in DFS

private int[] edgeTo; // edgeTo[v] = last edge on path to v

public Stack<int> cycle; // odd-length cycle

/**

* Determines whether an undirected graph is bipartite and finds either a

* bipartition or an odd-length cycle.

* @param G the graph

public Bipartite(Graph G)

{

isBipartite = true;

color = new bool [G.V];

marked = new bool [G.V];

edgeTo = new int[G.V];

for (int v = 0; v < G.V; v++)

{

if (!marked[v])

{

dfs(G, v);

}

Trace.Assert(check(G));

}

private void dfs(Graph G, int v)

{

marked[v] = true;

foreach (int w in G.adjVerticles(v))

{

// short circuit if odd-length cycle found

if (cycle != null) return;

// found uncolored vertex, so recur

if (!marked[w])

{

edgeTo[w] = v;

color[w] = !color[v];

dfs(G, w);

}

// if v-w create an odd-length cycle, find it

else if (color[w] == color[v])

{

isBipartite = false;

cycle = new Stack<int>();

cycle.Push(w); // don't need this unless you want to include start vertex twice

for (int x = v; x != w; x = edgeTo[x])

{

cycle.Push(x);

}

cycle.Push(w);

}

public bool getColor(int v)

{

validateVertex(v);

if (!isBipartite)

throw new ArgumentException("graph is not bipartite");

return color[v];

}

/**

* Returns an odd-length cycle if the graph is not bipartite, and

* {@code null} otherwise.

* @return an odd-length cycle if the graph is not bipartite

* (and hence has an odd-length cycle), and {@code null}

* otherwise

public IEnumerable<int> oddCycle()

{

return cycle;

}

private bool check(Graph G)

{

// graph is bipartite

if (isBipartite)

{

for (int v = 0; v < G.V; v++)

{

foreach (int w in G.adjVerticles(v))

{

if (color[v] == color[w])

{

Console.WriteLine("edge %d-%d with %d and %d in same side of bipartition\n", v, w, v, w);

return false;

}

// graph has an odd-length cycle

else

{

// verify cycle

int first = -1, last = -1;

foreach (int v in oddCycle())

{

if (first == -1) first = v;

last = v;

}

if (first != last)

{

Console.WriteLine("cycle begins with %d and ends with %d\n", first, last);

return false;

}

return true;

}

// throw an IllegalArgumentException unless {@code 0 <= v < V}

private void validateVertex(int v)

{

int V = marked.Length;

if (v < 0 || v >= V)

throw new ArgumentException("vertex " + v + " is not between 0 and " + (V - 1));

}

public void showCycle()

{

foreach (var c in cycle) Console.WriteLine(c);

}

Graph.cs

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace BipartiteGraphExample
{
    public class Graph
    {
        // private static final String NEWLINE = System.getProperty("line.separator");

        public int V { get; set; }
        public int E { get; set; }
        public Bag<int>[] adj { get; set; }


        /**
         * Initializes an empty graph with {@code V} vertices and 0 edges.
         * param V the number of vertices
         *
         * @param  V number of vertices
         * @throws IllegalArgumentException if {@code V < 0}
         */
        public Graph(int V)
        {
            if (V < 0) throw new ArgumentException("Number of vertices must be nonnegative");
            this.V = V;
            this.E = 0;
            adj = new Bag<int>[V];
            for (int v = 0; v < V; v++)
            {
                adj[v] = new Bag<int>();
            }
        }


        /**  
   * Initializes a graph from the specified input stream.
   * The format is the number of vertices <em>V</em>,
   * followed by the number of edges <em>E</em>,
   * followed by <em>E</em> pairs of vertices, with each entry separated by whitespace.
   *
   * @param  in the input stream
   * @throws IllegalArgumentException if the endpoints of any edge are not in prescribed range
   * @throws IllegalArgumentException if the number of vertices or edges is negative
   * @throws IllegalArgumentException if the input stream is in the wrong format
   */

        public Graph(string filepath)
        {
            try
            {
                using (StreamReader sr = new StreamReader(filepath))
                {
                    int i = 0;

                    while (sr.Peek() >= 0)
                    {
                        // reading number of verticles
                        if (i == 0)
                        {
                            V = Convert.ToInt32(sr.ReadLine());
                            adj = new Bag<int>[V];
                            for (int v = 0; v < V; v++)
                            {
                                adj[v] = new Bag<int>();
                            }
                            i++;
                        }
                        // reading number of edges
                        else
                            if (i == 1)
                        {
                            E = Convert.ToInt32(sr.ReadLine());
                            if (E < 0) throw new ArgumentException("number of edges in a Graph must be nonnegative");
                            i++;
                        }
                        else
                        {
                            //  for (int j = 0; j < E; j++)
                            //   {
                            string s = sr.ReadLine();
                            Char delimiter = ' ';
                            String[] substrings = s.Split(delimiter);
                            int v = Convert.ToInt32(substrings[0]);
                            int w = Convert.ToInt32(substrings[1]);
                            validateVertex(v);
                            validateVertex(w);
                            addEdge(v, w);
                        }

                    }
                }
            }
            catch (Exception e) { Console.WriteLine("The process failed: {0}", e.ToString()); };



        }
        // throw an IllegalArgumentException unless {@code 0 <= v < V}
        public void validateVertex(int v)
        {
            if (v < 0 || v >= V)
                throw new ArgumentException("vertex " + v + " is not between 0 and " + (V - 1));
        }
        /**
 * Adds the undirected edge v-w to this graph.
 *
 * @param  v one vertex in the edge
 * @param  w the other vertex in the edge
 * @throws IllegalArgumentException unless both {@code 0 <= v < V} and {@code 0 <= w < V}
 */
        public void addEdge(int v, int w)
        {
            validateVertex(v);
            validateVertex(w);
            E++;
            adj[v].push(w);
            adj[w].push(v);
        }
        /**
   * Returns the vertices adjacent to vertex {@code v}.
   *
   * @param  v the vertex
   * @return the vertices adjacent to vertex {@code v}, as an iterable
   * @throws IllegalArgumentException unless {@code 0 <= v < V}
   */
        public IEnumerable<int> adjVerticles(int v)
        {
            validateVertex(v);
            return adj[v];
        }
        /**
   * Returns the degree of vertex {@code v}.
   *
   * @param  v the vertex
   * @return the degree of vertex {@code v}
   * @throws IllegalArgumentException unless {@code 0 <= v < V}
   */
        public int degree(int v)
        {
            validateVertex(v);
            return adj[v].size();
        }
        /**
 * Returns a string representation of this graph.
 *
 * @return the number of vertices <em>V</em>, followed by the number of edges <em>E</em>,
 *         followed by the <em>V</em> adjacency lists
 */
        public String toString()
        {
            StringBuilder s = new StringBuilder();
            s.Append(V + " vertices, " + E + " edges " + "\n");
            for (int v = 0; v < V; v++)
            {
                s.Append(v + ": ");
                foreach (int w in adj[v])
                {
                    s.Append(w + " ");
                }
                s.Append("\n");
            }
            return s.ToString();
        }

    }
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

using System;

using System.Collections.Generic;

using System.IO;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace BipartiteGraphExample

{

public class Graph

{

// private static final String NEWLINE = System.getProperty("line.separator");

public int V { get; set; }

public int E { get; set; }

public Bag<int>[] adj { get; set; }

/**

* Initializes an empty graph with {@code V} vertices and 0 edges.

* param V the number of vertices

* @param V number of vertices

* @throws IllegalArgumentException if {@code V < 0}

public Graph(int V)

{

if (V < 0) throw new ArgumentException("Number of vertices must be nonnegative");

this.V = V;

this.E = 0;

adj = new Bag<int>[V];

for (int v = 0; v < V; v++)

{

adj[v] = new Bag<int>();

}

/**

* Initializes a graph from the specified input stream.

* The format is the number of vertices V,

* followed by the number of edges E,

* followed by E pairs of vertices, with each entry separated by whitespace.

* @param in the input stream

* @throws IllegalArgumentException if the endpoints of any edge are not in prescribed range

* @throws IllegalArgumentException if the number of vertices or edges is negative

* @throws IllegalArgumentException if the input stream is in the wrong format

public Graph(string filepath)

{

try

{

using (StreamReader sr = new StreamReader(filepath))

{

int i = 0;

while (sr.Peek() >= 0)

{

// reading number of verticles

if (i == 0)

{

V = Convert.ToInt32(sr.ReadLine());

adj = new Bag<int>[V];

for (int v = 0; v < V; v++)

{

adj[v] = new Bag<int>();

}

i++;

}

// reading number of edges

else

if (i == 1)

{

E = Convert.ToInt32(sr.ReadLine());

if (E < 0) throw new ArgumentException("number of edges in a Graph must be nonnegative");

i++;

}

else

{

// for (int j = 0; j < E; j++)

// {

string s = sr.ReadLine();

Char delimiter = ' ';

String[] substrings = s.Split(delimiter);

int v = Convert.ToInt32(substrings[0]);

int w = Convert.ToInt32(substrings[1]);

validateVertex(v);

validateVertex(w);

addEdge(v, w);

}

catch (Exception e) { Console.WriteLine("The process failed: {0}", e.ToString()); };

}

// throw an IllegalArgumentException unless {@code 0 <= v < V}

public void validateVertex(int v)

{

if (v < 0 || v >= V)

throw new ArgumentException("vertex " + v + " is not between 0 and " + (V - 1));

}

/**

* Adds the undirected edge v-w to this graph.

* @param v one vertex in the edge

* @param w the other vertex in the edge

* @throws IllegalArgumentException unless both {@code 0 <= v < V} and {@code 0 <= w < V}

public void addEdge(int v, int w)

{

validateVertex(v);

validateVertex(w);

E++;

adj[v].push(w);

adj[w].push(v);

}

/**

* Returns the vertices adjacent to vertex {@code v}.

* @param v the vertex

* @return the vertices adjacent to vertex {@code v}, as an iterable

* @throws IllegalArgumentException unless {@code 0 <= v < V}

public IEnumerable<int> adjVerticles(int v)

{

validateVertex(v);

return adj[v];

}

/**

* Returns the degree of vertex {@code v}.

* @param v the vertex

* @return the degree of vertex {@code v}

* @throws IllegalArgumentException unless {@code 0 <= v < V}

public int degree(int v)

{

validateVertex(v);

return adj[v].size();

}

/**

* Returns a string representation of this graph.

* @return the number of vertices V, followed by the number of edges E,

* followed by the V adjacency lists

public String toString()

{

StringBuilder s = new StringBuilder();

s.Append(V + " vertices, " + E + " edges " + "\n");

for (int v = 0; v < V; v++)

{

s.Append(v + ": ");

foreach (int w in adj[v])

{

s.Append(w + " ");

}

s.Append("\n");

}

return s.ToString();

}

Bag.cs

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace BipartiteGraphExample
{
    public class Bag<T> : IEnumerable<T>
    {

        Node<T> first;
        private int N;
        class Node<T>
        {
            public T item;
            public Node<T> next;
        }

        public bool isEmpty() { return (first == null) || (N == 0); }
        public int size() { return N; }
        public void push(T item)
        {
            // adding to the begining
            Node<T> oldfirst = first;
            first = new Node<T>();
            first.item = item;
            first.next = oldfirst;
            N++;
        }

        /* // no pop in stack method
        public T pop()
        {
            T item = first.item;
            first = first.next;
            N--;
            return item;
        }
        */

        System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()
        {
            return GetEnumerator();
        }

        public IEnumerator<T> GetEnumerator()
        {
            var node = first;
            while (node != null)
            {
                yield return node.item;
                node = node.next;
            }
        }

    }
}

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace BipartiteGraphExample

{

public class Bag<T> : IEnumerable<T>

{

Node<T> first;

private int N;

class Node<T>

{

public T item;

public Node<T> next;

}

public bool isEmpty() { return (first == null) || (N == 0); }

public int size() { return N; }

public void push(T item)

{

// adding to the begining

Node<T> oldfirst = first;

first = new Node<T>();

first.item = item;

first.next = oldfirst;

N++;

}

/* // no pop in stack method

public T pop()

{

T item = first.item;

first = first.next;

N--;

return item;

}

System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()

{

return GetEnumerator();

}

public IEnumerator<T> GetEnumerator()

{

var node = first;

while (node != null)

{

yield return node.item;

node = node.next;

}

test

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace BipartiteGraphExample
{
    class Program
    {
        static void Main(string[] args)
        {
            Graph g = new Graph("tinyG.txt");
            Console.WriteLine(g.toString());
            Bipartite b = new Bipartite(g);
            if (b.isBipartite) Console.WriteLine("Yes! Bipartite!");
            else Console.WriteLine("Not Bipartite");
            b.showCycle();
            Console.ReadLine();
        }
    }
}

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace BipartiteGraphExample

{

class Program

{

static void Main(string[] args)

{

Graph g = new Graph("tinyG.txt");

Console.WriteLine(g.toString());

Bipartite b = new Bipartite(g);

if (b.isBipartite) Console.WriteLine("Yes! Bipartite!");

else Console.WriteLine("Not Bipartite");

b.showCycle();

Console.ReadLine();

}

Posted in C# | Leave a comment

C#. DegreeOfSeparation

Posted on 03.10.2017 by Stanislav_Panteleev

Source in Sagewick Git strange thing but realized it…, shows shortest ways from source to other points, using BFS

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace SymbolGraphExample
{
    class DegreesOfSeparation
    {
        String filepath { get; set; }
        char delimiter { get; set; }
        String source { get; set; }
        SymbolGraph sg;
        Graph G;


        public DegreesOfSeparation(string afilename, char adelimiter, string asource)
        {
            filepath = afilename;
            delimiter = adelimiter;
            source = asource;
            sg = new SymbolGraph(filepath, delimiter);
            G = sg.getGraph();

        }

        public void Execute()
        {
            if (!sg.contains(source))
            {
                Console.WriteLine(source + " not in database.");
                return;
            }
            int s = sg.indexOf(source);
            BreadthFirstPaths bfs = new BreadthFirstPaths(G, s);

            using (StreamReader sr = new StreamReader(filepath))
            {
                Queue<string> alreadyProcessed = new Queue<string>();
                while (sr.Peek() >= 0)
                {
                    String sink = sr.ReadLine();
                    String[] substrings = sink.Split(delimiter);
                   
                    foreach (string substring in substrings)
                    {
                        if (sg.contains(substring))
                        {
                            int t = sg.indexOf(substring);
                            if (bfs.hasPathTo(t)&&(substring!=source)&&(!alreadyProcessed.Contains(substring)))
                            {
                                Console.WriteLine("");
                                Console.Write("path to "+substring+" : ");
                                alreadyProcessed.Enqueue(substring);
                                foreach (int v in bfs.pathTo(t))
                                {
                                    Console.Write("   " + sg.nameOf(v));
                                }
                            }
                        }

                    }
                }
            }
        }

    }
}

using System;

using System.Collections.Generic;

using System.IO;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace SymbolGraphExample

{

class DegreesOfSeparation

{

String filepath { get; set; }

char delimiter { get; set; }

String source { get; set; }

SymbolGraph sg;

Graph G;

public DegreesOfSeparation(string afilename, char adelimiter, string asource)

{

filepath = afilename;

delimiter = adelimiter;

source = asource;

sg = new SymbolGraph(filepath, delimiter);

G = sg.getGraph();

}

public void Execute()

{

if (!sg.contains(source))

{

Console.WriteLine(source + " not in database.");

return;

}

int s = sg.indexOf(source);

BreadthFirstPaths bfs = new BreadthFirstPaths(G, s);

using (StreamReader sr = new StreamReader(filepath))

{

Queue<string> alreadyProcessed = new Queue<string>();

while (sr.Peek() >= 0)

{

String sink = sr.ReadLine();

String[] substrings = sink.Split(delimiter);

foreach (string substring in substrings)

{

if (sg.contains(substring))

{

int t = sg.indexOf(substring);

if (bfs.hasPathTo(t)&&(substring!=source)&&(!alreadyProcessed.Contains(substring)))

{

Console.WriteLine("");

Console.Write("path to "+substring+" : ");

alreadyProcessed.Enqueue(substring);

foreach (int v in bfs.pathTo(t))

{

Console.Write(" " + sg.nameOf(v));

}

Posted in C# | Leave a comment

C#.Algo.SymbolGraph

Posted on 03.10.2017 by Stanislav_Panteleev

Git SymbolGraph.cs // switched to C# Dictionary in spite of SequentialSymbolTable

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace SymbolGraphExample
{


    public class SymbolGraph
    {
      //  private SequentialSearchST<String, int> st;  // string -> index 
        private Dictionary<string, int> d;
        private string[] keys;           // index  -> string
        private Graph graph;             // the underlying graph

        public SymbolGraph(string filepath, char delimiter)
        {
            //st = new SequentialSearchST<String, int>();
            d = new Dictionary<string, int>();          

            try
            {
                using (StreamReader sr = new StreamReader(filepath))
                {
                    while (sr.Peek() >= 0)
                    {
                        string s = sr.ReadLine();
                        string[] substrings = s.Split(delimiter);
                        foreach (var substring in substrings)
                        {
                            //if (!st.contains(substring))
                            if (!d.ContainsKey(substring))
                            {
                                //st.put(substring, st.size()+1);
                                int c = d.Count;
                                d.Add(substring, c);
                                //Console.WriteLine(substring+" "+st.size());
                                Console.WriteLine(substring + " " + c);
                                //Console.WriteLine();
                                //st.ConsoleDisplay();
                            }
                        }
                        
                    }
                }
            }

            catch (Exception e) { Console.WriteLine("The process failed: {0}", e.ToString()); };

            // inverted index to get string keys in an aray
            //keys = new string[st.size()];
            keys = new string[d.Count];
            foreach (KeyValuePair<string, int> entry in d)
            {
                // do something with entry.Value or entry.Key
                keys[entry.Value] = entry.Key;
            }

            //test
            //foreach (string k in keys) Console.WriteLine(k); 

            /* deprecated
            foreach (string name in st.keys())
            {
                keys[st.get(name)] = name;
            }
            */

            // building graph in second reading file
            // graph = new Graph(st.size());
            graph = new Graph(d.Count);
            try
            {
                using (StreamReader sr = new StreamReader(filepath))
                {
                    while (sr.Peek() >= 0)
                    {
                        string s = sr.ReadLine();
                        string[] substrings = s.Split(delimiter);
                        //int v = st.get(substrings[0]);
                        //int v = d.FirstOrDefault(x=>x.Key== substrings[0]).Value;   //st.get(substrings[0]);
                        int v = d[substrings[0]];
                        for (var i = 1; i < substrings.Length; i++)
                        {
                            //int w  -1;
                            //int w = d.First(x => x.Key == substrings[i]).Value;  //st.get(substrings[i]);
                            int w = d[substrings[i]];
                            //if (w!=v)
                                graph.addEdge(v,w);
                        }                        
                    }
                }
            }

            catch (Exception e) { Console.WriteLine("The process failed: {0}", e.ToString()); };

        }
        /**
 * Does the graph contain the vertex named {@code s}?
 * @param s the name of a vertex
 * @return {@code true} if {@code s} is the name of a vertex, and {@code false} otherwise
 */
        public bool contains(String s)
        {
            // return d.FirstOrDefault(x => x.Key == s).Key!=null; //st.contains(s);
            return d.ContainsKey(s); //st.contains(s);
        }
        /**
   * Returns the integer associated with the vertex named {@code s}.
   * @param s the name of a vertex
   * @return the integer (between 0 and <em>V</em> - 1) associated with the vertex named {@code s}
   */
        public int indexOf(String s)
        {
            return d.FirstOrDefault(x => x.Key == s).Value;//st.get(s);            
        }
        /**
 * Returns the name of the vertex associated with the integer {@code v}.
 * @param  v the integer corresponding to a vertex (between 0 and <em>V</em> - 1) 
 * @throws IllegalArgumentException unless {@code 0 <= v < V}
 * @return the name of the vertex associated with the integer {@code v}
 */
        public String nameOf(int v)
        {
            validateVertex(v);
            return keys[v];
        }
        /**
 * Returns the graph assoicated with the symbol graph. It is the client's responsibility
 * not to mutate the graph.
 * @return the graph associated with the symbol graph
 */
        public Graph getGraph()
        {
            return graph;
        }
        // throw an IllegalArgumentException unless {@code 0 <= v < V}
        private void validateVertex(int v)
        {
            int V = graph.V;
            if (v < 0 || v >= V)
                throw new ArgumentException("vertex " + v + " is not between 0 and " + (V - 1));
        }

        public string toString()
        {
            StringBuilder s = new StringBuilder();
            s.Append(graph.V + " vertices, " + graph.E + " edges " + "\n");
            
            for (int v = 0; v < graph.V; v++)
            {
                s.Append(nameOf(v) + ": ");
                foreach (int w in graph.adjVerticles(v))
                {                    
                    s.Append(nameOf(w) + " ");
                }
                s.Append("\n");
            }
            return s.ToString();
        }

    }
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

using System;

using System.Collections.Generic;

using System.IO;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace SymbolGraphExample

{

public class SymbolGraph

{

// private SequentialSearchST<String, int> st; // string -> index

private Dictionary<string, int> d;

private string[] keys; // index -> string

private Graph graph; // the underlying graph

public SymbolGraph(string filepath, char delimiter)

{

//st = new SequentialSearchST<String, int>();

d = new Dictionary<string, int>();

try

{

using (StreamReader sr = new StreamReader(filepath))

{

while (sr.Peek() >= 0)

{

string s = sr.ReadLine();

string[] substrings = s.Split(delimiter);

foreach (var substring in substrings)

{

//if (!st.contains(substring))

if (!d.ContainsKey(substring))

{

//st.put(substring, st.size()+1);

int c = d.Count;

d.Add(substring, c);

//Console.WriteLine(substring+" "+st.size());

Console.WriteLine(substring + " " + c);

//Console.WriteLine();

//st.ConsoleDisplay();

}

catch (Exception e) { Console.WriteLine("The process failed: {0}", e.ToString()); };

// inverted index to get string keys in an aray

//keys = new string[st.size()];

keys = new string[d.Count];

foreach (KeyValuePair<string, int> entry in d)

{

// do something with entry.Value or entry.Key

keys[entry.Value] = entry.Key;

}

//test

//foreach (string k in keys) Console.WriteLine(k);

/* deprecated

foreach (string name in st.keys())

{

keys[st.get(name)] = name;

}

// building graph in second reading file

// graph = new Graph(st.size());

graph = new Graph(d.Count);

try

{

using (StreamReader sr = new StreamReader(filepath))

{

while (sr.Peek() >= 0)

{

string s = sr.ReadLine();

string[] substrings = s.Split(delimiter);

//int v = st.get(substrings[0]);

//int v = d.FirstOrDefault(x=>x.Key== substrings[0]).Value; //st.get(substrings[0]);

int v = d[substrings[0]];

for (var i = 1; i < substrings.Length; i++)

{

//int w -1;

//int w = d.First(x => x.Key == substrings[i]).Value; //st.get(substrings[i]);

int w = d[substrings[i]];

//if (w!=v)

graph.addEdge(v,w);

}

catch (Exception e) { Console.WriteLine("The process failed: {0}", e.ToString()); };

}

/**

* Does the graph contain the vertex named {@code s}?

* @param s the name of a vertex

* @return {@code true} if {@code s} is the name of a vertex, and {@code false} otherwise

public bool contains(String s)

{

// return d.FirstOrDefault(x => x.Key == s).Key!=null; //st.contains(s);

return d.ContainsKey(s); //st.contains(s);

}

/**

* Returns the integer associated with the vertex named {@code s}.

* @param s the name of a vertex

* @return the integer (between 0 and V - 1) associated with the vertex named {@code s}

public int indexOf(String s)

{

return d.FirstOrDefault(x => x.Key == s).Value;//st.get(s);

}

/**

* Returns the name of the vertex associated with the integer {@code v}.

* @param v the integer corresponding to a vertex (between 0 and V - 1)

* @throws IllegalArgumentException unless {@code 0 <= v < V}

* @return the name of the vertex associated with the integer {@code v}

public String nameOf(int v)

{

validateVertex(v);

return keys[v];

}

/**

* Returns the graph assoicated with the symbol graph. It is the client's responsibility

* not to mutate the graph.

* @return the graph associated with the symbol graph

public Graph getGraph()

{

return graph;

}

// throw an IllegalArgumentException unless {@code 0 <= v < V}

private void validateVertex(int v)

{

int V = graph.V;

if (v < 0 || v >= V)

throw new ArgumentException("vertex " + v + " is not between 0 and " + (V - 1));

}

public string toString()

{

StringBuilder s = new StringBuilder();

s.Append(graph.V + " vertices, " + graph.E + " edges " + "\n");

for (int v = 0; v < graph.V; v++)

{

s.Append(nameOf(v) + ": ");

foreach (int w in graph.adjVerticles(v))

{

s.Append(nameOf(w) + " ");

}

s.Append("\n");

}

return s.ToString();

}

SymbolTable – doesn’t work to symbol graph because of contains method

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace SymbolGraphExample
{
    class SymbolTable
    {
    }

    public class SequentialSearchST<Key, Value> : IEnumerable<Key> where Value:IComparable
    {
        private int n;           // number of key-value pairs
        private Node first;      // the linked list of key-value pairs

        // a helper linked list data type
        private class Node
        {
            public Key key { get; set; }
            public Value val { get; set; }
            public Node next { get; set; }

            public Node(Key key, Value val, Node next)
            {
                this.key = key;
                this.val = val;
                this.next = next;
            }
        }

        /**
  * Initializes an empty symbol table.
  */
        public SequentialSearchST()
        {
        }

        /**
   * Returns the number of key-value pairs in this symbol table.
   *
   * @return the number of key-value pairs in this symbol table
   */
        public int size()
        {
            return n;
        }
        /**
   * Returns true if this symbol table is empty.
   *
   * @return {@code true} if this symbol table is empty;
   *         {@code false} otherwise
   */
        public bool isEmpty()
        {
            return size() == 0;
        }

        /**
  * Returns true if this symbol table contains the specified key.
  *
  * @param  key the key
  * @return {@code true} if this symbol table contains {@code key};
  *         {@code false} otherwise
  * @throws IllegalArgumentException if {@code key} is {@code null}
  */
        public bool contains(Key key)
        {
            if (key == null) throw new ArgumentException("argument to contains() is null");            
            Value r = get(key);
            return (r.CompareTo(default(Value)) != 0);
            
        }
        /**
   * Returns the value associated with the given key in this symbol table.
   *
   * @param  key the key
   * @return the value associated with the given key if the key is in the symbol table
   *     and {@code null} if the key is not in the symbol table
   * @throws IllegalArgumentException if {@code key} is {@code null}
   */
        public Value get(Key key)
        {
            if (key == null) throw new ArgumentException("argument to get() is null");
            for (Node x = first; x != null; x = x.next)
            {
                if (key.Equals(x.key))
                    return x.val;
            }
            return default(Value);
        }
        /**
     * Inserts the specified key-value pair into the symbol table, overwriting the old 
     * value with the new value if the symbol table already contains the specified key.
     * Deletes the specified key (and its associated value) from this symbol table
     * if the specified value is {@code null}.
     *
     * @param  key the key
     * @param  val the value
     * @throws IllegalArgumentException if {@code key} is {@code null}
     */
        public void put(Key key, Value val)
        {
            if (key == null) throw new ArgumentException("first argument to put() is null");
            if (val == null)
            {
                delete(key);
                return;
            }

            for (Node x = first; x != null; x = x.next)
            {
                if (key.Equals(x.key))
                {
                    x.val = val;
                    return;
                }
            }
            first = new Node(key, val, first);
            n++;
        }
        /**
    * Removes the specified key and its associated value from this symbol table     
    * (if the key is in this symbol table).    
    *
    * @param  key the key
    * @throws IllegalArgumentException if {@code key} is {@code null}
    */
        public void delete(Key key)
        {
            if (key == null) throw new ArgumentException("argument to delete() is null");
            first = delete(first, key);
        }

        // delete key in linked list beginning at Node x
        // warning: function call stack too large if table is large
        private Node delete(Node x, Key key)
        {
            if (x == null) return null;
            if (key.Equals(x.key))
            {
                n--;
                return x.next;
            }
            x.next = delete(x.next, key); // recursion
            return x;
        }

        // iteraror
        System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()
        {
            return GetEnumerator();
        }


        public IEnumerator<Key> GetEnumerator()
        {
            var node = first;
            while (node != null)
            {
                yield return node.key;
                node = node.next;
            }
        }

        /**
   * Returns all keys in the symbol table as an {@code Iterable}.
   * To iterate over all of the keys in the symbol table named {@code st},
   * use the foreach notation: {@code for (Key key : st.keys())}.
   *
   * @return all keys in the symbol table
   */
        public IEnumerable<Key> keys()
        {
            Queue<Key> queue = new Queue<Key>();
            for (Node x = first; x != null; x = x.next)
                queue.Enqueue(x.key);
            return queue;
        }

        //
        public void ConsoleDisplay()
        {
            Console.WriteLine();
            Console.WriteLine("key" + " " + "val");
            for (Node n = first; n != null; n = n.next)
            {
                Console.WriteLine(" " + n.key + "  " + n.val);
            }
        }

    }
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace SymbolGraphExample

{

class SymbolTable

{

}

public class SequentialSearchST<Key, Value> : IEnumerable<Key> where Value:IComparable

{

private int n; // number of key-value pairs

private Node first; // the linked list of key-value pairs

// a helper linked list data type

private class Node

{

public Key key { get; set; }

public Value val { get; set; }

public Node next { get; set; }

public Node(Key key, Value val, Node next)

{

this.key = key;

this.val = val;

this.next = next;

}

/**

* Initializes an empty symbol table.

public SequentialSearchST()

{

}

/**

* Returns the number of key-value pairs in this symbol table.

* @return the number of key-value pairs in this symbol table

public int size()

{

return n;

}

/**

* Returns true if this symbol table is empty.

* @return {@code true} if this symbol table is empty;

* {@code false} otherwise

public bool isEmpty()

{

return size() == 0;

}

/**

* Returns true if this symbol table contains the specified key.

* @param key the key

* @return {@code true} if this symbol table contains {@code key};

* {@code false} otherwise

* @throws IllegalArgumentException if {@code key} is {@code null}

public bool contains(Key key)

{

if (key == null) throw new ArgumentException("argument to contains() is null");

Value r = get(key);

return (r.CompareTo(default(Value)) != 0);

}

/**

* Returns the value associated with the given key in this symbol table.

* @param key the key

* @return the value associated with the given key if the key is in the symbol table

* and {@code null} if the key is not in the symbol table

* @throws IllegalArgumentException if {@code key} is {@code null}

public Value get(Key key)

{

if (key == null) throw new ArgumentException("argument to get() is null");

for (Node x = first; x != null; x = x.next)

{

if (key.Equals(x.key))

return x.val;

}

return default(Value);

}

/**

* Inserts the specified key-value pair into the symbol table, overwriting the old

* value with the new value if the symbol table already contains the specified key.

* Deletes the specified key (and its associated value) from this symbol table

* if the specified value is {@code null}.

* @param key the key

* @param val the value

* @throws IllegalArgumentException if {@code key} is {@code null}

public void put(Key key, Value val)

{

if (key == null) throw new ArgumentException("first argument to put() is null");

if (val == null)

{

delete(key);

return;

}

for (Node x = first; x != null; x = x.next)

{

if (key.Equals(x.key))

{

x.val = val;

return;

}

first = new Node(key, val, first);

n++;

}

/**

* Removes the specified key and its associated value from this symbol table

* (if the key is in this symbol table).

* @param key the key

* @throws IllegalArgumentException if {@code key} is {@code null}

public void delete(Key key)

{

if (key == null) throw new ArgumentException("argument to delete() is null");

first = delete(first, key);

}

// delete key in linked list beginning at Node x

// warning: function call stack too large if table is large

private Node delete(Node x, Key key)

{

if (x == null) return null;

if (key.Equals(x.key))

{

n--;

return x.next;

}

x.next = delete(x.next, key); // recursion

return x;

}

// iteraror

System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()

{

return GetEnumerator();

}

public IEnumerator<Key> GetEnumerator()

{

var node = first;

while (node != null)

{

yield return node.key;

node = node.next;

}

/**

* Returns all keys in the symbol table as an {@code Iterable}.

* To iterate over all of the keys in the symbol table named {@code st},

* use the foreach notation: {@code for (Key key : st.keys())}.

* @return all keys in the symbol table

public IEnumerable<Key> keys()

{

Queue<Key> queue = new Queue<Key>();

for (Node x = first; x != null; x = x.next)

queue.Enqueue(x.key);

return queue;

}

public void ConsoleDisplay()

{

Console.WriteLine();

Console.WriteLine("key" + " " + "val");

for (Node n = first; n != null; n = n.next)

{

Console.WriteLine(" " + n.key + " " + n.val);

}

Graph.cs

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace SymbolGraphExample
{
    public class Graph
    {
        // private static final String NEWLINE = System.getProperty("line.separator");

        public int V { get; set; }
        public int E { get; set; }
        public Bag<int>[] adj { get; set; }


        /**
         * Initializes an empty graph with {@code V} vertices and 0 edges.
         * param V the number of vertices
         *
         * @param  V number of vertices
         * @throws IllegalArgumentException if {@code V < 0}
         */
        public Graph(int V)
        {
            if (V < 0) throw new ArgumentException("Number of vertices must be nonnegative");
            this.V = V;
            this.E = 0;
            adj = new Bag<int>[V];
            for (int v = 0; v < V; v++)
            {
                adj[v] = new Bag<int>();
            }
        }


        /**  
   * Initializes a graph from the specified input stream.
   * The format is the number of vertices <em>V</em>,
   * followed by the number of edges <em>E</em>,
   * followed by <em>E</em> pairs of vertices, with each entry separated by whitespace.
   *
   * @param  in the input stream
   * @throws IllegalArgumentException if the endpoints of any edge are not in prescribed range
   * @throws IllegalArgumentException if the number of vertices or edges is negative
   * @throws IllegalArgumentException if the input stream is in the wrong format
   */

        public Graph(string filepath)
        {
            try
            {
                using (StreamReader sr = new StreamReader(filepath))
                {
                    int i = 0;

                    while (sr.Peek() >= 0)
                    {
                        // reading number of verticles
                        if (i == 0)
                        {
                            V = Convert.ToInt32(sr.ReadLine());
                            adj = new Bag<int>[V];
                            for (int v = 0; v < V; v++)
                            {
                                adj[v] = new Bag<int>();
                            }
                            i++;
                        }
                        // reading number of edges
                        else
                            if (i == 1)
                        {
                            E = Convert.ToInt32(sr.ReadLine());
                            if (E < 0) throw new ArgumentException("number of edges in a Graph must be nonnegative");
                            i++;
                        }
                        else
                        {
                            //  for (int j = 0; j < E; j++)
                            //   {
                            string s = sr.ReadLine();
                            Char delimiter = ' ';
                            String[] substrings = s.Split(delimiter);
                            int v = Convert.ToInt32(substrings[0]);
                            int w = Convert.ToInt32(substrings[1]);
                            validateVertex(v);
                            validateVertex(w);
                            addEdge(v, w);
                        }

                    }
                }
            }
            catch (Exception e) { Console.WriteLine("The process failed: {0}", e.ToString()); };



        }
        // throw an IllegalArgumentException unless {@code 0 <= v < V}
        public void validateVertex(int v)
        {
            if (v < 0 || v >= V)
                throw new ArgumentException("vertex " + v + " is not between 0 and " + (V - 1));
        }
        /**
 * Adds the undirected edge v-w to this graph.
 *
 * @param  v one vertex in the edge
 * @param  w the other vertex in the edge
 * @throws IllegalArgumentException unless both {@code 0 <= v < V} and {@code 0 <= w < V}
 */
        public void addEdge(int v, int w)
        {
            validateVertex(v);
            validateVertex(w);
            E++;
            adj[v].push(w);
            adj[w].push(v);
        }
        /**
   * Returns the vertices adjacent to vertex {@code v}.
   *
   * @param  v the vertex
   * @return the vertices adjacent to vertex {@code v}, as an iterable
   * @throws IllegalArgumentException unless {@code 0 <= v < V}
   */
        public IEnumerable<int> adjVerticles(int v)
        {
            validateVertex(v);
            return adj[v];
        }
        /**
   * Returns the degree of vertex {@code v}.
   *
   * @param  v the vertex
   * @return the degree of vertex {@code v}
   * @throws IllegalArgumentException unless {@code 0 <= v < V}
   */
        public int degree(int v)
        {
            validateVertex(v);
            return adj[v].size();
        }
        /**
 * Returns a string representation of this graph.
 *
 * @return the number of vertices <em>V</em>, followed by the number of edges <em>E</em>,
 *         followed by the <em>V</em> adjacency lists
 */
        public String toString()
        {
            StringBuilder s = new StringBuilder();
            s.Append(V + " vertices, " + E + " edges " + "\n");
            for (int v = 0; v < V; v++)
            {
                s.Append(v + ": ");
                foreach (int w in adj[v])
                {
                    s.Append(w + " ");
                }
                s.Append("\n");
            }
            return s.ToString();
        }

    }
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

using System;

using System.Collections.Generic;

using System.IO;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace SymbolGraphExample

{

public class Graph

{

// private static final String NEWLINE = System.getProperty("line.separator");

public int V { get; set; }

public int E { get; set; }

public Bag<int>[] adj { get; set; }

/**

* Initializes an empty graph with {@code V} vertices and 0 edges.

* param V the number of vertices

* @param V number of vertices

* @throws IllegalArgumentException if {@code V < 0}

public Graph(int V)

{

if (V < 0) throw new ArgumentException("Number of vertices must be nonnegative");

this.V = V;

this.E = 0;

adj = new Bag<int>[V];

for (int v = 0; v < V; v++)

{

adj[v] = new Bag<int>();

}

/**

* Initializes a graph from the specified input stream.

* The format is the number of vertices V,

* followed by the number of edges E,

* followed by E pairs of vertices, with each entry separated by whitespace.

* @param in the input stream

* @throws IllegalArgumentException if the endpoints of any edge are not in prescribed range

* @throws IllegalArgumentException if the number of vertices or edges is negative

* @throws IllegalArgumentException if the input stream is in the wrong format

public Graph(string filepath)

{

try

{

using (StreamReader sr = new StreamReader(filepath))

{

int i = 0;

while (sr.Peek() >= 0)

{

// reading number of verticles

if (i == 0)

{

V = Convert.ToInt32(sr.ReadLine());

adj = new Bag<int>[V];

for (int v = 0; v < V; v++)

{

adj[v] = new Bag<int>();

}

i++;

}

// reading number of edges

else

if (i == 1)

{

E = Convert.ToInt32(sr.ReadLine());

if (E < 0) throw new ArgumentException("number of edges in a Graph must be nonnegative");

i++;

}

else

{

// for (int j = 0; j < E; j++)

// {

string s = sr.ReadLine();

Char delimiter = ' ';

String[] substrings = s.Split(delimiter);

int v = Convert.ToInt32(substrings[0]);

int w = Convert.ToInt32(substrings[1]);

validateVertex(v);

validateVertex(w);

addEdge(v, w);

}

catch (Exception e) { Console.WriteLine("The process failed: {0}", e.ToString()); };

}

// throw an IllegalArgumentException unless {@code 0 <= v < V}

public void validateVertex(int v)

{

if (v < 0 || v >= V)

throw new ArgumentException("vertex " + v + " is not between 0 and " + (V - 1));

}

/**

* Adds the undirected edge v-w to this graph.

* @param v one vertex in the edge

* @param w the other vertex in the edge

* @throws IllegalArgumentException unless both {@code 0 <= v < V} and {@code 0 <= w < V}

public void addEdge(int v, int w)

{

validateVertex(v);

validateVertex(w);

E++;

adj[v].push(w);

adj[w].push(v);

}

/**

* Returns the vertices adjacent to vertex {@code v}.

* @param v the vertex

* @return the vertices adjacent to vertex {@code v}, as an iterable

* @throws IllegalArgumentException unless {@code 0 <= v < V}

public IEnumerable<int> adjVerticles(int v)

{

validateVertex(v);

return adj[v];

}

/**

* Returns the degree of vertex {@code v}.

* @param v the vertex

* @return the degree of vertex {@code v}

* @throws IllegalArgumentException unless {@code 0 <= v < V}

public int degree(int v)

{

validateVertex(v);

return adj[v].size();

}

/**

* Returns a string representation of this graph.

* @return the number of vertices V, followed by the number of edges E,

* followed by the V adjacency lists

public String toString()

{

StringBuilder s = new StringBuilder();

s.Append(V + " vertices, " + E + " edges " + "\n");

for (int v = 0; v < V; v++)

{

s.Append(v + ": ");

foreach (int w in adj[v])

{

s.Append(w + " ");

}

s.Append("\n");

}

return s.ToString();

}

Bag.cs

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace SymbolGraphExample
{
    public class Bag<T> : IEnumerable<T>
    {

        Node<T> first;
        private int N;
        class Node<T>
        {
            public T item;
            public Node<T> next;
        }

        public bool isEmpty() { return (first == null) || (N == 0); }
        public int size() { return N; }
        public void push(T item)
        {
            // adding to the begining
            Node<T> oldfirst = first;
            first = new Node<T>();
            first.item = item;
            first.next = oldfirst;
            N++;
        }

        /* // no pop in stack method
        public T pop()
        {
            T item = first.item;
            first = first.next;
            N--;
            return item;
        }
        */

        System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()
        {
            return GetEnumerator();
        }

        public IEnumerator<T> GetEnumerator()
        {
            var node = first;
            while (node != null)
            {
                yield return node.item;
                node = node.next;
            }
        }

    }
}

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace SymbolGraphExample

{

public class Bag<T> : IEnumerable<T>

{

Node<T> first;

private int N;

class Node<T>

{

public T item;

public Node<T> next;

}

public bool isEmpty() { return (first == null) || (N == 0); }

public int size() { return N; }

public void push(T item)

{

// adding to the begining

Node<T> oldfirst = first;

first = new Node<T>();

first.item = item;

first.next = oldfirst;

N++;

}

/* // no pop in stack method

public T pop()

{

T item = first.item;

first = first.next;

N--;

return item;

}

System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()

{

return GetEnumerator();

}

public IEnumerator<T> GetEnumerator()

{

var node = first;

while (node != null)

{

yield return node.item;

node = node.next;

}

Test

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace SymbolGraphExample
{
    class Program
    {
        static void Main(string[] args)
        {
            SymbolGraph sg = new SymbolGraph("Airports.txt", ' ');
            Console.WriteLine(sg.toString());
            Console.ReadLine();
        }
    }
}

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace SymbolGraphExample

{

class Program

{

static void Main(string[] args)

{

SymbolGraph sg = new SymbolGraph("Airports.txt", ' ');

Console.WriteLine(sg.toString());

Console.ReadLine();

}

Posted in C# | Leave a comment

C#. Algo.Graph. ClosableVertexSearch

Posted on 02.10.2017 by Stanislav_Panteleev

testGraph – which verticles are closable? We have 3 groups! 7 and 8 closable ! 0 and 7 not ! Git

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace SearchInGraphExample
{
    public class CC // ClosableComponents
    {
        public bool[] marked;   // marked[v] = has vertex v been marked?
        public int[] id;           // id[v] = id of connected component containing v
        public int[] size;         // size[id] = number of vertices in given component
        public int count;          // number of connected components

        /**
         * Computes the connected components of the undirected graph {@code G}.
         *
         * @param G the undirected graph
         */
        public CC(Graph G)
        {
            marked = new bool[G.V];
            id = new int[G.V];
            size = new int[G.V];
            for (int v = 0; v < G.V; v++)
            {
                if (!marked[v])
                {
                    dfs(G, v);
                    count++;
                }
            }
        }
        
        // depth-first search for a Graph
        private void dfs(Graph G, int v)
        {
            marked[v] = true;
            id[v] = count;
            size[count]++;
            foreach (int w in G.adjVerticles(v))
            {
                if (!marked[w])
                {
                    dfs(G, w);
                }
            }
        }

        /**
 * Returns the component id of the connected component containing vertex {@code v}.
 *
 * @param  v the vertex
 * @return the component id of the connected component containing vertex {@code v}
 * @throws IllegalArgumentException unless {@code 0 <= v < V}
 */
        public int idGroup(int v)
        {
            validateVertex(v);
            return id[v];
        }
        /**
   * Returns the number of vertices in the connected component containing vertex {@code v}.
   *
   * @param  v the vertex
   * @return the number of vertices in the connected component containing vertex {@code v}
   * @throws IllegalArgumentException unless {@code 0 <= v < V}
   */
        public int sizeGroup(int v)
        {
            validateVertex(v);
            return size[id[v]];
        }
        /**
 * Returns the number of connected components in the graph {@code G}.
 *
 * @return the number of connected components in the graph {@code G}
 */
        public int countGroup()
        {
            return count;
        }
        /**
    * Returns true if vertices {@code v} and {@code w} are in the same
    * connected component.
    *
    * @param  v one vertex
    * @param  w the other vertex
    * @return {@code true} if vertices {@code v} and {@code w} are in the same
    *         connected component; {@code false} otherwise
    * @throws IllegalArgumentException unless {@code 0 <= v < V}
    * @throws IllegalArgumentException unless {@code 0 <= w < V}
    */
        public bool connected(int v, int w)
        {
            validateVertex(v);
            validateVertex(w);
            return idGroup(v) == idGroup(w);
        }
        // throw an IllegalArgumentException unless {@code 0 <= v < V}
        private void validateVertex(int v)
        {
            int V = marked.Length;
            if (v < 0 || v >= V)
                throw new ArgumentException("vertex " + v + " is not between 0 and " + (V - 1));
        }
    }
}

100

101

102

103

104

105

106

107

108

109

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace SearchInGraphExample

{

public class CC // ClosableComponents

{

public bool[] marked; // marked[v] = has vertex v been marked?

public int[] id; // id[v] = id of connected component containing v

public int[] size; // size[id] = number of vertices in given component

public int count; // number of connected components

/**

* Computes the connected components of the undirected graph {@code G}.

* @param G the undirected graph

public CC(Graph G)

{

marked = new bool[G.V];

id = new int[G.V];

size = new int[G.V];

for (int v = 0; v < G.V; v++)

{

if (!marked[v])

{

dfs(G, v);

count++;

}

// depth-first search for a Graph

private void dfs(Graph G, int v)

{

marked[v] = true;

id[v] = count;

size[count]++;

foreach (int w in G.adjVerticles(v))

{

if (!marked[w])

{

dfs(G, w);

}

/**

* Returns the component id of the connected component containing vertex {@code v}.

* @param v the vertex

* @return the component id of the connected component containing vertex {@code v}

* @throws IllegalArgumentException unless {@code 0 <= v < V}

public int idGroup(int v)

{

validateVertex(v);

return id[v];

}

/**

* Returns the number of vertices in the connected component containing vertex {@code v}.

* @param v the vertex

* @return the number of vertices in the connected component containing vertex {@code v}

* @throws IllegalArgumentException unless {@code 0 <= v < V}

public int sizeGroup(int v)

{

validateVertex(v);

return size[id[v]];

}

/**

* Returns the number of connected components in the graph {@code G}.

* @return the number of connected components in the graph {@code G}

public int countGroup()

{

return count;

}

/**

* Returns true if vertices {@code v} and {@code w} are in the same

* connected component.

* @param v one vertex

* @param w the other vertex

* @return {@code true} if vertices {@code v} and {@code w} are in the same

* connected component; {@code false} otherwise

* @throws IllegalArgumentException unless {@code 0 <= v < V}

* @throws IllegalArgumentException unless {@code 0 <= w < V}

public bool connected(int v, int w)

{

validateVertex(v);

validateVertex(w);

return idGroup(v) == idGroup(w);

}

// throw an IllegalArgumentException unless {@code 0 <= v < V}

private void validateVertex(int v)

{

int V = marked.Length;

if (v < 0 || v >= V)

throw new ArgumentException("vertex " + v + " is not between 0 and " + (V - 1));

}

Graph.cs

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace SearchInGraphExample
{
    using System;
    using System.Collections.Generic;
    using System.Linq;
    using System.Text;
    using System.Threading.Tasks;
    using System.Collections;
    using System.IO;


    public class Graph
    {
        // private static final String NEWLINE = System.getProperty("line.separator");

        public int V { get; set; }
        public int E { get; set; }
        public Bag<int>[] adj { get; set; }


        /**
         * Initializes an empty graph with {@code V} vertices and 0 edges.
         * param V the number of vertices
         *
         * @param  V number of vertices
         * @throws IllegalArgumentException if {@code V < 0}
         */
        public Graph(int V)
        {
            if (V < 0) throw new ArgumentException("Number of vertices must be nonnegative");
            this.V = V;
            this.E = 0;
            adj = new Bag<int>[V];
            for (int v = 0; v < V; v++)
            {
                adj[v] = new Bag<int>();
            }
        }


        /**  
   * Initializes a graph from the specified input stream.
   * The format is the number of vertices <em>V</em>,
   * followed by the number of edges <em>E</em>,
   * followed by <em>E</em> pairs of vertices, with each entry separated by whitespace.
   *
   * @param  in the input stream
   * @throws IllegalArgumentException if the endpoints of any edge are not in prescribed range
   * @throws IllegalArgumentException if the number of vertices or edges is negative
   * @throws IllegalArgumentException if the input stream is in the wrong format
   */

        public Graph(string filepath)
        {
            try
            {
                using (StreamReader sr = new StreamReader(filepath))
                {
                    int i = 0;

                    while (sr.Peek() >= 0)
                    {
                        // reading number of verticles
                        if (i == 0)
                        {
                            V = Convert.ToInt32(sr.ReadLine());
                            adj = new Bag<int>[V];
                            for (int v = 0; v < V; v++)
                            {
                                adj[v] = new Bag<int>();
                            }
                            i++;
                        }
                        // reading number of edges
                        else
                            if (i == 1)
                        {
                            E = Convert.ToInt32(sr.ReadLine());
                            if (E < 0) throw new ArgumentException("number of edges in a Graph must be nonnegative");
                            i++;
                        }
                        else
                        {
                            //  for (int j = 0; j < E; j++)
                            //   {
                            string s = sr.ReadLine();
                            Char delimiter = ' ';
                            String[] substrings = s.Split(delimiter);
                            int v = Convert.ToInt32(substrings[0]);
                            int w = Convert.ToInt32(substrings[1]);
                            validateVertex(v);
                            validateVertex(w);
                            addEdge(v, w);
                        }

                    }
                }
            }
            catch (Exception e) { Console.WriteLine("The process failed: {0}", e.ToString()); };



        }
        // throw an IllegalArgumentException unless {@code 0 <= v < V}
        public void validateVertex(int v)
        {
            if (v < 0 || v >= V)
                throw new ArgumentException("vertex " + v + " is not between 0 and " + (V - 1));
        }
        /**
 * Adds the undirected edge v-w to this graph.
 *
 * @param  v one vertex in the edge
 * @param  w the other vertex in the edge
 * @throws IllegalArgumentException unless both {@code 0 <= v < V} and {@code 0 <= w < V}
 */
        public void addEdge(int v, int w)
        {
            validateVertex(v);
            validateVertex(w);
            E++;
            adj[v].push(w);
            adj[w].push(v);
        }
        /**
   * Returns the vertices adjacent to vertex {@code v}.
   *
   * @param  v the vertex
   * @return the vertices adjacent to vertex {@code v}, as an iterable
   * @throws IllegalArgumentException unless {@code 0 <= v < V}
   */
        public IEnumerable<int> adjVerticles(int v)
        {
            validateVertex(v);
            return adj[v];
        }
        /**
   * Returns the degree of vertex {@code v}.
   *
   * @param  v the vertex
   * @return the degree of vertex {@code v}
   * @throws IllegalArgumentException unless {@code 0 <= v < V}
   */
        public int degree(int v)
        {
            validateVertex(v);
            return adj[v].size();
        }
        /**
 * Returns a string representation of this graph.
 *
 * @return the number of vertices <em>V</em>, followed by the number of edges <em>E</em>,
 *         followed by the <em>V</em> adjacency lists
 */
        public String toString()
        {
            StringBuilder s = new StringBuilder();
            s.Append(V + " vertices, " + E + " edges " + "\n");
            for (int v = 0; v < V; v++)
            {
                s.Append(v + ": ");
                foreach (int w in adj[v])
                {
                    s.Append(w + " ");
                }
                s.Append("\n");
            }
            return s.ToString();
        }

    }


}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace SearchInGraphExample

{

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

using System.Collections;

using System.IO;

public class Graph

{

// private static final String NEWLINE = System.getProperty("line.separator");

public int V { get; set; }

public int E { get; set; }

public Bag<int>[] adj { get; set; }

/**

* Initializes an empty graph with {@code V} vertices and 0 edges.

* param V the number of vertices

* @param V number of vertices

* @throws IllegalArgumentException if {@code V < 0}

public Graph(int V)

{

if (V < 0) throw new ArgumentException("Number of vertices must be nonnegative");

this.V = V;

this.E = 0;

adj = new Bag<int>[V];

for (int v = 0; v < V; v++)

{

adj[v] = new Bag<int>();

}

/**

* Initializes a graph from the specified input stream.

* The format is the number of vertices V,

* followed by the number of edges E,

* followed by E pairs of vertices, with each entry separated by whitespace.

* @param in the input stream

* @throws IllegalArgumentException if the endpoints of any edge are not in prescribed range

* @throws IllegalArgumentException if the number of vertices or edges is negative

* @throws IllegalArgumentException if the input stream is in the wrong format

public Graph(string filepath)

{

try

{

using (StreamReader sr = new StreamReader(filepath))

{

int i = 0;

while (sr.Peek() >= 0)

{

// reading number of verticles

if (i == 0)

{

V = Convert.ToInt32(sr.ReadLine());

adj = new Bag<int>[V];

for (int v = 0; v < V; v++)

{

adj[v] = new Bag<int>();

}

i++;

}

// reading number of edges

else

if (i == 1)

{

E = Convert.ToInt32(sr.ReadLine());

if (E < 0) throw new ArgumentException("number of edges in a Graph must be nonnegative");

i++;

}

else

{

// for (int j = 0; j < E; j++)

// {

string s = sr.ReadLine();

Char delimiter = ' ';

String[] substrings = s.Split(delimiter);

int v = Convert.ToInt32(substrings[0]);

int w = Convert.ToInt32(substrings[1]);

validateVertex(v);

validateVertex(w);

addEdge(v, w);

}

catch (Exception e) { Console.WriteLine("The process failed: {0}", e.ToString()); };

}

// throw an IllegalArgumentException unless {@code 0 <= v < V}

public void validateVertex(int v)

{

if (v < 0 || v >= V)

throw new ArgumentException("vertex " + v + " is not between 0 and " + (V - 1));

}

/**

* Adds the undirected edge v-w to this graph.

* @param v one vertex in the edge

* @param w the other vertex in the edge

* @throws IllegalArgumentException unless both {@code 0 <= v < V} and {@code 0 <= w < V}

public void addEdge(int v, int w)

{

validateVertex(v);

validateVertex(w);

E++;

adj[v].push(w);

adj[w].push(v);

}

/**

* Returns the vertices adjacent to vertex {@code v}.

* @param v the vertex

* @return the vertices adjacent to vertex {@code v}, as an iterable

* @throws IllegalArgumentException unless {@code 0 <= v < V}

public IEnumerable<int> adjVerticles(int v)

{

validateVertex(v);

return adj[v];

}

/**

* Returns the degree of vertex {@code v}.

* @param v the vertex

* @return the degree of vertex {@code v}

* @throws IllegalArgumentException unless {@code 0 <= v < V}

public int degree(int v)

{

validateVertex(v);

return adj[v].size();

}

/**

* Returns a string representation of this graph.

* @return the number of vertices V, followed by the number of edges E,

* followed by the V adjacency lists

public String toString()

{

StringBuilder s = new StringBuilder();

s.Append(V + " vertices, " + E + " edges " + "\n");

for (int v = 0; v < V; v++)

{

s.Append(v + ": ");

foreach (int w in adj[v])

{

s.Append(w + " ");

}

s.Append("\n");

}

return s.ToString();

}

Bag.cs

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace SearchInGraphExample
{

    public class Bag<T> : IEnumerable<T>
    {

        Node<T> first;
        private int N;
        class Node<T>
        {
            public T item;
            public Node<T> next;
        }

        public bool isEmpty() { return (first == null) || (N == 0); }
        public int size() { return N; }
        public void push(T item)
        {
            // adding to the begining
            Node<T> oldfirst = first;
            first = new Node<T>();
            first.item = item;
            first.next = oldfirst;
            N++;
        }

        /* // no pop in stack method
        public T pop()
        {
            T item = first.item;
            first = first.next;
            N--;
            return item;
        }
        */

        System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()
        {
            return GetEnumerator();
        }

        public IEnumerator<T> GetEnumerator()
        {
            var node = first;
            while (node != null)
            {
                yield return node.item;
                node = node.next;
            }
        }

    }
}

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace SearchInGraphExample

{

public class Bag<T> : IEnumerable<T>

{

Node<T> first;

private int N;

class Node<T>

{

public T item;

public Node<T> next;

}

public bool isEmpty() { return (first == null) || (N == 0); }

public int size() { return N; }

public void push(T item)

{

// adding to the begining

Node<T> oldfirst = first;

first = new Node<T>();

first.item = item;

first.next = oldfirst;

N++;

}

/* // no pop in stack method

public T pop()

{

T item = first.item;

first = first.next;

N--;

return item;

}

System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()

{

return GetEnumerator();

}

public IEnumerator<T> GetEnumerator()

{

var node = first;

while (node != null)

{

yield return node.item;

node = node.next;

}

Test.cs

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace SearchInGraphExample
{
    class Program
    {
        static void Main(string[] args)
        {
            Graph g = new Graph("tinyG.txt");
            Console.WriteLine(g.toString());
            //testDFS(g);
            //testBFS(g);
            CCTest(g);


            Console.ReadLine();

        }

        static void CCTest(Graph g) // Closable components test
        {
            CC cc = new CC(g);
            Console.WriteLine();
            if (cc.connected(7, 8)) Console.WriteLine("Yes! 7 and 8 in one part of Graph, connected");
            if (!cc.connected(7, 0)) Console.WriteLine("N0! 7 and 0 in diff parts of Graph, not connected");
        }

        static void testBFS(Graph g)
        {
            BreadthFirstSearch bfp = new BreadthFirstSearch(g);
            // graph consists of 3 parts so we start search since 3 start elements
            bfp.bfs(g, 0);
            Console.WriteLine();
            bfp.bfs(g, 7);
            Console.WriteLine();
            bfp.bfs(g, 9);
        }

        static void testDFS(Graph g)
        {
            
            Console.WriteLine("Which verticles are marked?");
            DepthFirstSearch dfs = new DepthFirstSearch(g);

            // graph consists of 3 parts so we start search since 3 start elements
            dfs.dfs(g, 0);
            
            Console.WriteLine();
            dfs.dfs(g, 7); // will write to console if verticle marked
            Console.WriteLine();
            
            dfs.dfs(g, 9); // will write to console if verticle marked
            Console.WriteLine();

            dfs.unmarkAll();
            Console.WriteLine("Is verticle 12 in graph?");
            if (dfs.isVertex(g, 9, 12)) Console.WriteLine("Yes"); else Console.WriteLine("No");
            Console.Read();
        }
    }
}

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace SearchInGraphExample

{

class Program

{

static void Main(string[] args)

{

Graph g = new Graph("tinyG.txt");

Console.WriteLine(g.toString());

//testDFS(g);

//testBFS(g);

CCTest(g);

Console.ReadLine();

}

static void CCTest(Graph g) // Closable components test

{

CC cc = new CC(g);

Console.WriteLine();

if (cc.connected(7, 8)) Console.WriteLine("Yes! 7 and 8 in one part of Graph, connected");

if (!cc.connected(7, 0)) Console.WriteLine("N0! 7 and 0 in diff parts of Graph, not connected");

}

static void testBFS(Graph g)

{

BreadthFirstSearch bfp = new BreadthFirstSearch(g);

// graph consists of 3 parts so we start search since 3 start elements

bfp.bfs(g, 0);

Console.WriteLine();

bfp.bfs(g, 7);

Console.WriteLine();

bfp.bfs(g, 9);

}

static void testDFS(Graph g)

{

Console.WriteLine("Which verticles are marked?");

DepthFirstSearch dfs = new DepthFirstSearch(g);

// graph consists of 3 parts so we start search since 3 start elements

dfs.dfs(g, 0);

Console.WriteLine();

dfs.dfs(g, 7); // will write to console if verticle marked

Console.WriteLine();

dfs.dfs(g, 9); // will write to console if verticle marked

Console.WriteLine();

dfs.unmarkAll();

Console.WriteLine("Is verticle 12 in graph?");

if (dfs.isVertex(g, 9, 12)) Console.WriteLine("Yes"); else Console.WriteLine("No");

Console.Read();

}

Posted in C# | Leave a comment

Author Archives: Stanislav_Panteleev

Delphi. MVC pattern in UniGUI vs traditional coding to form

Delphi. UniGUI. Calc, just calc

MySQL. function to count ratio. Example from project

Delphi. FireMonkeyStyles

Delphi. FastReportVCL – merge / concat many reports

Delphi. FastReportVCL – change language to Russian, example

C#. BipartiteGraph

C#. DegreeOfSeparation

C#.Algo.SymbolGraph

C#. Algo.Graph. ClosableVertexSearch

C# WORLD

MySQL WORLD

DELPHI WORLD

JS WORLD

PHP World

IIS World

Recent Posts

Categories